./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-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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-68.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 fc81e632ae2e206eca1f9d4133845a59a7f377b1ec66d9f118cf23bdbc748cd0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 03:35:36,827 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 03:35:36,895 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 03:35:36,900 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 03:35:36,903 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 03:35:36,937 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 03:35:36,938 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 03:35:36,938 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 03:35:36,939 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 03:35:36,941 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 03:35:36,944 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 03:35:36,944 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 03:35:36,945 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 03:35:36,945 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 03:35:36,945 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 03:35:36,946 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 03:35:36,946 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 03:35:36,946 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 03:35:36,947 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 03:35:36,947 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 03:35:36,947 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 03:35:36,948 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 03:35:36,948 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 03:35:36,948 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 03:35:36,949 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 03:35:36,949 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 03:35:36,949 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 03:35:36,949 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 03:35:36,950 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 03:35:36,950 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 03:35:36,950 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 03:35:36,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 03:35:36,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 03:35:36,951 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 03:35:36,951 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 03:35:36,951 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 03:35:36,952 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 03:35:36,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 03:35:36,952 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 03:35:36,952 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 03:35:36,953 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 03:35:36,953 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 03:35:36,953 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 -> fc81e632ae2e206eca1f9d4133845a59a7f377b1ec66d9f118cf23bdbc748cd0 [2024-11-20 03:35:37,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 03:35:37,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 03:35:37,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 03:35:37,235 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 03:35:37,235 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 03:35:37,236 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-68.i [2024-11-20 03:35:38,761 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 03:35:38,999 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 03:35:38,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-68.i [2024-11-20 03:35:39,013 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a66613ea/5fafc3e7541d439994daa3456ed68895/FLAG437374991 [2024-11-20 03:35:39,029 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a66613ea/5fafc3e7541d439994daa3456ed68895 [2024-11-20 03:35:39,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 03:35:39,034 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 03:35:39,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 03:35:39,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 03:35:39,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 03:35:39,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:35:39" (1/1) ... [2024-11-20 03:35:39,040 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef746cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:35:39, skipping insertion in model container [2024-11-20 03:35:39,040 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:35:39" (1/1) ... [2024-11-20 03:35:39,076 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 03:35:39,254 WARN L250 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-68.i[915,928] [2024-11-20 03:35:39,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 03:35:39,342 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 03:35:39,352 WARN L250 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-68.i[915,928] [2024-11-20 03:35:39,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 03:35:39,400 INFO L204 MainTranslator]: Completed translation [2024-11-20 03:35:39,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:35:39 WrapperNode [2024-11-20 03:35:39,401 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 03:35:39,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 03:35:39,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 03:35:39,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 03:35:39,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:35:39" (1/1) ... [2024-11-20 03:35:39,418 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:35:39" (1/1) ... [2024-11-20 03:35:39,455 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2024-11-20 03:35:39,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 03:35:39,457 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 03:35:39,457 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 03:35:39,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 03:35:39,468 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:35:39" (1/1) ... [2024-11-20 03:35:39,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:35:39" (1/1) ... [2024-11-20 03:35:39,471 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:35:39" (1/1) ... [2024-11-20 03:35:39,498 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-11-20 03:35:39,499 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:35:39" (1/1) ... [2024-11-20 03:35:39,499 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:35:39" (1/1) ... [2024-11-20 03:35:39,508 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:35:39" (1/1) ... [2024-11-20 03:35:39,512 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:35:39" (1/1) ... [2024-11-20 03:35:39,514 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:35:39" (1/1) ... [2024-11-20 03:35:39,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:35:39" (1/1) ... [2024-11-20 03:35:39,521 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 03:35:39,522 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 03:35:39,522 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 03:35:39,522 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 03:35:39,523 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:35:39" (1/1) ... [2024-11-20 03:35:39,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 03:35:39,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 03:35:39,565 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-11-20 03:35:39,568 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-11-20 03:35:39,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 03:35:39,613 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 03:35:39,613 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 03:35:39,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 03:35:39,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 03:35:39,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 03:35:39,695 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 03:35:39,697 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 03:35:40,157 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-20 03:35:40,159 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 03:35:40,174 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 03:35:40,176 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 03:35:40,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:35:40 BoogieIcfgContainer [2024-11-20 03:35:40,177 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 03:35:40,179 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 03:35:40,179 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 03:35:40,182 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 03:35:40,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:35:39" (1/3) ... [2024-11-20 03:35:40,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e678e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:35:40, skipping insertion in model container [2024-11-20 03:35:40,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:35:39" (2/3) ... [2024-11-20 03:35:40,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e678e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:35:40, skipping insertion in model container [2024-11-20 03:35:40,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:35:40" (3/3) ... [2024-11-20 03:35:40,186 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-68.i [2024-11-20 03:35:40,202 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 03:35:40,202 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 03:35:40,274 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 03:35:40,281 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;@4082be6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 03:35:40,281 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 03:35:40,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 03:35:40,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-20 03:35:40,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:35:40,300 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 03:35:40,300 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:35:40,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:35:40,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1104653924, now seen corresponding path program 1 times [2024-11-20 03:35:40,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:35:40,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804909516] [2024-11-20 03:35:40,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:35:40,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:35:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:40,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:35:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:40,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:35:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:40,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:35:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:40,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:35:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:40,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 03:35:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:40,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:35:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:40,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 03:35:40,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:40,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 03:35:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:40,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 03:35:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:40,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 03:35:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:40,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 03:35:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:40,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 03:35:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:40,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 03:35:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:40,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 03:35:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:40,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 03:35:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:40,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 03:35:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:40,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 03:35:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:40,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 03:35:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:40,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 03:35:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:40,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 03:35:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:40,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 03:35:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:40,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 03:35:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:40,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 03:35:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:40,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 03:35:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:40,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-20 03:35:40,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:35:40,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804909516] [2024-11-20 03:35:40,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804909516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:35:40,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:35:40,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 03:35:40,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802661645] [2024-11-20 03:35:40,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:35:40,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 03:35:40,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:35:40,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 03:35:40,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 03:35:40,847 INFO L87 Difference]: Start difference. First operand has 86 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-20 03:35:40,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:35:40,887 INFO L93 Difference]: Finished difference Result 163 states and 280 transitions. [2024-11-20 03:35:40,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 03:35:40,889 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 161 [2024-11-20 03:35:40,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:35:40,897 INFO L225 Difference]: With dead ends: 163 [2024-11-20 03:35:40,897 INFO L226 Difference]: Without dead ends: 80 [2024-11-20 03:35:40,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-11-20 03:35:40,903 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 03:35:40,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 03:35:40,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-20 03:35:40,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-20 03:35:40,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 03:35:40,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 121 transitions. [2024-11-20 03:35:40,946 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 121 transitions. Word has length 161 [2024-11-20 03:35:40,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:35:40,947 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 121 transitions. [2024-11-20 03:35:40,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-20 03:35:40,947 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 121 transitions. [2024-11-20 03:35:40,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-20 03:35:40,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:35:40,951 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 03:35:40,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 03:35:40,952 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:35:40,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:35:40,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1641542244, now seen corresponding path program 1 times [2024-11-20 03:35:40,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:35:40,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928096995] [2024-11-20 03:35:40,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:35:40,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:35:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:41,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:35:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:41,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:35:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:41,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:35:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:41,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:35:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:41,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 03:35:41,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:41,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:35:41,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:41,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 03:35:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:41,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 03:35:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:41,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 03:35:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:41,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 03:35:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:41,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 03:35:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:41,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 03:35:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:41,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 03:35:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:41,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 03:35:41,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:41,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 03:35:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:41,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 03:35:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:41,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 03:35:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:41,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 03:35:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:41,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 03:35:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:41,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 03:35:41,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:41,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 03:35:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:41,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 03:35:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:41,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 03:35:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:41,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 03:35:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:41,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-20 03:35:41,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:35:41,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928096995] [2024-11-20 03:35:41,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928096995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:35:41,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:35:41,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 03:35:41,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353616645] [2024-11-20 03:35:41,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:35:41,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 03:35:41,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:35:41,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 03:35:41,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 03:35:41,435 INFO L87 Difference]: Start difference. First operand 80 states and 121 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 03:35:41,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:35:41,607 INFO L93 Difference]: Finished difference Result 157 states and 239 transitions. [2024-11-20 03:35:41,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 03:35:41,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-11-20 03:35:41,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:35:41,611 INFO L225 Difference]: With dead ends: 157 [2024-11-20 03:35:41,611 INFO L226 Difference]: Without dead ends: 80 [2024-11-20 03:35:41,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 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-11-20 03:35:41,614 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 113 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 03:35:41,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 168 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 03:35:41,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-20 03:35:41,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-20 03:35:41,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 54 states have internal predecessors, (72), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 03:35:41,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 120 transitions. [2024-11-20 03:35:41,630 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 120 transitions. Word has length 161 [2024-11-20 03:35:41,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:35:41,632 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 120 transitions. [2024-11-20 03:35:41,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 03:35:41,633 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 120 transitions. [2024-11-20 03:35:41,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-20 03:35:41,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:35:41,638 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 03:35:41,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 03:35:41,639 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:35:41,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:35:41,640 INFO L85 PathProgramCache]: Analyzing trace with hash 2141380196, now seen corresponding path program 1 times [2024-11-20 03:35:41,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:35:41,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537595109] [2024-11-20 03:35:41,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:35:41,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:35:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:42,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:35:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:42,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:35:42,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:42,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:35:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:42,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:35:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:42,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 03:35:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:42,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:35:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:42,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 03:35:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:42,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 03:35:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:42,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 03:35:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:42,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 03:35:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:42,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 03:35:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:42,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 03:35:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:42,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 03:35:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:42,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 03:35:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:42,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 03:35:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:42,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 03:35:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:42,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 03:35:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:42,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 03:35:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:42,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 03:35:42,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:42,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 03:35:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:42,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 03:35:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:42,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 03:35:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:42,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 03:35:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:42,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 03:35:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:42,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-20 03:35:42,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:35:42,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537595109] [2024-11-20 03:35:42,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537595109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:35:42,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:35:42,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 03:35:42,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981313050] [2024-11-20 03:35:42,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:35:42,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 03:35:42,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:35:42,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 03:35:42,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 03:35:42,691 INFO L87 Difference]: Start difference. First operand 80 states and 120 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 03:35:43,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:35:43,351 INFO L93 Difference]: Finished difference Result 288 states and 425 transitions. [2024-11-20 03:35:43,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 03:35:43,352 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2024-11-20 03:35:43,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:35:43,356 INFO L225 Difference]: With dead ends: 288 [2024-11-20 03:35:43,358 INFO L226 Difference]: Without dead ends: 211 [2024-11-20 03:35:43,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-20 03:35:43,362 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 208 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 03:35:43,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 531 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 03:35:43,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-20 03:35:43,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 153. [2024-11-20 03:35:43,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 101 states have (on average 1.297029702970297) internal successors, (131), 101 states have internal predecessors, (131), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 03:35:43,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 227 transitions. [2024-11-20 03:35:43,395 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 227 transitions. Word has length 162 [2024-11-20 03:35:43,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:35:43,396 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 227 transitions. [2024-11-20 03:35:43,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 03:35:43,397 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 227 transitions. [2024-11-20 03:35:43,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-20 03:35:43,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:35:43,399 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 03:35:43,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 03:35:43,399 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:35:43,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:35:43,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1076372771, now seen corresponding path program 1 times [2024-11-20 03:35:43,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:35:43,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620762823] [2024-11-20 03:35:43,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:35:43,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:35:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:43,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:35:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:43,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:35:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:43,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:35:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:43,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:35:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:43,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 03:35:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:43,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:35:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:43,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 03:35:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:43,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 03:35:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:43,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 03:35:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:43,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 03:35:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:43,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 03:35:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:43,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 03:35:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:43,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 03:35:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:43,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 03:35:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:43,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 03:35:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:43,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 03:35:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:43,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 03:35:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:43,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 03:35:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:43,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 03:35:43,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:43,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 03:35:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:43,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 03:35:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:43,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 03:35:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:43,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 03:35:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:43,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 03:35:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:43,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-20 03:35:43,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:35:43,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620762823] [2024-11-20 03:35:43,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620762823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:35:43,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:35:43,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 03:35:43,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12112042] [2024-11-20 03:35:43,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:35:43,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 03:35:43,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:35:43,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 03:35:43,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 03:35:43,971 INFO L87 Difference]: Start difference. First operand 153 states and 227 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 03:35:44,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:35:44,461 INFO L93 Difference]: Finished difference Result 303 states and 444 transitions. [2024-11-20 03:35:44,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 03:35:44,462 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 163 [2024-11-20 03:35:44,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:35:44,466 INFO L225 Difference]: With dead ends: 303 [2024-11-20 03:35:44,466 INFO L226 Difference]: Without dead ends: 226 [2024-11-20 03:35:44,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-20 03:35:44,468 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 226 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 03:35:44,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 544 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 03:35:44,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-20 03:35:44,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 154. [2024-11-20 03:35:44,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 102 states have (on average 1.303921568627451) internal successors, (133), 102 states have internal predecessors, (133), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 03:35:44,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 229 transitions. [2024-11-20 03:35:44,500 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 229 transitions. Word has length 163 [2024-11-20 03:35:44,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:35:44,501 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 229 transitions. [2024-11-20 03:35:44,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 03:35:44,501 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 229 transitions. [2024-11-20 03:35:44,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-20 03:35:44,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:35:44,503 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 03:35:44,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 03:35:44,504 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:35:44,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:35:44,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1630246623, now seen corresponding path program 1 times [2024-11-20 03:35:44,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:35:44,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043483368] [2024-11-20 03:35:44,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:35:44,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:35:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:44,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:35:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:44,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:35:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:44,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:35:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:44,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:35:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:44,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 03:35:44,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:44,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:35:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:44,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 03:35:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:44,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 03:35:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:44,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 03:35:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:44,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 03:35:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:44,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 03:35:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:45,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 03:35:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:45,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 03:35:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:45,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 03:35:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:45,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 03:35:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:45,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 03:35:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:45,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 03:35:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:45,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 03:35:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:45,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 03:35:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:45,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 03:35:45,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:45,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 03:35:45,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:45,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 03:35:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:45,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 03:35:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:45,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 03:35:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:45,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 75 proven. 57 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2024-11-20 03:35:45,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:35:45,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043483368] [2024-11-20 03:35:45,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043483368] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 03:35:45,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536433166] [2024-11-20 03:35:45,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:35:45,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 03:35:45,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 03:35:45,096 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-11-20 03:35:45,098 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-11-20 03:35:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:45,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-20 03:35:45,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 03:35:46,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 706 proven. 117 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2024-11-20 03:35:46,154 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 03:35:46,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 75 proven. 60 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-20 03:35:46,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536433166] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 03:35:46,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 03:35:46,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 10] total 21 [2024-11-20 03:35:46,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759439929] [2024-11-20 03:35:46,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 03:35:46,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-20 03:35:46,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:35:46,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-20 03:35:46,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2024-11-20 03:35:46,640 INFO L87 Difference]: Start difference. First operand 154 states and 229 transitions. Second operand has 21 states, 21 states have (on average 4.428571428571429) internal successors, (93), 21 states have internal predecessors, (93), 6 states have call successors, (46), 4 states have call predecessors, (46), 9 states have return successors, (49), 6 states have call predecessors, (49), 6 states have call successors, (49) [2024-11-20 03:35:47,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:35:47,492 INFO L93 Difference]: Finished difference Result 302 states and 420 transitions. [2024-11-20 03:35:47,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-20 03:35:47,493 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.428571428571429) internal successors, (93), 21 states have internal predecessors, (93), 6 states have call successors, (46), 4 states have call predecessors, (46), 9 states have return successors, (49), 6 states have call predecessors, (49), 6 states have call successors, (49) Word has length 163 [2024-11-20 03:35:47,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:35:47,495 INFO L225 Difference]: With dead ends: 302 [2024-11-20 03:35:47,495 INFO L226 Difference]: Without dead ends: 202 [2024-11-20 03:35:47,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=432, Invalid=1208, Unknown=0, NotChecked=0, Total=1640 [2024-11-20 03:35:47,497 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 336 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 03:35:47,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 454 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 03:35:47,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-20 03:35:47,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 182. [2024-11-20 03:35:47,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 123 states have (on average 1.2357723577235773) internal successors, (152), 123 states have internal predecessors, (152), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 03:35:47,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 248 transitions. [2024-11-20 03:35:47,523 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 248 transitions. Word has length 163 [2024-11-20 03:35:47,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:35:47,523 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 248 transitions. [2024-11-20 03:35:47,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.428571428571429) internal successors, (93), 21 states have internal predecessors, (93), 6 states have call successors, (46), 4 states have call predecessors, (46), 9 states have return successors, (49), 6 states have call predecessors, (49), 6 states have call successors, (49) [2024-11-20 03:35:47,524 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 248 transitions. [2024-11-20 03:35:47,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-20 03:35:47,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:35:47,526 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 03:35:47,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 03:35:47,726 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-11-20 03:35:47,727 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:35:47,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:35:47,727 INFO L85 PathProgramCache]: Analyzing trace with hash 281481291, now seen corresponding path program 1 times [2024-11-20 03:35:47,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:35:47,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166883516] [2024-11-20 03:35:47,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:35:47,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:35:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 03:35:47,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [841519516] [2024-11-20 03:35:47,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:35:47,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 03:35:47,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 03:35:47,788 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 03:35:47,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 03:35:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 03:35:47,911 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 03:35:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 03:35:48,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 03:35:48,095 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 03:35:48,096 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 03:35:48,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-20 03:35:48,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-20 03:35:48,301 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-20 03:35:48,426 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 03:35:48,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 03:35:48 BoogieIcfgContainer [2024-11-20 03:35:48,429 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 03:35:48,430 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 03:35:48,430 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 03:35:48,430 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 03:35:48,431 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:35:40" (3/4) ... [2024-11-20 03:35:48,434 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 03:35:48,435 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 03:35:48,435 INFO L158 Benchmark]: Toolchain (without parser) took 9401.82ms. Allocated memory was 144.7MB in the beginning and 232.8MB in the end (delta: 88.1MB). Free memory was 116.2MB in the beginning and 94.5MB in the end (delta: 21.7MB). Peak memory consumption was 111.7MB. Max. memory is 16.1GB. [2024-11-20 03:35:48,436 INFO L158 Benchmark]: CDTParser took 0.76ms. Allocated memory is still 109.1MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 03:35:48,436 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.44ms. Allocated memory is still 144.7MB. Free memory was 116.2MB in the beginning and 99.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 03:35:48,438 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.37ms. Allocated memory is still 144.7MB. Free memory was 99.4MB in the beginning and 95.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 03:35:48,438 INFO L158 Benchmark]: Boogie Preprocessor took 64.28ms. Allocated memory is still 144.7MB. Free memory was 95.3MB in the beginning and 90.4MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 03:35:48,438 INFO L158 Benchmark]: RCFGBuilder took 655.10ms. Allocated memory is still 144.7MB. Free memory was 90.4MB in the beginning and 64.3MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-20 03:35:48,438 INFO L158 Benchmark]: TraceAbstraction took 8250.33ms. Allocated memory was 144.7MB in the beginning and 232.8MB in the end (delta: 88.1MB). Free memory was 63.6MB in the beginning and 94.5MB in the end (delta: -30.9MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. [2024-11-20 03:35:48,439 INFO L158 Benchmark]: Witness Printer took 4.97ms. Allocated memory is still 232.8MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 03:35:48,440 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.76ms. Allocated memory is still 109.1MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.44ms. Allocated memory is still 144.7MB. Free memory was 116.2MB in the beginning and 99.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.37ms. Allocated memory is still 144.7MB. Free memory was 99.4MB in the beginning and 95.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.28ms. Allocated memory is still 144.7MB. Free memory was 95.3MB in the beginning and 90.4MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 655.10ms. Allocated memory is still 144.7MB. Free memory was 90.4MB in the beginning and 64.3MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8250.33ms. Allocated memory was 144.7MB in the beginning and 232.8MB in the end (delta: 88.1MB). Free memory was 63.6MB in the beginning and 94.5MB in the end (delta: -30.9MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. * Witness Printer took 4.97ms. Allocated memory is still 232.8MB. Free memory is still 94.5MB. There was no memory consumed. 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 someBinaryDOUBLEComparisonOperation at line 170, overapproximation of someBinaryFLOATComparisonOperation at line 170, overapproximation of someBinaryArithmeticDOUBLEoperation at line 59. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_5 = 0; [L24] unsigned char var_1_6 = 0; [L25] unsigned char var_1_7 = 1; [L26] unsigned char var_1_8 = 32; [L27] double var_1_9 = 4.6; [L28] double var_1_10 = 9.25; [L29] double var_1_11 = 1.25; [L30] unsigned char var_1_12 = 100; [L31] unsigned char var_1_13 = 64; [L32] unsigned char var_1_14 = 0; [L33] float var_1_15 = 7.5; [L34] signed long int var_1_16 = 0; [L35] unsigned char var_1_17 = 1; [L36] unsigned char var_1_18 = 0; [L37] unsigned char var_1_19 = 1; [L38] unsigned char var_1_20 = 0; [L39] double var_1_21 = 4.65; [L40] unsigned char var_1_22 = 0; [L41] double var_1_23 = 9999999999.1; [L42] double var_1_24 = 5.5; [L43] unsigned short int var_1_25 = 16; [L44] unsigned short int var_1_26 = 100; [L45] signed long int var_1_27 = 32; [L46] float var_1_28 = 1.95; [L47] unsigned char var_1_29 = 0; [L48] unsigned char var_1_30 = 0; [L49] unsigned long int var_1_31 = 0; [L50] double last_1_var_1_9 = 4.6; [L51] unsigned char last_1_var_1_12 = 100; [L52] unsigned char last_1_var_1_14 = 0; [L53] signed long int last_1_var_1_16 = 0; VAL [isInitial=0, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L174] isInitial = 1 [L175] FCALL initially() [L176] COND TRUE 1 [L177] CALL updateLastVariables() [L164] last_1_var_1_9 = var_1_9 [L165] last_1_var_1_12 = var_1_12 [L166] last_1_var_1_14 = var_1_14 [L167] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L177] RET updateLastVariables() [L178] CALL updateVariables() [L125] var_1_5 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L126] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L127] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L127] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L128] var_1_7 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L129] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L130] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L130] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L131] var_1_8 = __VERIFIER_nondet_uchar() [L132] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L132] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L133] CALL assume_abort_if_not(var_1_8 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L133] RET assume_abort_if_not(var_1_8 <= 255) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L134] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L134] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [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_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [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_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L137] var_1_13 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L138] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L139] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L139] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L140] var_1_18 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L141] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L142] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L142] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L143] var_1_19 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L144] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L145] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L145] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L146] var_1_20 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L147] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L148] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L148] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L149] var_1_22 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L150] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L151] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L151] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L152] var_1_23 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L153] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L154] var_1_24 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L155] RET assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L156] var_1_26 = __VERIFIER_nondet_ushort() [L157] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L157] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L158] CALL assume_abort_if_not(var_1_26 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L158] RET assume_abort_if_not(var_1_26 <= 65534) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L159] var_1_30 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_30 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=-255, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=-255, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L160] RET assume_abort_if_not(var_1_30 >= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=-255, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L161] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=-255, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=-255, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L161] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=-255, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L178] RET updateVariables() [L179] CALL step() [L57] var_1_17 = (var_1_18 || (var_1_19 && var_1_20)) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=-255, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L58] COND TRUE ! var_1_22 [L59] var_1_21 = (var_1_23 - ((((7.7) > (var_1_24)) ? (7.7) : (var_1_24)))) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=-255, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L61] var_1_25 = var_1_26 [L62] var_1_27 = var_1_25 [L63] var_1_28 = var_1_23 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=-255, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L64] COND FALSE !(var_1_18 || var_1_17) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=-255, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L67] COND TRUE var_1_21 >= var_1_28 [L68] var_1_29 = (! var_1_30) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=-255, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L73] COND TRUE var_1_19 && ((var_1_23 + var_1_28) >= var_1_21) [L74] var_1_31 = var_1_25 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=-255, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L76] signed long int stepLocal_4 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=-255, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L77] COND FALSE !(\read(last_1_var_1_14)) [L88] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=-255, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L90] var_1_16 = last_1_var_1_12 [L91] unsigned long int stepLocal_6 = var_1_13 % (5u + 256u); [L92] signed long int stepLocal_5 = var_1_13 + 16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, stepLocal_5=16, stepLocal_6=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=-255, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L93] COND TRUE stepLocal_6 <= var_1_16 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, stepLocal_5=16, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=-255, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L94] COND FALSE !(stepLocal_5 >= var_1_16) [L97] var_1_14 = var_1_7 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=-255, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L100] unsigned char stepLocal_0 = var_1_12; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_0=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=-255, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L101] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_0=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=-255, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L101] COND TRUE stepLocal_0 <= (var_1_12 ^ var_1_12) [L102] var_1_1 = (! var_1_5) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=-255, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L106] unsigned char stepLocal_2 = var_1_12 < (var_1_16 / var_1_8); [L107] signed long int stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_1=100, stepLocal_2=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=-255, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L108] COND FALSE !(-256 >= stepLocal_1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_2=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=-255, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L111] COND FALSE !(stepLocal_2 || ((var_1_5 && var_1_7) && var_1_1)) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=-255, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L115] unsigned char stepLocal_3 = ! var_1_5; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_3=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=-255, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L116] COND TRUE (var_1_7 && var_1_14) || stepLocal_3 [L117] var_1_11 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=3, var_1_11=3, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=-255, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L119] var_1_15 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=3, var_1_11=3, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=3, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=-255, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=23/5] [L120] COND TRUE ((((((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) > (var_1_12)) ? (((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) : (var_1_12))) <= (50 * var_1_8) [L121] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=3, var_1_11=3, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=3, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=-255, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=3] [L179] RET step() [L180] CALL, EXPR property() [L170] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=3, var_1_11=3, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=3, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=-255, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=3] [L170-L171] return ((((((((var_1_12 <= (var_1_12 ^ var_1_12)) ? (var_1_1 == ((unsigned char) (! var_1_5))) : (var_1_1 == ((unsigned char) (! var_1_5)))) && ((-256 >= var_1_16) ? (var_1_6 == ((unsigned char) (var_1_1 || var_1_7))) : (((var_1_12 < (var_1_16 / var_1_8)) || ((var_1_5 && var_1_7) && var_1_1)) ? (var_1_6 == ((unsigned char) var_1_7)) : 1))) && ((((((((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) > (var_1_12)) ? (((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) : (var_1_12))) <= (50 * var_1_8)) ? (var_1_9 == ((double) var_1_10)) : 1)) && (((var_1_7 && var_1_14) || (! var_1_5)) ? (var_1_11 == ((double) var_1_10)) : 1)) && (last_1_var_1_14 ? ((var_1_10 >= (- last_1_var_1_9)) ? ((var_1_8 != last_1_var_1_16) ? (var_1_12 == ((unsigned char) var_1_13)) : (var_1_12 == ((unsigned char) 50))) : (var_1_12 == ((unsigned char) var_1_13))) : (var_1_12 == ((unsigned char) var_1_13)))) && (((var_1_13 % (5u + 256u)) <= var_1_16) ? (((var_1_13 + 16) >= var_1_16) ? (var_1_14 == ((unsigned char) var_1_7)) : (var_1_14 == ((unsigned char) var_1_7))) : 1)) && (var_1_15 == ((float) var_1_10))) && (var_1_16 == ((signed long int) last_1_var_1_12)) ; [L180] RET, EXPR property() [L180] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=3, var_1_11=3, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=3, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=-255, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=3] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=3, var_1_11=3, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=3, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=-255, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-411, var_1_9=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 6, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 893 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 883 mSDsluCounter, 1818 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1234 mSDsCounter, 357 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1114 IncrementalHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 357 mSolverCounterUnsat, 584 mSDtfsCounter, 1114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 653 GetRequests, 591 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=182occurred in iteration=5, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 150 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1301 NumberOfCodeBlocks, 1301 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1129 ConstructedInterpolants, 0 QuantifiedInterpolants, 3841 SizeOfPredicates, 11 NumberOfNonLiveVariables, 405 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 7494/7728 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-11-20 03:35:48,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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-68.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 fc81e632ae2e206eca1f9d4133845a59a7f377b1ec66d9f118cf23bdbc748cd0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 03:35:50,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 03:35:50,794 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 03:35:50,800 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 03:35:50,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 03:35:50,836 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 03:35:50,837 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 03:35:50,837 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 03:35:50,838 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 03:35:50,838 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 03:35:50,838 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 03:35:50,839 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 03:35:50,840 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 03:35:50,842 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 03:35:50,842 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 03:35:50,843 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 03:35:50,843 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 03:35:50,843 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 03:35:50,843 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 03:35:50,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 03:35:50,844 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 03:35:50,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 03:35:50,848 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 03:35:50,848 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 03:35:50,849 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 03:35:50,849 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 03:35:50,849 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 03:35:50,849 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 03:35:50,850 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 03:35:50,850 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 03:35:50,850 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 03:35:50,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 03:35:50,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 03:35:50,853 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 03:35:50,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 03:35:50,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 03:35:50,853 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 03:35:50,855 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 03:35:50,855 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 03:35:50,855 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 03:35:50,855 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 03:35:50,856 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 03:35:50,856 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 03:35:50,856 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 03:35:50,857 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 -> fc81e632ae2e206eca1f9d4133845a59a7f377b1ec66d9f118cf23bdbc748cd0 [2024-11-20 03:35:51,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 03:35:51,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 03:35:51,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 03:35:51,259 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 03:35:51,259 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 03:35:51,261 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-68.i [2024-11-20 03:35:52,975 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 03:35:53,217 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 03:35:53,218 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-68.i [2024-11-20 03:35:53,236 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/716959d50/4257f96d3806492294473cd7e3e986b5/FLAG32bf6c50d [2024-11-20 03:35:53,553 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/716959d50/4257f96d3806492294473cd7e3e986b5 [2024-11-20 03:35:53,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 03:35:53,557 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 03:35:53,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 03:35:53,558 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 03:35:53,565 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 03:35:53,566 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:35:53" (1/1) ... [2024-11-20 03:35:53,567 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fd12564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:35:53, skipping insertion in model container [2024-11-20 03:35:53,570 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:35:53" (1/1) ... [2024-11-20 03:35:53,606 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 03:35:53,817 WARN L250 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-68.i[915,928] [2024-11-20 03:35:53,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 03:35:53,929 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 03:35:53,943 WARN L250 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-68.i[915,928] [2024-11-20 03:35:53,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 03:35:54,021 INFO L204 MainTranslator]: Completed translation [2024-11-20 03:35:54,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:35:54 WrapperNode [2024-11-20 03:35:54,022 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 03:35:54,024 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 03:35:54,024 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 03:35:54,024 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 03:35:54,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:35:54" (1/1) ... [2024-11-20 03:35:54,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:35:54" (1/1) ... [2024-11-20 03:35:54,088 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 177 [2024-11-20 03:35:54,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 03:35:54,090 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 03:35:54,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 03:35:54,091 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 03:35:54,102 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:35:54" (1/1) ... [2024-11-20 03:35:54,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:35:54" (1/1) ... [2024-11-20 03:35:54,106 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:35:54" (1/1) ... [2024-11-20 03:35:54,131 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-11-20 03:35:54,135 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:35:54" (1/1) ... [2024-11-20 03:35:54,136 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:35:54" (1/1) ... [2024-11-20 03:35:54,153 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:35:54" (1/1) ... [2024-11-20 03:35:54,157 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:35:54" (1/1) ... [2024-11-20 03:35:54,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:35:54" (1/1) ... [2024-11-20 03:35:54,168 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:35:54" (1/1) ... [2024-11-20 03:35:54,176 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 03:35:54,178 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 03:35:54,178 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 03:35:54,178 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 03:35:54,179 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:35:54" (1/1) ... [2024-11-20 03:35:54,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 03:35:54,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 03:35:54,221 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-11-20 03:35:54,228 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-11-20 03:35:54,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 03:35:54,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 03:35:54,284 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 03:35:54,285 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 03:35:54,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 03:35:54,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 03:35:54,365 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 03:35:54,367 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 03:35:56,751 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-20 03:35:56,752 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 03:35:56,766 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 03:35:56,768 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 03:35:56,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:35:56 BoogieIcfgContainer [2024-11-20 03:35:56,768 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 03:35:56,772 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 03:35:56,772 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 03:35:56,776 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 03:35:56,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:35:53" (1/3) ... [2024-11-20 03:35:56,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f294ea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:35:56, skipping insertion in model container [2024-11-20 03:35:56,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:35:54" (2/3) ... [2024-11-20 03:35:56,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f294ea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:35:56, skipping insertion in model container [2024-11-20 03:35:56,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:35:56" (3/3) ... [2024-11-20 03:35:56,782 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-68.i [2024-11-20 03:35:56,802 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 03:35:56,802 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 03:35:56,892 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 03:35:56,898 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;@398e5b6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 03:35:56,899 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 03:35:56,904 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 50 states have (on average 1.38) internal successors, (69), 51 states have internal predecessors, (69), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 03:35:56,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-20 03:35:56,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:35:56,922 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 03:35:56,923 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:35:56,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:35:56,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1951749019, now seen corresponding path program 1 times [2024-11-20 03:35:56,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 03:35:56,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [198571046] [2024-11-20 03:35:56,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:35:56,947 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-11-20 03:35:56,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 03:35:56,950 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-11-20 03:35:56,970 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-11-20 03:35:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:57,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 03:35:57,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 03:35:57,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-20 03:35:57,498 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 03:35:57,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 03:35:57,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [198571046] [2024-11-20 03:35:57,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [198571046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:35:57,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:35:57,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 03:35:57,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297399826] [2024-11-20 03:35:57,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:35:57,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 03:35:57,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 03:35:57,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 03:35:57,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 03:35:57,556 INFO L87 Difference]: Start difference. First operand has 77 states, 50 states have (on average 1.38) internal successors, (69), 51 states have internal predecessors, (69), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-20 03:35:57,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:35:57,597 INFO L93 Difference]: Finished difference Result 147 states and 252 transitions. [2024-11-20 03:35:57,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 03:35:57,600 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 158 [2024-11-20 03:35:57,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:35:57,610 INFO L225 Difference]: With dead ends: 147 [2024-11-20 03:35:57,611 INFO L226 Difference]: Without dead ends: 73 [2024-11-20 03:35:57,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 157 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-11-20 03:35:57,622 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 03:35:57,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 03:35:57,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-20 03:35:57,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-20 03:35:57,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 47 states have internal predecessors, (62), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 03:35:57,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 110 transitions. [2024-11-20 03:35:57,680 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 110 transitions. Word has length 158 [2024-11-20 03:35:57,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:35:57,681 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 110 transitions. [2024-11-20 03:35:57,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-20 03:35:57,682 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 110 transitions. [2024-11-20 03:35:57,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-20 03:35:57,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:35:57,687 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 03:35:57,706 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-11-20 03:35:57,888 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-11-20 03:35:57,889 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:35:57,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:35:57,890 INFO L85 PathProgramCache]: Analyzing trace with hash 970690459, now seen corresponding path program 1 times [2024-11-20 03:35:57,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 03:35:57,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [959591291] [2024-11-20 03:35:57,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:35:57,891 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-11-20 03:35:57,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 03:35:57,896 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-11-20 03:35:57,897 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-11-20 03:35:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:35:58,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 03:35:58,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 03:35:59,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 689 proven. 57 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2024-11-20 03:35:59,091 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 03:35:59,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 75 proven. 60 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-20 03:35:59,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 03:35:59,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [959591291] [2024-11-20 03:35:59,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [959591291] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 03:35:59,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 03:35:59,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-11-20 03:35:59,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826830157] [2024-11-20 03:35:59,593 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 03:35:59,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 03:35:59,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 03:35:59,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 03:35:59,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-20 03:35:59,613 INFO L87 Difference]: Start difference. First operand 73 states and 110 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2024-11-20 03:36:00,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:36:00,817 INFO L93 Difference]: Finished difference Result 180 states and 261 transitions. [2024-11-20 03:36:00,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-20 03:36:00,818 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) Word has length 158 [2024-11-20 03:36:00,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:36:00,829 INFO L225 Difference]: With dead ends: 180 [2024-11-20 03:36:00,829 INFO L226 Difference]: Without dead ends: 110 [2024-11-20 03:36:00,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 302 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=193, Invalid=359, Unknown=0, NotChecked=0, Total=552 [2024-11-20 03:36:00,832 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 164 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 03:36:00,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 303 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 03:36:00,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-20 03:36:00,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2024-11-20 03:36:00,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 63 states have internal predecessors, (76), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 03:36:00,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 144 transitions. [2024-11-20 03:36:00,862 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 144 transitions. Word has length 158 [2024-11-20 03:36:00,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:36:00,865 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 144 transitions. [2024-11-20 03:36:00,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2024-11-20 03:36:00,866 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 144 transitions. [2024-11-20 03:36:00,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-20 03:36:00,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:36:00,869 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 03:36:00,886 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-20 03:36:01,070 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-11-20 03:36:01,070 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:36:01,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:36:01,071 INFO L85 PathProgramCache]: Analyzing trace with hash -261892433, now seen corresponding path program 1 times [2024-11-20 03:36:01,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 03:36:01,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1471332364] [2024-11-20 03:36:01,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:36:01,072 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-11-20 03:36:01,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 03:36:01,074 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-11-20 03:36:01,076 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-11-20 03:36:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:36:01,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 03:36:01,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 03:36:01,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-20 03:36:01,806 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 03:36:01,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 03:36:01,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1471332364] [2024-11-20 03:36:01,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1471332364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:36:01,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:36:01,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 03:36:01,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755592686] [2024-11-20 03:36:01,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:36:01,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 03:36:01,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 03:36:01,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 03:36:01,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-20 03:36:01,810 INFO L87 Difference]: Start difference. First operand 101 states and 144 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 03:36:03,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:36:03,558 INFO L93 Difference]: Finished difference Result 344 states and 482 transitions. [2024-11-20 03:36:03,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 03:36:03,571 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 159 [2024-11-20 03:36:03,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:36:03,578 INFO L225 Difference]: With dead ends: 344 [2024-11-20 03:36:03,581 INFO L226 Difference]: Without dead ends: 262 [2024-11-20 03:36:03,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-20 03:36:03,583 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 247 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-20 03:36:03,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 525 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-20 03:36:03,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-20 03:36:03,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 149. [2024-11-20 03:36:03,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 93 states have (on average 1.2258064516129032) internal successors, (114), 93 states have internal predecessors, (114), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 03:36:03,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 210 transitions. [2024-11-20 03:36:03,631 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 210 transitions. Word has length 159 [2024-11-20 03:36:03,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:36:03,634 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 210 transitions. [2024-11-20 03:36:03,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 03:36:03,634 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 210 transitions. [2024-11-20 03:36:03,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-20 03:36:03,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:36:03,637 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 03:36:03,655 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 (4)] Ended with exit code 0 [2024-11-20 03:36:03,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-11-20 03:36:03,840 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:36:03,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:36:03,840 INFO L85 PathProgramCache]: Analyzing trace with hash 439172145, now seen corresponding path program 1 times [2024-11-20 03:36:03,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 03:36:03,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424398828] [2024-11-20 03:36:03,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:36:03,841 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-11-20 03:36:03,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 03:36:03,845 INFO L229 MonitoredProcess]: Starting monitored process 5 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-11-20 03:36:03,845 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 (5)] Waiting until timeout for monitored process [2024-11-20 03:36:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:36:04,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 03:36:04,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 03:36:04,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-20 03:36:04,248 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 03:36:04,248 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 03:36:04,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424398828] [2024-11-20 03:36:04,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424398828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:36:04,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:36:04,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 03:36:04,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301095831] [2024-11-20 03:36:04,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:36:04,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 03:36:04,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 03:36:04,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 03:36:04,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 03:36:04,255 INFO L87 Difference]: Start difference. First operand 149 states and 210 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 03:36:04,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:36:04,549 INFO L93 Difference]: Finished difference Result 231 states and 325 transitions. [2024-11-20 03:36:04,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 03:36:04,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 159 [2024-11-20 03:36:04,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:36:04,563 INFO L225 Difference]: With dead ends: 231 [2024-11-20 03:36:04,563 INFO L226 Difference]: Without dead ends: 149 [2024-11-20 03:36:04,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 156 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-11-20 03:36:04,564 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 103 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 03:36:04,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 195 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 03:36:04,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-20 03:36:04,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-11-20 03:36:04,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 93 states have (on average 1.2150537634408602) internal successors, (113), 93 states have internal predecessors, (113), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 03:36:04,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 209 transitions. [2024-11-20 03:36:04,606 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 209 transitions. Word has length 159 [2024-11-20 03:36:04,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:36:04,606 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 209 transitions. [2024-11-20 03:36:04,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 03:36:04,608 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 209 transitions. [2024-11-20 03:36:04,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-20 03:36:04,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:36:04,610 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 03:36:04,626 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 (5)] Ended with exit code 0 [2024-11-20 03:36:04,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-11-20 03:36:04,811 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:36:04,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:36:04,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1301864194, now seen corresponding path program 1 times [2024-11-20 03:36:04,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 03:36:04,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967844847] [2024-11-20 03:36:04,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:36:04,813 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-11-20 03:36:04,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 03:36:04,815 INFO L229 MonitoredProcess]: Starting monitored process 6 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-11-20 03:36:04,816 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 (6)] Waiting until timeout for monitored process [2024-11-20 03:36:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:36:05,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-20 03:36:05,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 03:36:06,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 417 proven. 114 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2024-11-20 03:36:06,402 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 03:36:07,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 03:36:07,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967844847] [2024-11-20 03:36:07,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967844847] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 03:36:07,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2007966534] [2024-11-20 03:36:07,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:36:07,510 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 03:36:07,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 03:36:07,517 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 03:36:07,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-20 03:36:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:36:08,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-20 03:36:08,587 INFO L278 TraceCheckSpWp]: Computing forward predicates...