./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fc4d323dccf5c6cb2dd33d7a9917b9da8c0abdef12ff69acd362adea0abef7c3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 08:33:12,718 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 08:33:12,815 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 08:33:12,822 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 08:33:12,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 08:33:12,849 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 08:33:12,850 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 08:33:12,850 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 08:33:12,851 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 08:33:12,851 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 08:33:12,852 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 08:33:12,852 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 08:33:12,853 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 08:33:12,853 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 08:33:12,853 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 08:33:12,854 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 08:33:12,854 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 08:33:12,855 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 08:33:12,855 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 08:33:12,855 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 08:33:12,856 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 08:33:12,856 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 08:33:12,857 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 08:33:12,857 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 08:33:12,857 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 08:33:12,858 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 08:33:12,858 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 08:33:12,858 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 08:33:12,858 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 08:33:12,859 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 08:33:12,859 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 08:33:12,859 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 08:33:12,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:33:12,860 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 08:33:12,861 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 08:33:12,861 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 08:33:12,861 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 08:33:12,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 08:33:12,862 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 08:33:12,862 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 08:33:12,863 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 08:33:12,863 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 08:33:12,863 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fc4d323dccf5c6cb2dd33d7a9917b9da8c0abdef12ff69acd362adea0abef7c3 [2024-10-14 08:33:13,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 08:33:13,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 08:33:13,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 08:33:13,156 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 08:33:13,156 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 08:33:13,158 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.i [2024-10-14 08:33:14,641 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 08:33:14,861 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 08:33:14,862 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.i [2024-10-14 08:33:14,879 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5b6822df/2a55384604214e95bc0ffee82ed8f91f/FLAG13e850e5f [2024-10-14 08:33:14,895 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5b6822df/2a55384604214e95bc0ffee82ed8f91f [2024-10-14 08:33:14,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 08:33:14,899 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 08:33:14,900 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 08:33:14,900 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 08:33:14,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 08:33:14,907 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:33:14" (1/1) ... [2024-10-14 08:33:14,910 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52f7bf15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:33:14, skipping insertion in model container [2024-10-14 08:33:14,910 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:33:14" (1/1) ... [2024-10-14 08:33:14,946 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 08:33:15,111 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.i[915,928] [2024-10-14 08:33:15,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:33:15,201 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 08:33:15,213 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.i[915,928] [2024-10-14 08:33:15,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:33:15,278 INFO L204 MainTranslator]: Completed translation [2024-10-14 08:33:15,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:33:15 WrapperNode [2024-10-14 08:33:15,278 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 08:33:15,280 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 08:33:15,280 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 08:33:15,280 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 08:33:15,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:33:15" (1/1) ... [2024-10-14 08:33:15,302 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:33:15" (1/1) ... [2024-10-14 08:33:15,339 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 241 [2024-10-14 08:33:15,340 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 08:33:15,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 08:33:15,341 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 08:33:15,341 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 08:33:15,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:33:15" (1/1) ... [2024-10-14 08:33:15,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:33:15" (1/1) ... [2024-10-14 08:33:15,355 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:33:15" (1/1) ... [2024-10-14 08:33:15,370 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 08:33:15,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:33:15" (1/1) ... [2024-10-14 08:33:15,370 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:33:15" (1/1) ... [2024-10-14 08:33:15,379 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:33:15" (1/1) ... [2024-10-14 08:33:15,382 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:33:15" (1/1) ... [2024-10-14 08:33:15,384 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:33:15" (1/1) ... [2024-10-14 08:33:15,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:33:15" (1/1) ... [2024-10-14 08:33:15,389 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 08:33:15,391 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 08:33:15,391 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 08:33:15,391 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 08:33:15,392 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:33:15" (1/1) ... [2024-10-14 08:33:15,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:33:15,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 08:33:15,443 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 08:33:15,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 08:33:15,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 08:33:15,493 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 08:33:15,494 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 08:33:15,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 08:33:15,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 08:33:15,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 08:33:15,593 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 08:33:15,594 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 08:33:16,005 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-14 08:33:16,006 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 08:33:16,041 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 08:33:16,041 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 08:33:16,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:33:16 BoogieIcfgContainer [2024-10-14 08:33:16,042 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 08:33:16,044 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 08:33:16,044 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 08:33:16,048 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 08:33:16,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:33:14" (1/3) ... [2024-10-14 08:33:16,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c227d89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:33:16, skipping insertion in model container [2024-10-14 08:33:16,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:33:15" (2/3) ... [2024-10-14 08:33:16,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c227d89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:33:16, skipping insertion in model container [2024-10-14 08:33:16,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:33:16" (3/3) ... [2024-10-14 08:33:16,053 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-30.i [2024-10-14 08:33:16,069 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 08:33:16,070 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 08:33:16,135 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 08:33:16,142 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2ad88ad8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 08:33:16,142 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 08:33:16,146 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 64 states have internal predecessors, (92), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-14 08:33:16,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-14 08:33:16,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:33:16,163 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:33:16,164 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:33:16,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:33:16,170 INFO L85 PathProgramCache]: Analyzing trace with hash -617147977, now seen corresponding path program 1 times [2024-10-14 08:33:16,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:33:16,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479521166] [2024-10-14 08:33:16,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:33:16,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:33:16,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:16,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:33:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:16,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:33:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:16,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:33:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:16,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 08:33:16,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:16,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 08:33:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:16,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 08:33:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:16,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 08:33:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:16,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 08:33:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:16,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 08:33:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:16,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 08:33:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:16,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 08:33:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:16,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 08:33:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:16,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 08:33:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:16,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 08:33:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:16,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 08:33:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:16,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 08:33:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:16,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 08:33:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:16,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 08:33:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:16,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 08:33:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:16,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 08:33:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:16,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 08:33:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:16,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 08:33:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:16,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 08:33:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:16,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 08:33:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:16,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 08:33:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:16,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-14 08:33:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:16,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 08:33:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:16,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-14 08:33:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:16,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 08:33:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:16,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-14 08:33:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:16,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-14 08:33:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:16,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-14 08:33:16,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:33:16,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479521166] [2024-10-14 08:33:16,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479521166] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:33:16,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:33:16,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 08:33:16,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040104512] [2024-10-14 08:33:16,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:33:16,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 08:33:16,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:33:16,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 08:33:16,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 08:33:16,786 INFO L87 Difference]: Start difference. First operand has 97 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 64 states have internal predecessors, (92), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-14 08:33:16,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:33:16,844 INFO L93 Difference]: Finished difference Result 191 states and 337 transitions. [2024-10-14 08:33:16,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 08:33:16,847 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 199 [2024-10-14 08:33:16,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:33:16,858 INFO L225 Difference]: With dead ends: 191 [2024-10-14 08:33:16,860 INFO L226 Difference]: Without dead ends: 95 [2024-10-14 08:33:16,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 08:33:16,871 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 08:33:16,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 08:33:16,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-14 08:33:16,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-14 08:33:16,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 62 states have (on average 1.403225806451613) internal successors, (87), 62 states have internal predecessors, (87), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-14 08:33:16,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 149 transitions. [2024-10-14 08:33:16,936 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 149 transitions. Word has length 199 [2024-10-14 08:33:16,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:33:16,937 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 149 transitions. [2024-10-14 08:33:16,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-14 08:33:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 149 transitions. [2024-10-14 08:33:16,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-14 08:33:16,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:33:16,942 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:33:16,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 08:33:16,943 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:33:16,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:33:16,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1696221605, now seen corresponding path program 1 times [2024-10-14 08:33:16,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:33:16,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398372661] [2024-10-14 08:33:16,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:33:16,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:33:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:33:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:33:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:33:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 08:33:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 08:33:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 08:33:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 08:33:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 08:33:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 08:33:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 08:33:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 08:33:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 08:33:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 08:33:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 08:33:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 08:33:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 08:33:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 08:33:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 08:33:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 08:33:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 08:33:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 08:33:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 08:33:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 08:33:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 08:33:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 08:33:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-14 08:33:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 08:33:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-14 08:33:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 08:33:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-14 08:33:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-14 08:33:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-14 08:33:17,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:33:17,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398372661] [2024-10-14 08:33:17,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398372661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:33:17,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:33:17,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 08:33:17,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852932217] [2024-10-14 08:33:17,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:33:17,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 08:33:17,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:33:17,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 08:33:17,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 08:33:17,398 INFO L87 Difference]: Start difference. First operand 95 states and 149 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-14 08:33:17,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:33:17,466 INFO L93 Difference]: Finished difference Result 253 states and 395 transitions. [2024-10-14 08:33:17,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 08:33:17,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 199 [2024-10-14 08:33:17,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:33:17,472 INFO L225 Difference]: With dead ends: 253 [2024-10-14 08:33:17,472 INFO L226 Difference]: Without dead ends: 159 [2024-10-14 08:33:17,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 08:33:17,476 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 96 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 08:33:17,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 285 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 08:33:17,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-14 08:33:17,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2024-10-14 08:33:17,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 106 states have (on average 1.4150943396226414) internal successors, (150), 107 states have internal predecessors, (150), 47 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-10-14 08:33:17,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 244 transitions. [2024-10-14 08:33:17,513 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 244 transitions. Word has length 199 [2024-10-14 08:33:17,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:33:17,515 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 244 transitions. [2024-10-14 08:33:17,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-14 08:33:17,515 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 244 transitions. [2024-10-14 08:33:17,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-14 08:33:17,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:33:17,521 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:33:17,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 08:33:17,522 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:33:17,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:33:17,522 INFO L85 PathProgramCache]: Analyzing trace with hash 107873703, now seen corresponding path program 1 times [2024-10-14 08:33:17,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:33:17,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645217246] [2024-10-14 08:33:17,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:33:17,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:33:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:33:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:33:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:33:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 08:33:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 08:33:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 08:33:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 08:33:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 08:33:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 08:33:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 08:33:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 08:33:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 08:33:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 08:33:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:17,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 08:33:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 08:33:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 08:33:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 08:33:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 08:33:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 08:33:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 08:33:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 08:33:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 08:33:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 08:33:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 08:33:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 08:33:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-14 08:33:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 08:33:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-14 08:33:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 08:33:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-14 08:33:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-14 08:33:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-14 08:33:18,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:33:18,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645217246] [2024-10-14 08:33:18,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645217246] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:33:18,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:33:18,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 08:33:18,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586480561] [2024-10-14 08:33:18,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:33:18,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 08:33:18,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:33:18,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 08:33:18,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 08:33:18,171 INFO L87 Difference]: Start difference. First operand 156 states and 244 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-14 08:33:18,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:33:18,473 INFO L93 Difference]: Finished difference Result 516 states and 811 transitions. [2024-10-14 08:33:18,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 08:33:18,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 199 [2024-10-14 08:33:18,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:33:18,484 INFO L225 Difference]: With dead ends: 516 [2024-10-14 08:33:18,484 INFO L226 Difference]: Without dead ends: 361 [2024-10-14 08:33:18,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 08:33:18,488 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 139 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 08:33:18,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 459 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 08:33:18,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-10-14 08:33:18,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 309. [2024-10-14 08:33:18,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 210 states have (on average 1.3904761904761904) internal successors, (292), 212 states have internal predecessors, (292), 94 states have call successors, (94), 4 states have call predecessors, (94), 4 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-14 08:33:18,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 480 transitions. [2024-10-14 08:33:18,546 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 480 transitions. Word has length 199 [2024-10-14 08:33:18,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:33:18,547 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 480 transitions. [2024-10-14 08:33:18,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-14 08:33:18,547 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 480 transitions. [2024-10-14 08:33:18,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-14 08:33:18,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:33:18,551 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:33:18,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 08:33:18,551 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:33:18,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:33:18,552 INFO L85 PathProgramCache]: Analyzing trace with hash 2136253968, now seen corresponding path program 1 times [2024-10-14 08:33:18,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:33:18,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749634553] [2024-10-14 08:33:18,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:33:18,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:33:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:33:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:33:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:33:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 08:33:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 08:33:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 08:33:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 08:33:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 08:33:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 08:33:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 08:33:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 08:33:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 08:33:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 08:33:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 08:33:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 08:33:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 08:33:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 08:33:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 08:33:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 08:33:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 08:33:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 08:33:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 08:33:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 08:33:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 08:33:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 08:33:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-14 08:33:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 08:33:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-14 08:33:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 08:33:18,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-14 08:33:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-14 08:33:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:18,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-14 08:33:18,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:33:18,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749634553] [2024-10-14 08:33:18,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749634553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:33:18,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:33:18,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 08:33:18,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15062552] [2024-10-14 08:33:18,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:33:18,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 08:33:18,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:33:18,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 08:33:18,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 08:33:18,891 INFO L87 Difference]: Start difference. First operand 309 states and 480 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-14 08:33:19,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:33:19,175 INFO L93 Difference]: Finished difference Result 929 states and 1446 transitions. [2024-10-14 08:33:19,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 08:33:19,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 200 [2024-10-14 08:33:19,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:33:19,184 INFO L225 Difference]: With dead ends: 929 [2024-10-14 08:33:19,186 INFO L226 Difference]: Without dead ends: 621 [2024-10-14 08:33:19,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 08:33:19,189 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 80 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 08:33:19,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 352 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 08:33:19,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2024-10-14 08:33:19,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 619. [2024-10-14 08:33:19,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 422 states have (on average 1.3791469194312795) internal successors, (582), 426 states have internal predecessors, (582), 188 states have call successors, (188), 8 states have call predecessors, (188), 8 states have return successors, (188), 184 states have call predecessors, (188), 188 states have call successors, (188) [2024-10-14 08:33:19,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 958 transitions. [2024-10-14 08:33:19,282 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 958 transitions. Word has length 200 [2024-10-14 08:33:19,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:33:19,283 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 958 transitions. [2024-10-14 08:33:19,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-14 08:33:19,284 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 958 transitions. [2024-10-14 08:33:19,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-14 08:33:19,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:33:19,288 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:33:19,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 08:33:19,288 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:33:19,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:33:19,289 INFO L85 PathProgramCache]: Analyzing trace with hash -878849650, now seen corresponding path program 1 times [2024-10-14 08:33:19,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:33:19,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518314917] [2024-10-14 08:33:19,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:33:19,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:33:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:19,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:33:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:19,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:33:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:19,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:33:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:19,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 08:33:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:19,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 08:33:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:19,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 08:33:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:19,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 08:33:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:19,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 08:33:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:19,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 08:33:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:19,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 08:33:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:19,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 08:33:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:19,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 08:33:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:19,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 08:33:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:19,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 08:33:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:19,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 08:33:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:19,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 08:33:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:19,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 08:33:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:19,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 08:33:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:19,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 08:33:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:19,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 08:33:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:19,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 08:33:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:19,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 08:33:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:19,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 08:33:19,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:19,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 08:33:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:19,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 08:33:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:19,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-14 08:33:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:19,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 08:33:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:19,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-14 08:33:19,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:19,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 08:33:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:19,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-14 08:33:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:19,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-14 08:33:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:19,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-10-14 08:33:19,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:33:19,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518314917] [2024-10-14 08:33:19,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518314917] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 08:33:19,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887752751] [2024-10-14 08:33:19,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:33:19,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 08:33:19,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 08:33:19,830 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 08:33:19,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 08:33:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:20,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 08:33:20,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:33:21,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 62 proven. 174 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-14 08:33:21,170 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 08:33:21,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-10-14 08:33:21,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887752751] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 08:33:21,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 08:33:21,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2024-10-14 08:33:21,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182409711] [2024-10-14 08:33:21,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 08:33:21,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 08:33:21,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:33:21,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 08:33:21,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-14 08:33:21,530 INFO L87 Difference]: Start difference. First operand 619 states and 958 transitions. Second operand has 13 states, 13 states have (on average 7.384615384615385) internal successors, (96), 13 states have internal predecessors, (96), 3 states have call successors, (61), 3 states have call predecessors, (61), 5 states have return successors, (62), 2 states have call predecessors, (62), 3 states have call successors, (62) [2024-10-14 08:33:22,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:33:22,077 INFO L93 Difference]: Finished difference Result 1102 states and 1661 transitions. [2024-10-14 08:33:22,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 08:33:22,078 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.384615384615385) internal successors, (96), 13 states have internal predecessors, (96), 3 states have call successors, (61), 3 states have call predecessors, (61), 5 states have return successors, (62), 2 states have call predecessors, (62), 3 states have call successors, (62) Word has length 200 [2024-10-14 08:33:22,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:33:22,101 INFO L225 Difference]: With dead ends: 1102 [2024-10-14 08:33:22,101 INFO L226 Difference]: Without dead ends: 792 [2024-10-14 08:33:22,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 454 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2024-10-14 08:33:22,105 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 336 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 08:33:22,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 346 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 08:33:22,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2024-10-14 08:33:22,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 683. [2024-10-14 08:33:22,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 470 states have (on average 1.323404255319149) internal successors, (622), 474 states have internal predecessors, (622), 188 states have call successors, (188), 24 states have call predecessors, (188), 24 states have return successors, (188), 184 states have call predecessors, (188), 188 states have call successors, (188) [2024-10-14 08:33:22,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 998 transitions. [2024-10-14 08:33:22,231 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 998 transitions. Word has length 200 [2024-10-14 08:33:22,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:33:22,232 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 998 transitions. [2024-10-14 08:33:22,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.384615384615385) internal successors, (96), 13 states have internal predecessors, (96), 3 states have call successors, (61), 3 states have call predecessors, (61), 5 states have return successors, (62), 2 states have call predecessors, (62), 3 states have call successors, (62) [2024-10-14 08:33:22,233 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 998 transitions. [2024-10-14 08:33:22,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-14 08:33:22,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:33:22,235 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:33:22,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 08:33:22,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 08:33:22,440 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:33:22,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:33:22,440 INFO L85 PathProgramCache]: Analyzing trace with hash -436033535, now seen corresponding path program 1 times [2024-10-14 08:33:22,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:33:22,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054610023] [2024-10-14 08:33:22,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:33:22,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:33:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:22,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:33:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:22,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:33:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:22,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:33:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:22,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 08:33:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:22,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 08:33:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:22,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 08:33:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:22,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 08:33:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:22,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 08:33:22,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:22,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 08:33:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:22,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 08:33:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:22,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 08:33:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:22,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 08:33:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:22,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 08:33:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:22,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 08:33:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:22,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 08:33:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:22,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 08:33:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:22,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 08:33:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:22,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 08:33:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:22,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 08:33:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:22,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 08:33:22,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:22,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 08:33:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:22,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 08:33:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:22,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 08:33:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:22,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 08:33:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:22,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 08:33:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:22,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-14 08:33:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:22,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 08:33:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:22,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-14 08:33:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:22,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-14 08:33:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:22,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-14 08:33:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:22,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-14 08:33:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:22,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-14 08:33:22,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:33:22,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054610023] [2024-10-14 08:33:22,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054610023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:33:22,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:33:22,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 08:33:22,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849155055] [2024-10-14 08:33:22,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:33:22,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 08:33:22,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:33:22,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 08:33:22,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 08:33:22,602 INFO L87 Difference]: Start difference. First operand 683 states and 998 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-14 08:33:22,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:33:22,723 INFO L93 Difference]: Finished difference Result 1365 states and 1995 transitions. [2024-10-14 08:33:22,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 08:33:22,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 201 [2024-10-14 08:33:22,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:33:22,729 INFO L225 Difference]: With dead ends: 1365 [2024-10-14 08:33:22,730 INFO L226 Difference]: Without dead ends: 683 [2024-10-14 08:33:22,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 08:33:22,733 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 08:33:22,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 263 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 08:33:22,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2024-10-14 08:33:22,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 683. [2024-10-14 08:33:22,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 470 states have (on average 1.3063829787234043) internal successors, (614), 474 states have internal predecessors, (614), 188 states have call successors, (188), 24 states have call predecessors, (188), 24 states have return successors, (188), 184 states have call predecessors, (188), 188 states have call successors, (188) [2024-10-14 08:33:22,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 990 transitions. [2024-10-14 08:33:22,877 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 990 transitions. Word has length 201 [2024-10-14 08:33:22,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:33:22,878 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 990 transitions. [2024-10-14 08:33:22,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-14 08:33:22,879 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 990 transitions. [2024-10-14 08:33:22,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-10-14 08:33:22,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:33:22,881 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:33:22,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 08:33:22,882 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:33:22,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:33:22,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1575682659, now seen corresponding path program 1 times [2024-10-14 08:33:22,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:33:22,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188497826] [2024-10-14 08:33:22,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:33:22,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:33:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 08:33:22,978 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 08:33:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 08:33:23,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 08:33:23,102 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 08:33:23,103 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 08:33:23,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 08:33:23,107 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:33:23,250 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 08:33:23,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:33:23 BoogieIcfgContainer [2024-10-14 08:33:23,254 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 08:33:23,254 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 08:33:23,255 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 08:33:23,255 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 08:33:23,255 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:33:16" (3/4) ... [2024-10-14 08:33:23,257 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 08:33:23,258 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 08:33:23,259 INFO L158 Benchmark]: Toolchain (without parser) took 8359.60ms. Allocated memory was 163.6MB in the beginning and 304.1MB in the end (delta: 140.5MB). Free memory was 107.4MB in the beginning and 164.0MB in the end (delta: -56.6MB). Peak memory consumption was 85.5MB. Max. memory is 16.1GB. [2024-10-14 08:33:23,259 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 163.6MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 08:33:23,259 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.61ms. Allocated memory is still 163.6MB. Free memory was 107.4MB in the beginning and 91.7MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 08:33:23,259 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.21ms. Allocated memory is still 163.6MB. Free memory was 91.7MB in the beginning and 88.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 08:33:23,261 INFO L158 Benchmark]: Boogie Preprocessor took 49.42ms. Allocated memory is still 163.6MB. Free memory was 88.5MB in the beginning and 85.1MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 08:33:23,261 INFO L158 Benchmark]: RCFGBuilder took 651.52ms. Allocated memory is still 163.6MB. Free memory was 85.1MB in the beginning and 125.3MB in the end (delta: -40.2MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2024-10-14 08:33:23,262 INFO L158 Benchmark]: TraceAbstraction took 7209.97ms. Allocated memory was 163.6MB in the beginning and 304.1MB in the end (delta: 140.5MB). Free memory was 124.4MB in the beginning and 165.0MB in the end (delta: -40.6MB). Peak memory consumption was 98.7MB. Max. memory is 16.1GB. [2024-10-14 08:33:23,262 INFO L158 Benchmark]: Witness Printer took 3.87ms. Allocated memory is still 304.1MB. Free memory was 165.0MB in the beginning and 164.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 08:33:23,263 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 163.6MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.61ms. Allocated memory is still 163.6MB. Free memory was 107.4MB in the beginning and 91.7MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.21ms. Allocated memory is still 163.6MB. Free memory was 91.7MB in the beginning and 88.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.42ms. Allocated memory is still 163.6MB. Free memory was 88.5MB in the beginning and 85.1MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 651.52ms. Allocated memory is still 163.6MB. Free memory was 85.1MB in the beginning and 125.3MB in the end (delta: -40.2MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7209.97ms. Allocated memory was 163.6MB in the beginning and 304.1MB in the end (delta: 140.5MB). Free memory was 124.4MB in the beginning and 165.0MB in the end (delta: -40.6MB). Peak memory consumption was 98.7MB. Max. memory is 16.1GB. * Witness Printer took 3.87ms. Allocated memory is still 304.1MB. Free memory was 165.0MB in the beginning and 164.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 180, overapproximation of someUnaryDOUBLEoperation at line 39, overapproximation of someBinaryArithmeticDOUBLEoperation at line 113, overapproximation of someBinaryDOUBLEComparisonOperation at line 189. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] double var_1_5 = 127.5; [L25] double var_1_7 = 10000000000000.125; [L26] double var_1_8 = 1.25; [L27] double var_1_10 = 25.7; [L28] signed long int var_1_11 = -2; [L29] signed long int var_1_13 = 5; [L30] signed long int var_1_14 = 128; [L31] signed long int var_1_15 = 1000; [L32] double var_1_16 = 0.2; [L33] double var_1_17 = 0.25; [L34] double var_1_18 = 99999999999999.5; [L35] signed short int var_1_19 = -64; [L36] double var_1_20 = 256.75; [L37] double var_1_21 = 100.4; [L38] double var_1_22 = 4.5; [L39] double var_1_23 = -0.5; [L40] signed long int var_1_24 = 10; [L41] signed char var_1_25 = -8; [L42] signed char var_1_26 = 32; [L43] unsigned long int var_1_27 = 64; [L44] unsigned char var_1_28 = 0; [L45] unsigned long int var_1_29 = 32; [L46] unsigned char var_1_30 = 10; [L47] unsigned char var_1_31 = 10; [L48] unsigned char var_1_32 = 32; [L49] unsigned char var_1_33 = 5; [L50] unsigned char var_1_34 = 8; [L51] unsigned char var_1_35 = 128; [L52] float var_1_36 = 7.5; [L53] float var_1_37 = 2.5; [L54] unsigned char last_1_var_1_1 = 1; [L55] signed long int last_1_var_1_11 = -2; [L56] signed long int last_1_var_1_15 = 1000; [L57] double last_1_var_1_16 = 0.2; [L193] isInitial = 1 [L194] FCALL initially() [L195] COND TRUE 1 [L196] CALL updateLastVariables() [L183] last_1_var_1_1 = var_1_1 [L184] last_1_var_1_11 = var_1_11 [L185] last_1_var_1_15 = var_1_15 [L186] last_1_var_1_16 = var_1_16 [L196] RET updateLastVariables() [L197] CALL updateVariables() [L130] var_1_4 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L131] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L132] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L132] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L133] var_1_7 = __VERIFIER_nondet_double() [L134] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L134] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L135] var_1_10 = __VERIFIER_nondet_double() [L136] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L136] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L137] var_1_13 = __VERIFIER_nondet_long() [L138] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L138] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L139] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L139] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L140] var_1_14 = __VERIFIER_nondet_long() [L141] CALL assume_abort_if_not(var_1_14 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L141] RET assume_abort_if_not(var_1_14 >= -2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L142] CALL assume_abort_if_not(var_1_14 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L142] RET assume_abort_if_not(var_1_14 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L143] var_1_17 = __VERIFIER_nondet_double() [L144] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L144] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L145] var_1_18 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L146] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L147] var_1_20 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_20 >= -922337.2036854776000e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L148] RET assume_abort_if_not((var_1_20 >= -922337.2036854776000e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L149] var_1_21 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L150] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L151] var_1_22 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L152] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L153] var_1_23 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_23 >= -922337.2036854776000e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854776000e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L154] RET assume_abort_if_not((var_1_23 >= -922337.2036854776000e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854776000e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=32, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L155] var_1_26 = __VERIFIER_nondet_char() [L156] CALL assume_abort_if_not(var_1_26 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L156] RET assume_abort_if_not(var_1_26 >= -127) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L157] CALL assume_abort_if_not(var_1_26 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L157] RET assume_abort_if_not(var_1_26 <= 126) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L158] var_1_28 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L159] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L160] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L160] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=32, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L161] var_1_29 = __VERIFIER_nondet_ulong() [L162] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L162] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L163] CALL assume_abort_if_not(var_1_29 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L163] RET assume_abort_if_not(var_1_29 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L164] var_1_31 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L165] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L166] CALL assume_abort_if_not(var_1_31 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L166] RET assume_abort_if_not(var_1_31 <= 64) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=32, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L167] var_1_32 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L168] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L169] CALL assume_abort_if_not(var_1_32 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L169] RET assume_abort_if_not(var_1_32 <= 63) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=5, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L170] var_1_33 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L171] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L172] CALL assume_abort_if_not(var_1_33 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L172] RET assume_abort_if_not(var_1_33 <= 127) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=8, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L173] var_1_34 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L174] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L175] CALL assume_abort_if_not(var_1_34 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L175] RET assume_abort_if_not(var_1_34 <= 127) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=128, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L176] var_1_35 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_35 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L177] RET assume_abort_if_not(var_1_35 >= 127) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L178] CALL assume_abort_if_not(var_1_35 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L178] RET assume_abort_if_not(var_1_35 <= 254) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_37=5/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L179] var_1_37 = __VERIFIER_nondet_float() [L180] CALL assume_abort_if_not((var_1_37 >= -922337.2036854765600e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L180] RET assume_abort_if_not((var_1_37 >= -922337.2036854765600e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L197] RET updateVariables() [L198] CALL step() [L61] COND TRUE (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))) - var_1_21) == (var_1_22 * var_1_23) [L62] var_1_19 = -4 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L64] var_1_24 = var_1_19 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-8, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L65] COND TRUE var_1_20 <= var_1_22 [L66] var_1_25 = var_1_26 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L68] EXPR var_1_25 | var_1_19 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=10, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L68] COND FALSE !((var_1_26 <= (var_1_25 | var_1_19)) || var_1_28) [L71] COND FALSE !(\read(var_1_28)) [L74] var_1_30 = (((((var_1_35 - var_1_34)) > (var_1_31)) ? ((var_1_35 - var_1_34)) : (var_1_31))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=15/2, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L76] var_1_36 = var_1_37 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L77] COND TRUE \read(last_1_var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L78] COND TRUE ((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16 [L79] var_1_11 = ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L84] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L85] COND TRUE (last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= stepLocal_0 [L86] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L88] signed long int stepLocal_2 = var_1_11; [L89] unsigned char stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, stepLocal_2=1000, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L90] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, stepLocal_2=1000, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L91] COND TRUE var_1_11 >= stepLocal_2 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L92] COND TRUE stepLocal_1 || (var_1_11 < var_1_11) [L93] var_1_5 = var_1_7 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L99] EXPR var_1_11 & var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L99] COND FALSE !((- var_1_11) > (var_1_11 & var_1_13)) [L110] var_1_15 = var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=0, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L112] COND TRUE ((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7 [L113] var_1_16 = (var_1_17 + (var_1_18 + 16.75)) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L117] COND TRUE 10.55f < var_1_16 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L118] COND TRUE var_1_16 > (var_1_7 * var_1_16) [L119] var_1_8 = ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] [L198] RET step() [L199] CALL, EXPR property() [L189] EXPR ((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] [L189-L190] return (((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13)))) && ((((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7) ? (var_1_16 == ((double) (var_1_17 + (var_1_18 + 16.75)))) : (var_1_16 == ((double) var_1_17))) ; [L199] RET, EXPR property() [L199] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=1000, var_1_13=0, var_1_14=1000, var_1_15=0, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=0, var_1_29=4294967294, var_1_30=64, var_1_31=64, var_1_32=63, var_1_33=0, var_1_34=127, var_1_35=191, var_1_36=100000000000005, var_1_37=100000000000005, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 7, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 652 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 651 mSDsluCounter, 1851 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 979 mSDsCounter, 175 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 486 IncrementalHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 175 mSolverCounterUnsat, 872 mSDtfsCounter, 486 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 837 GetRequests, 805 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=683occurred in iteration=5, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 6 MinimizatonAttempts, 166 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1600 NumberOfCodeBlocks, 1600 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1590 ConstructedInterpolants, 0 QuantifiedInterpolants, 5964 SizeOfPredicates, 3 NumberOfNonLiveVariables, 458 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 14526/14880 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 08:33:23,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fc4d323dccf5c6cb2dd33d7a9917b9da8c0abdef12ff69acd362adea0abef7c3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 08:33:25,610 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 08:33:25,697 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 08:33:25,704 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 08:33:25,705 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 08:33:25,737 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 08:33:25,737 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 08:33:25,738 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 08:33:25,738 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 08:33:25,738 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 08:33:25,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 08:33:25,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 08:33:25,740 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 08:33:25,740 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 08:33:25,742 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 08:33:25,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 08:33:25,743 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 08:33:25,745 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 08:33:25,746 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 08:33:25,746 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 08:33:25,746 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 08:33:25,747 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 08:33:25,747 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 08:33:25,747 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 08:33:25,749 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 08:33:25,749 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 08:33:25,749 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 08:33:25,750 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 08:33:25,750 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 08:33:25,750 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 08:33:25,751 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 08:33:25,751 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 08:33:25,751 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 08:33:25,751 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 08:33:25,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:33:25,752 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 08:33:25,752 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 08:33:25,752 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 08:33:25,752 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 08:33:25,753 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 08:33:25,753 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 08:33:25,754 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 08:33:25,754 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 08:33:25,755 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 08:33:25,755 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 08:33:25,755 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fc4d323dccf5c6cb2dd33d7a9917b9da8c0abdef12ff69acd362adea0abef7c3 [2024-10-14 08:33:26,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 08:33:26,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 08:33:26,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 08:33:26,133 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 08:33:26,133 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 08:33:26,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.i [2024-10-14 08:33:27,682 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 08:33:27,943 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 08:33:27,947 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.i [2024-10-14 08:33:27,965 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69a97ac38/9b3c91da5cfb4e4eb33229535410e481/FLAG922841a3c [2024-10-14 08:33:27,984 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69a97ac38/9b3c91da5cfb4e4eb33229535410e481 [2024-10-14 08:33:27,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 08:33:27,988 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 08:33:27,992 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 08:33:27,992 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 08:33:27,997 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 08:33:27,998 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:33:27" (1/1) ... [2024-10-14 08:33:27,999 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ef689b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:33:27, skipping insertion in model container [2024-10-14 08:33:28,000 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:33:27" (1/1) ... [2024-10-14 08:33:28,032 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 08:33:28,218 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.i[915,928] [2024-10-14 08:33:28,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:33:28,341 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 08:33:28,355 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-30.i[915,928] [2024-10-14 08:33:28,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:33:28,436 INFO L204 MainTranslator]: Completed translation [2024-10-14 08:33:28,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:33:28 WrapperNode [2024-10-14 08:33:28,442 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 08:33:28,444 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 08:33:28,444 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 08:33:28,444 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 08:33:28,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:33:28" (1/1) ... [2024-10-14 08:33:28,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:33:28" (1/1) ... [2024-10-14 08:33:28,515 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2024-10-14 08:33:28,515 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 08:33:28,516 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 08:33:28,516 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 08:33:28,516 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 08:33:28,538 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:33:28" (1/1) ... [2024-10-14 08:33:28,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:33:28" (1/1) ... [2024-10-14 08:33:28,545 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:33:28" (1/1) ... [2024-10-14 08:33:28,573 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 08:33:28,574 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:33:28" (1/1) ... [2024-10-14 08:33:28,574 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:33:28" (1/1) ... [2024-10-14 08:33:28,592 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:33:28" (1/1) ... [2024-10-14 08:33:28,600 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:33:28" (1/1) ... [2024-10-14 08:33:28,607 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:33:28" (1/1) ... [2024-10-14 08:33:28,614 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:33:28" (1/1) ... [2024-10-14 08:33:28,623 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 08:33:28,626 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 08:33:28,626 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 08:33:28,626 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 08:33:28,627 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:33:28" (1/1) ... [2024-10-14 08:33:28,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:33:28,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 08:33:28,660 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 08:33:28,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 08:33:28,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 08:33:28,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 08:33:28,699 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 08:33:28,699 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 08:33:28,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 08:33:28,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 08:33:28,824 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 08:33:28,827 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 08:33:48,506 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-14 08:33:48,506 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 08:33:48,566 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 08:33:48,570 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 08:33:48,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:33:48 BoogieIcfgContainer [2024-10-14 08:33:48,571 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 08:33:48,573 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 08:33:48,576 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 08:33:48,581 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 08:33:48,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:33:27" (1/3) ... [2024-10-14 08:33:48,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea60424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:33:48, skipping insertion in model container [2024-10-14 08:33:48,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:33:28" (2/3) ... [2024-10-14 08:33:48,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea60424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:33:48, skipping insertion in model container [2024-10-14 08:33:48,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:33:48" (3/3) ... [2024-10-14 08:33:48,585 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-30.i [2024-10-14 08:33:48,604 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 08:33:48,604 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 08:33:48,688 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 08:33:48,707 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@11161285, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 08:33:48,707 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 08:33:48,712 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-14 08:33:48,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-14 08:33:48,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:33:48,731 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:33:48,731 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:33:48,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:33:48,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1261669085, now seen corresponding path program 1 times [2024-10-14 08:33:48,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 08:33:48,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1171104226] [2024-10-14 08:33:48,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:33:48,755 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 08:33:48,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 08:33:48,758 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 08:33:48,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 08:33:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:49,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 08:33:49,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:33:49,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 816 proven. 0 refuted. 0 times theorem prover too weak. 1044 trivial. 0 not checked. [2024-10-14 08:33:49,610 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 08:33:49,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 08:33:49,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1171104226] [2024-10-14 08:33:49,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1171104226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:33:49,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:33:49,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 08:33:49,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179787066] [2024-10-14 08:33:49,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:33:49,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 08:33:49,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 08:33:49,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 08:33:49,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 08:33:49,654 INFO L87 Difference]: Start difference. First operand has 85 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-14 08:33:54,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 08:33:54,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:33:54,387 INFO L93 Difference]: Finished difference Result 167 states and 299 transitions. [2024-10-14 08:33:54,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 08:33:54,429 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 195 [2024-10-14 08:33:54,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:33:54,436 INFO L225 Difference]: With dead ends: 167 [2024-10-14 08:33:54,437 INFO L226 Difference]: Without dead ends: 83 [2024-10-14 08:33:54,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 08:33:54,443 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-14 08:33:54,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2024-10-14 08:33:54,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-14 08:33:54,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-14 08:33:54,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-14 08:33:54,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 130 transitions. [2024-10-14 08:33:54,497 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 130 transitions. Word has length 195 [2024-10-14 08:33:54,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:33:54,498 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 130 transitions. [2024-10-14 08:33:54,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-14 08:33:54,498 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 130 transitions. [2024-10-14 08:33:54,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-14 08:33:54,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:33:54,503 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:33:54,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 08:33:54,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 08:33:54,704 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:33:54,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:33:54,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1492440081, now seen corresponding path program 1 times [2024-10-14 08:33:54,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 08:33:54,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137967371] [2024-10-14 08:33:54,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:33:54,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 08:33:54,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 08:33:54,710 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 08:33:54,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 08:33:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:33:55,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 08:33:55,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:33:57,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-14 08:33:57,701 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 08:33:57,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 08:33:57,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137967371] [2024-10-14 08:33:57,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [137967371] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:33:57,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:33:57,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 08:33:57,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464907167] [2024-10-14 08:33:57,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:33:57,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 08:33:57,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 08:33:57,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 08:33:57,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 08:33:57,706 INFO L87 Difference]: Start difference. First operand 83 states and 130 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-14 08:34:02,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 08:34:06,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 08:34:10,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 08:34:14,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 08:34:18,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 08:34:22,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 08:34:22,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:34:22,458 INFO L93 Difference]: Finished difference Result 264 states and 415 transitions. [2024-10-14 08:34:22,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 08:34:22,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 195 [2024-10-14 08:34:22,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:34:22,506 INFO L225 Difference]: With dead ends: 264 [2024-10-14 08:34:22,507 INFO L226 Difference]: Without dead ends: 182 [2024-10-14 08:34:22,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 08:34:22,509 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 99 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 65 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.7s IncrementalHoareTripleChecker+Time [2024-10-14 08:34:22,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 392 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 16 Invalid, 6 Unknown, 0 Unchecked, 24.7s Time] [2024-10-14 08:34:22,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-14 08:34:22,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 163. [2024-10-14 08:34:22,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 98 states have (on average 1.336734693877551) internal successors, (131), 98 states have internal predecessors, (131), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-14 08:34:22,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 255 transitions. [2024-10-14 08:34:22,554 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 255 transitions. Word has length 195 [2024-10-14 08:34:22,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:34:22,555 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 255 transitions. [2024-10-14 08:34:22,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-14 08:34:22,556 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 255 transitions. [2024-10-14 08:34:22,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-14 08:34:22,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:34:22,559 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:34:22,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 08:34:22,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 08:34:22,760 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:34:22,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:34:22,761 INFO L85 PathProgramCache]: Analyzing trace with hash 2041267944, now seen corresponding path program 1 times [2024-10-14 08:34:22,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 08:34:22,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [318984200] [2024-10-14 08:34:22,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:34:22,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 08:34:22,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 08:34:22,764 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 08:34:22,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 08:34:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:34:23,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 08:34:23,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:34:28,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 62 proven. 174 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-14 08:34:28,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 08:34:30,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-10-14 08:34:30,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 08:34:30,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [318984200] [2024-10-14 08:34:30,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [318984200] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 08:34:30,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 08:34:30,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2024-10-14 08:34:30,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734274171] [2024-10-14 08:34:30,693 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 08:34:30,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 08:34:30,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 08:34:30,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 08:34:30,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-14 08:34:30,699 INFO L87 Difference]: Start difference. First operand 163 states and 255 transitions. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 3 states have call successors, (61), 3 states have call predecessors, (61), 5 states have return successors, (62), 2 states have call predecessors, (62), 3 states have call successors, (62) [2024-10-14 08:34:38,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 08:34:42,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []