./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-69.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-69.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 db91e7c1347e4f784e0317d545c9cd2de6687960c1deff88b6b9b7847a27b87e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:27:51,252 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:27:51,334 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:27:51,340 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:27:51,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:27:51,377 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:27:51,380 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:27:51,381 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:27:51,382 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:27:51,383 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:27:51,383 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:27:51,385 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:27:51,386 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:27:51,386 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:27:51,386 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:27:51,390 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:27:51,391 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:27:51,391 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:27:51,391 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:27:51,391 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:27:51,392 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:27:51,394 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:27:51,395 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:27:51,395 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:27:51,395 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:27:51,396 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:27:51,396 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:27:51,396 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:27:51,396 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:27:51,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:27:51,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:27:51,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:27:51,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:27:51,398 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:27:51,398 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:27:51,398 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:27:51,399 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:27:51,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:27:51,400 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:27:51,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:27:51,400 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:27:51,401 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:27:51,401 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 -> db91e7c1347e4f784e0317d545c9cd2de6687960c1deff88b6b9b7847a27b87e [2024-11-09 00:27:51,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:27:51,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:27:51,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:27:51,755 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:27:51,755 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:27:51,757 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-69.i [2024-11-09 00:27:53,263 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:27:53,559 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:27:53,560 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-69.i [2024-11-09 00:27:53,569 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cda8cfac/718422fb13aa4ebaabb5f771d5642321/FLAGa865f4b66 [2024-11-09 00:27:53,833 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cda8cfac/718422fb13aa4ebaabb5f771d5642321 [2024-11-09 00:27:53,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:27:53,838 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:27:53,839 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:27:53,839 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:27:53,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:27:53,846 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:27:53" (1/1) ... [2024-11-09 00:27:53,847 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b33ed6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:53, skipping insertion in model container [2024-11-09 00:27:53,847 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:27:53" (1/1) ... [2024-11-09 00:27:53,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:27:54,069 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_operatoramount_amount100_file-69.i[916,929] [2024-11-09 00:27:54,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:27:54,164 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:27:54,177 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_operatoramount_amount100_file-69.i[916,929] [2024-11-09 00:27:54,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:27:54,259 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:27:54,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:54 WrapperNode [2024-11-09 00:27:54,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:27:54,262 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:27:54,262 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:27:54,263 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:27:54,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:54" (1/1) ... [2024-11-09 00:27:54,280 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:54" (1/1) ... [2024-11-09 00:27:54,343 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 253 [2024-11-09 00:27:54,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:27:54,344 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:27:54,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:27:54,345 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:27:54,362 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:54" (1/1) ... [2024-11-09 00:27:54,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:54" (1/1) ... [2024-11-09 00:27:54,371 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:54" (1/1) ... [2024-11-09 00:27:54,410 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-09 00:27:54,414 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:54" (1/1) ... [2024-11-09 00:27:54,415 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:54" (1/1) ... [2024-11-09 00:27:54,433 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:54" (1/1) ... [2024-11-09 00:27:54,441 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:54" (1/1) ... [2024-11-09 00:27:54,447 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:54" (1/1) ... [2024-11-09 00:27:54,453 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:54" (1/1) ... [2024-11-09 00:27:54,460 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:27:54,461 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:27:54,461 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:27:54,461 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:27:54,463 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:54" (1/1) ... [2024-11-09 00:27:54,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:27:54,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:27:54,497 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-09 00:27:54,501 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-09 00:27:54,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:27:54,550 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:27:54,551 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:27:54,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:27:54,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:27:54,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:27:54,665 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:27:54,671 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:27:55,214 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-09 00:27:55,215 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:27:55,241 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:27:55,241 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:27:55,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:27:55 BoogieIcfgContainer [2024-11-09 00:27:55,242 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:27:55,245 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:27:55,245 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:27:55,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:27:55,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:27:53" (1/3) ... [2024-11-09 00:27:55,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@555fd99f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:27:55, skipping insertion in model container [2024-11-09 00:27:55,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:27:54" (2/3) ... [2024-11-09 00:27:55,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@555fd99f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:27:55, skipping insertion in model container [2024-11-09 00:27:55,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:27:55" (3/3) ... [2024-11-09 00:27:55,254 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-69.i [2024-11-09 00:27:55,276 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:27:55,277 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:27:55,344 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:27:55,350 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;@53fc175e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:27:55,351 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:27:55,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 78 states have (on average 1.5) internal successors, (117), 79 states have internal predecessors, (117), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 00:27:55,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-09 00:27:55,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:55,373 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:55,374 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:55,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:55,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1982159658, now seen corresponding path program 1 times [2024-11-09 00:27:55,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:55,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500216644] [2024-11-09 00:27:55,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:55,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:55,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:27:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:55,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:27:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:55,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:27:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:55,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:27:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:55,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:27:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:55,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:27:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:55,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:27:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:55,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:27:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:55,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:27:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:55,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:27:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:55,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:27:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:55,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:27:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:55,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:27:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:55,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 00:27:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:55,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 00:27:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:55,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:27:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:55,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:27:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:55,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:27:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:55,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:27:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:55,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:27:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:55,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 00:27:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:55,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-09 00:27:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:55,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 00:27:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:55,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-09 00:27:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:55,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-09 00:27:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:55,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-09 00:27:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:55,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-09 00:27:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:55,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-09 00:27:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:55,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-09 00:27:55,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:27:55,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500216644] [2024-11-09 00:27:55,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500216644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:27:55,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:27:55,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:27:55,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375051435] [2024-11-09 00:27:55,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:27:55,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:27:55,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:27:55,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:27:55,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:27:55,985 INFO L87 Difference]: Start difference. First operand has 109 states, 78 states have (on average 1.5) internal successors, (117), 79 states have internal predecessors, (117), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-09 00:27:56,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:56,020 INFO L93 Difference]: Finished difference Result 211 states and 368 transitions. [2024-11-09 00:27:56,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:27:56,024 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 182 [2024-11-09 00:27:56,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:56,035 INFO L225 Difference]: With dead ends: 211 [2024-11-09 00:27:56,036 INFO L226 Difference]: Without dead ends: 105 [2024-11-09 00:27:56,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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-09 00:27:56,047 INFO L432 NwaCegarLoop]: 164 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, 164 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-09 00:27:56,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:27:56,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-09 00:27:56,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-09 00:27:56,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 75 states have (on average 1.44) internal successors, (108), 75 states have internal predecessors, (108), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 00:27:56,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 164 transitions. [2024-11-09 00:27:56,116 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 164 transitions. Word has length 182 [2024-11-09 00:27:56,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:56,116 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 164 transitions. [2024-11-09 00:27:56,117 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-09 00:27:56,117 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 164 transitions. [2024-11-09 00:27:56,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-09 00:27:56,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:56,124 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:56,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:27:56,125 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:56,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:56,126 INFO L85 PathProgramCache]: Analyzing trace with hash -11676698, now seen corresponding path program 1 times [2024-11-09 00:27:56,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:56,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225264804] [2024-11-09 00:27:56,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:56,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:56,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:27:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:56,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:27:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:56,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:27:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:56,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:27:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:56,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:27:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:56,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:27:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:56,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:27:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:56,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:27:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:56,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:27:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:56,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:27:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:56,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:27:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:56,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:27:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:56,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:27:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:56,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 00:27:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:56,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 00:27:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:56,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:27:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:56,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:27:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:56,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:27:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:56,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:27:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:56,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:27:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:56,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 00:27:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:56,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-09 00:27:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:57,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 00:27:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:57,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-09 00:27:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:57,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-09 00:27:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:57,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-09 00:27:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:57,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-09 00:27:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:57,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-09 00:27:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:57,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-09 00:27:57,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:27:57,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225264804] [2024-11-09 00:27:57,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225264804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:27:57,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:27:57,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 00:27:57,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615424100] [2024-11-09 00:27:57,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:27:57,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 00:27:57,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:27:57,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 00:27:57,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:27:57,056 INFO L87 Difference]: Start difference. First operand 105 states and 164 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-09 00:27:57,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:57,420 INFO L93 Difference]: Finished difference Result 311 states and 489 transitions. [2024-11-09 00:27:57,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 00:27:57,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 182 [2024-11-09 00:27:57,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:57,425 INFO L225 Difference]: With dead ends: 311 [2024-11-09 00:27:57,426 INFO L226 Difference]: Without dead ends: 209 [2024-11-09 00:27:57,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:27:57,428 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 130 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 00:27:57,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 561 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 00:27:57,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-09 00:27:57,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 163. [2024-11-09 00:27:57,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-09 00:27:57,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 256 transitions. [2024-11-09 00:27:57,472 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 256 transitions. Word has length 182 [2024-11-09 00:27:57,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:57,474 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 256 transitions. [2024-11-09 00:27:57,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-09 00:27:57,474 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 256 transitions. [2024-11-09 00:27:57,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-09 00:27:57,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:57,478 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:57,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:27:57,478 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:57,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:57,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1829882246, now seen corresponding path program 1 times [2024-11-09 00:27:57,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:57,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489686944] [2024-11-09 00:27:57,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:57,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:58,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:27:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:58,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:27:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:58,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:27:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:58,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:27:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:58,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:27:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:58,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:27:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:58,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:27:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:58,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:27:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:58,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:27:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:58,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:27:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:58,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:27:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:58,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:27:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:58,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:27:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:58,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 00:27:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:58,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 00:27:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:58,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:27:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:58,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:27:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:58,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:27:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:58,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:27:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:58,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:27:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:58,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 00:27:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:58,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-09 00:27:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:58,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 00:27:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:58,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-09 00:27:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:58,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-09 00:27:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:58,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-09 00:27:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:58,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-09 00:27:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:58,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-09 00:27:58,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:58,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-09 00:27:58,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:27:58,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489686944] [2024-11-09 00:27:58,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489686944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:27:58,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:27:58,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 00:27:58,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021083376] [2024-11-09 00:27:58,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:27:58,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 00:27:58,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:27:58,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 00:27:58,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:27:58,677 INFO L87 Difference]: Start difference. First operand 163 states and 256 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-09 00:27:58,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:58,924 INFO L93 Difference]: Finished difference Result 375 states and 587 transitions. [2024-11-09 00:27:58,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 00:27:58,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 183 [2024-11-09 00:27:58,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:58,930 INFO L225 Difference]: With dead ends: 375 [2024-11-09 00:27:58,930 INFO L226 Difference]: Without dead ends: 273 [2024-11-09 00:27:58,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 00:27:58,934 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 159 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:27:58,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 650 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:27:58,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-09 00:27:59,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 270. [2024-11-09 00:27:59,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 181 states have (on average 1.3867403314917126) internal successors, (251), 181 states have internal predecessors, (251), 84 states have call successors, (84), 4 states have call predecessors, (84), 4 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-09 00:27:59,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 419 transitions. [2024-11-09 00:27:59,009 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 419 transitions. Word has length 183 [2024-11-09 00:27:59,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:59,011 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 419 transitions. [2024-11-09 00:27:59,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-09 00:27:59,012 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 419 transitions. [2024-11-09 00:27:59,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-09 00:27:59,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:59,017 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:59,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 00:27:59,018 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:59,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:59,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1249579404, now seen corresponding path program 1 times [2024-11-09 00:27:59,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:27:59,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802597954] [2024-11-09 00:27:59,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:59,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:27:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:59,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:27:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:59,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:27:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:59,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:27:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:59,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:27:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:59,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:27:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:59,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:27:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:59,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:27:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:59,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:27:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:59,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:27:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:59,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:27:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:59,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:27:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:59,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:27:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:59,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:27:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:59,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 00:27:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:59,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 00:27:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:59,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:27:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:59,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:27:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:59,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:27:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:59,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:27:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:59,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:27:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:59,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 00:27:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:59,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-09 00:27:59,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:59,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 00:27:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:59,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-09 00:27:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:59,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-09 00:27:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:59,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-09 00:27:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:59,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-09 00:27:59,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:59,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-09 00:27:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:59,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-09 00:27:59,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:27:59,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802597954] [2024-11-09 00:27:59,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802597954] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:27:59,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042914098] [2024-11-09 00:27:59,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:59,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:27:59,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:27:59,589 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-09 00:27:59,592 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-09 00:27:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:59,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 00:27:59,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:27:59,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 573 proven. 18 refuted. 0 times theorem prover too weak. 921 trivial. 0 not checked. [2024-11-09 00:27:59,920 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:28:00,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 63 proven. 18 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-09 00:28:00,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042914098] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:28:00,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 00:28:00,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-11-09 00:28:00,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861513724] [2024-11-09 00:28:00,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 00:28:00,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 00:28:00,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:28:00,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 00:28:00,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 00:28:00,152 INFO L87 Difference]: Start difference. First operand 270 states and 419 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 3 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (57), 3 states have call predecessors, (57), 3 states have call successors, (57) [2024-11-09 00:28:00,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:28:00,592 INFO L93 Difference]: Finished difference Result 516 states and 774 transitions. [2024-11-09 00:28:00,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 00:28:00,593 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 3 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (57), 3 states have call predecessors, (57), 3 states have call successors, (57) Word has length 184 [2024-11-09 00:28:00,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:28:00,600 INFO L225 Difference]: With dead ends: 516 [2024-11-09 00:28:00,600 INFO L226 Difference]: Without dead ends: 306 [2024-11-09 00:28:00,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 420 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2024-11-09 00:28:00,604 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 288 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 00:28:00,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 367 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 00:28:00,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-09 00:28:00,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 279. [2024-11-09 00:28:00,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 184 states have (on average 1.2826086956521738) internal successors, (236), 185 states have internal predecessors, (236), 84 states have call successors, (84), 10 states have call predecessors, (84), 10 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-09 00:28:00,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 404 transitions. [2024-11-09 00:28:00,683 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 404 transitions. Word has length 184 [2024-11-09 00:28:00,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:28:00,684 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 404 transitions. [2024-11-09 00:28:00,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 3 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (57), 3 states have call predecessors, (57), 3 states have call successors, (57) [2024-11-09 00:28:00,684 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 404 transitions. [2024-11-09 00:28:00,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-09 00:28:00,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:28:00,687 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:28:00,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 00:28:00,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:28:00,889 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:28:00,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:28:00,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1927952465, now seen corresponding path program 1 times [2024-11-09 00:28:00,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:28:00,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774100906] [2024-11-09 00:28:00,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:28:00,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:28:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:01,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:28:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:01,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:28:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:01,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:28:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:01,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:28:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:01,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:28:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:01,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:28:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:01,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:28:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:01,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:28:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:01,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:28:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:01,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:28:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:01,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:28:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:01,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:28:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:01,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:28:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:01,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 00:28:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:01,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 00:28:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:01,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:28:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:01,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:28:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:01,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:28:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:01,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:28:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:01,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:28:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:01,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 00:28:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:01,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-09 00:28:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:01,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 00:28:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:01,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-09 00:28:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:01,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-09 00:28:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:01,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-09 00:28:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:01,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-09 00:28:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:01,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-09 00:28:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:01,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 63 proven. 18 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-09 00:28:01,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:28:01,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774100906] [2024-11-09 00:28:01,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774100906] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:28:01,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169108841] [2024-11-09 00:28:01,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:28:01,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:28:01,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:28:01,438 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-09 00:28:01,440 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-09 00:28:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:01,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 00:28:01,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:28:01,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 573 proven. 18 refuted. 0 times theorem prover too weak. 921 trivial. 0 not checked. [2024-11-09 00:28:01,696 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:28:01,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 63 proven. 18 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-09 00:28:01,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169108841] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:28:01,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 00:28:01,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-11-09 00:28:01,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340067232] [2024-11-09 00:28:01,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 00:28:01,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 00:28:01,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:28:01,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 00:28:01,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 00:28:01,907 INFO L87 Difference]: Start difference. First operand 279 states and 404 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-09 00:28:02,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:28:02,405 INFO L93 Difference]: Finished difference Result 525 states and 754 transitions. [2024-11-09 00:28:02,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 00:28:02,406 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 185 [2024-11-09 00:28:02,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:28:02,410 INFO L225 Difference]: With dead ends: 525 [2024-11-09 00:28:02,411 INFO L226 Difference]: Without dead ends: 305 [2024-11-09 00:28:02,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 422 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-09 00:28:02,413 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 439 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 00:28:02,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 477 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 00:28:02,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-09 00:28:02,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 279. [2024-11-09 00:28:02,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 184 states have (on average 1.2826086956521738) internal successors, (236), 185 states have internal predecessors, (236), 84 states have call successors, (84), 10 states have call predecessors, (84), 10 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-09 00:28:02,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 404 transitions. [2024-11-09 00:28:02,453 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 404 transitions. Word has length 185 [2024-11-09 00:28:02,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:28:02,454 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 404 transitions. [2024-11-09 00:28:02,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-09 00:28:02,455 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 404 transitions. [2024-11-09 00:28:02,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-09 00:28:02,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:28:02,466 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:28:02,486 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-09 00:28:02,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:28:02,668 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:28:02,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:28:02,669 INFO L85 PathProgramCache]: Analyzing trace with hash -2061965971, now seen corresponding path program 1 times [2024-11-09 00:28:02,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:28:02,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170119852] [2024-11-09 00:28:02,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:28:02,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:28:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:28:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:28:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:28:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:28:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:28:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:28:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:28:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:28:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:28:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:28:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:28:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:28:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:28:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 00:28:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 00:28:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:28:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:28:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:28:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:28:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:28:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 00:28:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-09 00:28:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 00:28:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-09 00:28:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-09 00:28:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-09 00:28:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-09 00:28:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-09 00:28:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 129 proven. 27 refuted. 0 times theorem prover too weak. 1356 trivial. 0 not checked. [2024-11-09 00:28:03,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:28:03,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170119852] [2024-11-09 00:28:03,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170119852] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:28:03,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506427026] [2024-11-09 00:28:03,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:28:03,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:28:03,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:28:03,552 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:28:03,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 00:28:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:03,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 00:28:03,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:28:03,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 599 proven. 27 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2024-11-09 00:28:03,945 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:28:04,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 129 proven. 30 refuted. 0 times theorem prover too weak. 1353 trivial. 0 not checked. [2024-11-09 00:28:04,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506427026] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:28:04,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 00:28:04,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2024-11-09 00:28:04,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977059474] [2024-11-09 00:28:04,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 00:28:04,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 00:28:04,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:28:04,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 00:28:04,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-09 00:28:04,339 INFO L87 Difference]: Start difference. First operand 279 states and 404 transitions. Second operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 3 states have call successors, (34), 3 states have call predecessors, (34), 7 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2024-11-09 00:28:05,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:28:05,575 INFO L93 Difference]: Finished difference Result 668 states and 940 transitions. [2024-11-09 00:28:05,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-09 00:28:05,576 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 3 states have call successors, (34), 3 states have call predecessors, (34), 7 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) Word has length 185 [2024-11-09 00:28:05,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:28:05,581 INFO L225 Difference]: With dead ends: 668 [2024-11-09 00:28:05,581 INFO L226 Difference]: Without dead ends: 448 [2024-11-09 00:28:05,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 420 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=578, Invalid=1584, Unknown=0, NotChecked=0, Total=2162 [2024-11-09 00:28:05,584 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 869 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 487 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 00:28:05,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 913 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [487 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 00:28:05,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-11-09 00:28:05,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 291. [2024-11-09 00:28:05,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 193 states have (on average 1.2694300518134716) internal successors, (245), 194 states have internal predecessors, (245), 84 states have call successors, (84), 13 states have call predecessors, (84), 13 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-09 00:28:05,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 413 transitions. [2024-11-09 00:28:05,646 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 413 transitions. Word has length 185 [2024-11-09 00:28:05,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:28:05,647 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 413 transitions. [2024-11-09 00:28:05,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 3 states have call successors, (34), 3 states have call predecessors, (34), 7 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2024-11-09 00:28:05,648 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 413 transitions. [2024-11-09 00:28:05,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-09 00:28:05,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:28:05,650 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:28:05,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 00:28:05,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:28:05,852 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:28:05,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:28:05,853 INFO L85 PathProgramCache]: Analyzing trace with hash -758589155, now seen corresponding path program 1 times [2024-11-09 00:28:05,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:28:05,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065746585] [2024-11-09 00:28:05,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:28:05,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:28:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:06,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:28:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:06,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:28:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:06,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:28:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:06,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:28:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:06,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:28:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:06,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:28:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:06,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:28:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:06,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:28:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:06,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:28:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:06,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:28:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:06,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:28:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:06,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:28:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:06,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:28:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:06,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 00:28:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:06,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 00:28:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:06,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 00:28:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:06,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:28:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:06,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:28:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:06,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:28:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:06,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 00:28:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:06,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 00:28:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:06,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-09 00:28:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:06,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 00:28:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:06,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-09 00:28:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:06,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-09 00:28:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:06,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-09 00:28:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:06,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-09 00:28:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:06,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-09 00:28:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:06,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-09 00:28:06,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:28:06,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065746585] [2024-11-09 00:28:06,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065746585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:28:06,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:28:06,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 00:28:06,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168325317] [2024-11-09 00:28:06,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:28:06,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:28:06,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:28:06,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:28:06,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:28:06,513 INFO L87 Difference]: Start difference. First operand 291 states and 413 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-09 00:28:06,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:28:06,783 INFO L93 Difference]: Finished difference Result 573 states and 816 transitions. [2024-11-09 00:28:06,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:28:06,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 186 [2024-11-09 00:28:06,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:28:06,787 INFO L225 Difference]: With dead ends: 573 [2024-11-09 00:28:06,787 INFO L226 Difference]: Without dead ends: 345 [2024-11-09 00:28:06,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 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-09 00:28:06,789 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 105 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:28:06,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 429 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:28:06,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-09 00:28:06,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 295. [2024-11-09 00:28:06,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 197 states have (on average 1.2690355329949239) internal successors, (250), 197 states have internal predecessors, (250), 84 states have call successors, (84), 13 states have call predecessors, (84), 13 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-09 00:28:06,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 418 transitions. [2024-11-09 00:28:06,853 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 418 transitions. Word has length 186 [2024-11-09 00:28:06,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:28:06,854 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 418 transitions. [2024-11-09 00:28:06,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-09 00:28:06,854 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 418 transitions. [2024-11-09 00:28:06,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-09 00:28:06,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:28:06,856 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:28:06,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 00:28:06,857 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:28:06,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:28:06,857 INFO L85 PathProgramCache]: Analyzing trace with hash -514022341, now seen corresponding path program 1 times [2024-11-09 00:28:06,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:28:06,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924145087] [2024-11-09 00:28:06,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:28:06,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:28:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:28:07,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1860979249] [2024-11-09 00:28:07,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:28:07,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:28:07,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:28:07,033 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:28:07,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 00:28:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:28:07,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:28:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:28:07,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:28:07,347 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:28:07,349 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:28:07,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 00:28:07,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:28:07,555 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:28:07,702 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:28:07,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:28:07 BoogieIcfgContainer [2024-11-09 00:28:07,706 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:28:07,707 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:28:07,707 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:28:07,707 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:28:07,708 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:27:55" (3/4) ... [2024-11-09 00:28:07,710 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:28:07,711 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:28:07,712 INFO L158 Benchmark]: Toolchain (without parser) took 13874.27ms. Allocated memory was 155.2MB in the beginning and 287.3MB in the end (delta: 132.1MB). Free memory was 124.6MB in the beginning and 147.6MB in the end (delta: -22.9MB). Peak memory consumption was 112.2MB. Max. memory is 16.1GB. [2024-11-09 00:28:07,712 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 91.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:28:07,712 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.83ms. Allocated memory is still 155.2MB. Free memory was 124.5MB in the beginning and 106.2MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 00:28:07,713 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.18ms. Allocated memory is still 155.2MB. Free memory was 106.2MB in the beginning and 102.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:28:07,713 INFO L158 Benchmark]: Boogie Preprocessor took 115.71ms. Allocated memory is still 155.2MB. Free memory was 102.0MB in the beginning and 97.2MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:28:07,713 INFO L158 Benchmark]: RCFGBuilder took 781.36ms. Allocated memory is still 155.2MB. Free memory was 97.2MB in the beginning and 66.4MB in the end (delta: 30.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-09 00:28:07,713 INFO L158 Benchmark]: TraceAbstraction took 12461.39ms. Allocated memory was 155.2MB in the beginning and 287.3MB in the end (delta: 132.1MB). Free memory was 65.8MB in the beginning and 147.6MB in the end (delta: -81.8MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. [2024-11-09 00:28:07,714 INFO L158 Benchmark]: Witness Printer took 4.53ms. Allocated memory is still 287.3MB. Free memory is still 147.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:28:07,715 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.17ms. Allocated memory is still 117.4MB. Free memory is still 91.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 421.83ms. Allocated memory is still 155.2MB. Free memory was 124.5MB in the beginning and 106.2MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.18ms. Allocated memory is still 155.2MB. Free memory was 106.2MB in the beginning and 102.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 115.71ms. Allocated memory is still 155.2MB. Free memory was 102.0MB in the beginning and 97.2MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 781.36ms. Allocated memory is still 155.2MB. Free memory was 97.2MB in the beginning and 66.4MB in the end (delta: 30.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12461.39ms. Allocated memory was 155.2MB in the beginning and 287.3MB in the end (delta: 132.1MB). Free memory was 65.8MB in the beginning and 147.6MB in the end (delta: -81.8MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. * Witness Printer took 4.53ms. Allocated memory is still 287.3MB. Free memory is still 147.6MB. 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 someBinaryFLOATComparisonOperation at line 201, overapproximation of someBinaryDOUBLEComparisonOperation at line 201, overapproximation of bitwiseOr at line 201. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] unsigned char var_1_2 = 1; [L24] unsigned short int var_1_3 = 47136; [L25] unsigned short int var_1_4 = 10; [L26] unsigned long int var_1_6 = 1660677957; [L27] unsigned long int var_1_7 = 128; [L28] float var_1_9 = 9.4; [L29] float var_1_12 = 16.2; [L30] float var_1_13 = 127.9; [L31] float var_1_14 = 15.5; [L32] unsigned long int var_1_15 = 100; [L33] signed char var_1_16 = 64; [L34] float var_1_17 = 9.7; [L35] signed char var_1_18 = -64; [L36] signed char var_1_19 = -4; [L37] unsigned short int var_1_20 = 64; [L38] unsigned short int var_1_21 = 1; [L39] signed char var_1_22 = 2; [L40] unsigned long int var_1_23 = 8; [L41] unsigned char var_1_24 = 0; [L42] unsigned char var_1_25 = 0; [L43] unsigned char var_1_26 = 0; [L44] unsigned char var_1_27 = 0; [L45] unsigned char var_1_28 = 0; [L46] float last_1_var_1_9 = 9.4; [L47] float last_1_var_1_14 = 15.5; [L48] unsigned long int last_1_var_1_15 = 100; [L49] unsigned short int last_1_var_1_20 = 64; [L50] unsigned long int last_1_var_1_23 = 8; [L51] unsigned char last_1_var_1_24 = 0; VAL [isInitial=0, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L205] isInitial = 1 [L206] FCALL initially() [L207] COND TRUE 1 [L208] CALL updateLastVariables() [L193] last_1_var_1_9 = var_1_9 [L194] last_1_var_1_14 = var_1_14 [L195] last_1_var_1_15 = var_1_15 [L196] last_1_var_1_20 = var_1_20 [L197] last_1_var_1_23 = var_1_23 [L198] last_1_var_1_24 = var_1_24 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L208] RET updateLastVariables() [L209] CALL updateVariables() [L148] var_1_2 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L149] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L150] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L150] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L151] var_1_3 = __VERIFIER_nondet_ushort() [L152] CALL assume_abort_if_not(var_1_3 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L152] RET assume_abort_if_not(var_1_3 >= 32767) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L153] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L153] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L154] var_1_4 = __VERIFIER_nondet_ushort() [L155] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L155] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L156] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L156] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L157] var_1_6 = __VERIFIER_nondet_ulong() [L158] CALL assume_abort_if_not(var_1_6 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=128, var_1_9=47/5] [L158] RET assume_abort_if_not(var_1_6 >= 1073741823) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=128, var_1_9=47/5] [L159] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=128, var_1_9=47/5] [L159] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=128, var_1_9=47/5] [L160] var_1_7 = __VERIFIER_nondet_ulong() [L161] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_9=47/5] [L161] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_9=47/5] [L162] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L162] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L163] var_1_12 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L164] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L165] var_1_13 = __VERIFIER_nondet_float() [L166] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L166] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L167] var_1_17 = __VERIFIER_nondet_float() [L168] CALL assume_abort_if_not((var_1_17 >= -922337.2036854776000e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L168] RET assume_abort_if_not((var_1_17 >= -922337.2036854776000e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L169] CALL assume_abort_if_not(var_1_17 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L169] RET assume_abort_if_not(var_1_17 != 0.0F) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L170] var_1_18 = __VERIFIER_nondet_char() [L171] CALL assume_abort_if_not(var_1_18 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L171] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L172] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L172] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L173] var_1_19 = __VERIFIER_nondet_char() [L174] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L174] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L175] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L175] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L176] var_1_21 = __VERIFIER_nondet_ushort() [L177] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L177] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L178] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L178] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L179] var_1_25 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L180] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L181] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L181] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L182] var_1_26 = __VERIFIER_nondet_uchar() [L183] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L183] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L184] CALL assume_abort_if_not(var_1_26 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L184] RET assume_abort_if_not(var_1_26 <= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L185] var_1_27 = __VERIFIER_nondet_uchar() [L186] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L186] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L187] CALL assume_abort_if_not(var_1_27 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L187] RET assume_abort_if_not(var_1_27 <= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L188] var_1_28 = __VERIFIER_nondet_uchar() [L189] CALL assume_abort_if_not(var_1_28 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L189] RET assume_abort_if_not(var_1_28 >= 1) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L190] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L190] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L209] RET updateVariables() [L210] CALL step() [L55] COND TRUE last_1_var_1_14 >= (var_1_13 * last_1_var_1_9) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L56] COND TRUE \read(var_1_2) [L57] var_1_24 = var_1_25 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L70] unsigned long int stepLocal_0 = var_1_6 * last_1_var_1_23; VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L71] COND FALSE !(\read(last_1_var_1_24)) [L78] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L80] EXPR var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L80] COND FALSE !(last_1_var_1_15 >= (var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))))) [L87] var_1_14 = var_1_12 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, var_1_12=2, var_1_14=2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L89] COND FALSE !(var_1_24 && (var_1_20 < (3349670375u - var_1_4))) [L96] var_1_15 = var_1_20 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L98] COND FALSE !((256.2 * var_1_14) < var_1_14) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L103] unsigned short int stepLocal_3 = var_1_21; VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, stepLocal_3=0, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L104] COND TRUE var_1_14 < (9999.6f + var_1_12) [L105] var_1_23 = var_1_20 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, stepLocal_3=0, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L117] COND FALSE !(var_1_24 && ((var_1_3 - var_1_4) <= var_1_23)) [L120] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, stepLocal_3=0, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L122] COND FALSE !(var_1_13 >= var_1_14) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, stepLocal_3=0, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L131] signed char stepLocal_2 = var_1_19; [L132] unsigned long int stepLocal_1 = var_1_6; VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, stepLocal_1=1073741823, stepLocal_2=0, stepLocal_3=0, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L133] COND TRUE var_1_12 <= var_1_14 [L134] var_1_22 = var_1_19 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=8589934584, stepLocal_1=1073741823, stepLocal_2=0, stepLocal_3=0, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L210] RET step() [L211] CALL, EXPR property() [L201] EXPR (((var_1_24 && ((var_1_3 - var_1_4) <= var_1_23)) ? (var_1_1 == ((unsigned long int) ((((((var_1_3 + var_1_4)) > ((var_1_6 - var_1_20))) ? ((var_1_3 + var_1_4)) : ((var_1_6 - var_1_20)))) + var_1_20))) : (var_1_1 == ((unsigned long int) var_1_4))) && (((256.2 * var_1_14) < var_1_14) ? (var_1_24 ? (var_1_9 == ((float) (var_1_12 + var_1_13))) : 1) : 1)) && ((last_1_var_1_15 >= (var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))))) ? (((8 + 5) < var_1_6) ? (var_1_14 == ((float) var_1_13)) : (var_1_14 == ((float) var_1_13))) : (var_1_14 == ((float) var_1_12))) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L201] EXPR var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L201] EXPR (((var_1_24 && ((var_1_3 - var_1_4) <= var_1_23)) ? (var_1_1 == ((unsigned long int) ((((((var_1_3 + var_1_4)) > ((var_1_6 - var_1_20))) ? ((var_1_3 + var_1_4)) : ((var_1_6 - var_1_20)))) + var_1_20))) : (var_1_1 == ((unsigned long int) var_1_4))) && (((256.2 * var_1_14) < var_1_14) ? (var_1_24 ? (var_1_9 == ((float) (var_1_12 + var_1_13))) : 1) : 1)) && ((last_1_var_1_15 >= (var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))))) ? (((8 + 5) < var_1_6) ? (var_1_14 == ((float) var_1_13)) : (var_1_14 == ((float) var_1_13))) : (var_1_14 == ((float) var_1_12))) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L201] EXPR ((((((((var_1_24 && ((var_1_3 - var_1_4) <= var_1_23)) ? (var_1_1 == ((unsigned long int) ((((((var_1_3 + var_1_4)) > ((var_1_6 - var_1_20))) ? ((var_1_3 + var_1_4)) : ((var_1_6 - var_1_20)))) + var_1_20))) : (var_1_1 == ((unsigned long int) var_1_4))) && (((256.2 * var_1_14) < var_1_14) ? (var_1_24 ? (var_1_9 == ((float) (var_1_12 + var_1_13))) : 1) : 1)) && ((last_1_var_1_15 >= (var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))))) ? (((8 + 5) < var_1_6) ? (var_1_14 == ((float) var_1_13)) : (var_1_14 == ((float) var_1_13))) : (var_1_14 == ((float) var_1_12)))) && ((var_1_24 && (var_1_20 < (3349670375u - var_1_4))) ? ((var_1_3 > var_1_4) ? (var_1_15 == ((unsigned long int) (4063422496u - 64u))) : (var_1_15 == ((unsigned long int) var_1_20))) : (var_1_15 == ((unsigned long int) var_1_20)))) && ((var_1_13 >= var_1_14) ? ((((- var_1_9) * (var_1_14 * var_1_13)) < var_1_12) ? (((- var_1_14) <= (((((var_1_9) > (4.375f)) ? (var_1_9) : (4.375f))) * (var_1_9 / var_1_17))) ? (var_1_16 == ((signed char) ((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))))) : (var_1_16 == ((signed char) 1))) : 1) : 1)) && (last_1_var_1_24 ? (((var_1_6 * last_1_var_1_23) < var_1_7) ? (var_1_20 == ((unsigned short int) (var_1_4 + var_1_21))) : (var_1_20 == ((unsigned short int) var_1_4))) : (var_1_20 == ((unsigned short int) var_1_21)))) && ((var_1_12 <= var_1_14) ? (var_1_22 == ((signed char) var_1_19)) : (((((((var_1_3 * var_1_16)) < (var_1_20)) ? ((var_1_3 * var_1_16)) : (var_1_20))) > var_1_6) ? ((var_1_19 <= var_1_6) ? (var_1_22 == ((signed char) var_1_18)) : (var_1_22 == ((signed char) var_1_19))) : (var_1_22 == ((signed char) var_1_18))))) && ((var_1_14 < (9999.6f + var_1_12)) ? (var_1_23 == ((unsigned long int) var_1_20)) : ((var_1_14 <= (- (- var_1_14))) ? ((var_1_21 != (- (last_1_var_1_23 & var_1_20))) ? (var_1_23 == ((unsigned long int) var_1_20)) : (var_1_23 == ((unsigned long int) var_1_20))) : (var_1_23 == ((unsigned long int) var_1_3)))) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L201-L202] return (((((((((var_1_24 && ((var_1_3 - var_1_4) <= var_1_23)) ? (var_1_1 == ((unsigned long int) ((((((var_1_3 + var_1_4)) > ((var_1_6 - var_1_20))) ? ((var_1_3 + var_1_4)) : ((var_1_6 - var_1_20)))) + var_1_20))) : (var_1_1 == ((unsigned long int) var_1_4))) && (((256.2 * var_1_14) < var_1_14) ? (var_1_24 ? (var_1_9 == ((float) (var_1_12 + var_1_13))) : 1) : 1)) && ((last_1_var_1_15 >= (var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))))) ? (((8 + 5) < var_1_6) ? (var_1_14 == ((float) var_1_13)) : (var_1_14 == ((float) var_1_13))) : (var_1_14 == ((float) var_1_12)))) && ((var_1_24 && (var_1_20 < (3349670375u - var_1_4))) ? ((var_1_3 > var_1_4) ? (var_1_15 == ((unsigned long int) (4063422496u - 64u))) : (var_1_15 == ((unsigned long int) var_1_20))) : (var_1_15 == ((unsigned long int) var_1_20)))) && ((var_1_13 >= var_1_14) ? ((((- var_1_9) * (var_1_14 * var_1_13)) < var_1_12) ? (((- var_1_14) <= (((((var_1_9) > (4.375f)) ? (var_1_9) : (4.375f))) * (var_1_9 / var_1_17))) ? (var_1_16 == ((signed char) ((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))))) : (var_1_16 == ((signed char) 1))) : 1) : 1)) && (last_1_var_1_24 ? (((var_1_6 * last_1_var_1_23) < var_1_7) ? (var_1_20 == ((unsigned short int) (var_1_4 + var_1_21))) : (var_1_20 == ((unsigned short int) var_1_4))) : (var_1_20 == ((unsigned short int) var_1_21)))) && ((var_1_12 <= var_1_14) ? (var_1_22 == ((signed char) var_1_19)) : (((((((var_1_3 * var_1_16)) < (var_1_20)) ? ((var_1_3 * var_1_16)) : (var_1_20))) > var_1_6) ? ((var_1_19 <= var_1_6) ? (var_1_22 == ((signed char) var_1_18)) : (var_1_22 == ((signed char) var_1_19))) : (var_1_22 == ((signed char) var_1_18))))) && ((var_1_14 < (9999.6f + var_1_12)) ? (var_1_23 == ((unsigned long int) var_1_20)) : ((var_1_14 <= (- (- var_1_14))) ? ((var_1_21 != (- (last_1_var_1_23 & var_1_20))) ? (var_1_23 == ((unsigned long int) var_1_20)) : (var_1_23 == ((unsigned long int) var_1_20))) : (var_1_23 == ((unsigned long int) var_1_3))))) && ((last_1_var_1_14 >= (var_1_13 * last_1_var_1_9)) ? (var_1_2 ? (var_1_24 == ((unsigned char) var_1_25)) : (var_1_24 == ((unsigned char) (var_1_25 || var_1_26)))) : (var_1_25 ? (var_1_24 == ((unsigned char) (var_1_26 && var_1_27))) : ((last_1_var_1_15 == last_1_var_1_20) ? (var_1_24 == ((unsigned char) var_1_28)) : 1))) ; [L211] RET, EXPR property() [L211] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=2, var_1_14=2, var_1_15=0, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1073741823, var_1_7=0, var_1_9=47/5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.2s, OverallIterations: 8, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2059 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1990 mSDsluCounter, 3561 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2426 mSDsCounter, 969 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1123 IncrementalHoareTripleChecker+Invalid, 2092 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 969 mSolverCounterUnsat, 1135 mSDtfsCounter, 1123 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1621 GetRequests, 1525 SyntacticMatches, 6 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=295occurred in iteration=7, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 309 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 2217 NumberOfCodeBlocks, 2217 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2382 ConstructedInterpolants, 0 QuantifiedInterpolants, 5585 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1277 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 19419/19656 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-09 00:28:07,767 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/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-69.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 db91e7c1347e4f784e0317d545c9cd2de6687960c1deff88b6b9b7847a27b87e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:28:10,072 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:28:10,161 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:28:10,168 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:28:10,168 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:28:10,205 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:28:10,206 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:28:10,206 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:28:10,207 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:28:10,207 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:28:10,208 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:28:10,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:28:10,211 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:28:10,212 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:28:10,212 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:28:10,212 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:28:10,213 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:28:10,213 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:28:10,213 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:28:10,214 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:28:10,214 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:28:10,218 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:28:10,218 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:28:10,219 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:28:10,219 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:28:10,219 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:28:10,219 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:28:10,220 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:28:10,220 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:28:10,220 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:28:10,220 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:28:10,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:28:10,221 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:28:10,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:28:10,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:28:10,226 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:28:10,226 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:28:10,226 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:28:10,227 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:28:10,227 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:28:10,227 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:28:10,230 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:28:10,230 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:28:10,230 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:28:10,230 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 -> db91e7c1347e4f784e0317d545c9cd2de6687960c1deff88b6b9b7847a27b87e [2024-11-09 00:28:10,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:28:10,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:28:10,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:28:10,610 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:28:10,611 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:28:10,613 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-69.i [2024-11-09 00:28:12,432 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:28:12,692 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:28:12,693 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-69.i [2024-11-09 00:28:12,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6afaad18/c9f05533559142668c1faa5f012a6000/FLAGd96c70fc5 [2024-11-09 00:28:12,736 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6afaad18/c9f05533559142668c1faa5f012a6000 [2024-11-09 00:28:12,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:28:12,741 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:28:12,742 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:28:12,743 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:28:12,749 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:28:12,749 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:28:12" (1/1) ... [2024-11-09 00:28:12,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f7d6406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:28:12, skipping insertion in model container [2024-11-09 00:28:12,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:28:12" (1/1) ... [2024-11-09 00:28:12,794 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:28:13,024 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_operatoramount_amount100_file-69.i[916,929] [2024-11-09 00:28:13,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:28:13,147 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:28:13,160 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_operatoramount_amount100_file-69.i[916,929] [2024-11-09 00:28:13,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:28:13,226 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:28:13,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:28:13 WrapperNode [2024-11-09 00:28:13,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:28:13,228 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:28:13,228 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:28:13,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:28:13,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:28:13" (1/1) ... [2024-11-09 00:28:13,255 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:28:13" (1/1) ... [2024-11-09 00:28:13,293 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 195 [2024-11-09 00:28:13,297 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:28:13,298 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:28:13,298 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:28:13,298 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:28:13,314 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:28:13" (1/1) ... [2024-11-09 00:28:13,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:28:13" (1/1) ... [2024-11-09 00:28:13,320 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:28:13" (1/1) ... [2024-11-09 00:28:13,341 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-09 00:28:13,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:28:13" (1/1) ... [2024-11-09 00:28:13,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:28:13" (1/1) ... [2024-11-09 00:28:13,357 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:28:13" (1/1) ... [2024-11-09 00:28:13,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:28:13" (1/1) ... [2024-11-09 00:28:13,368 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:28:13" (1/1) ... [2024-11-09 00:28:13,372 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:28:13" (1/1) ... [2024-11-09 00:28:13,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:28:13,378 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:28:13,378 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:28:13,378 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:28:13,383 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:28:13" (1/1) ... [2024-11-09 00:28:13,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:28:13,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:28:13,424 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-09 00:28:13,427 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-09 00:28:13,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:28:13,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:28:13,475 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:28:13,475 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:28:13,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:28:13,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:28:13,576 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:28:13,578 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:28:30,159 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-09 00:28:30,159 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:28:30,174 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:28:30,174 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:28:30,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:28:30 BoogieIcfgContainer [2024-11-09 00:28:30,175 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:28:30,177 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:28:30,177 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:28:30,181 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:28:30,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:28:12" (1/3) ... [2024-11-09 00:28:30,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f02639c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:28:30, skipping insertion in model container [2024-11-09 00:28:30,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:28:13" (2/3) ... [2024-11-09 00:28:30,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f02639c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:28:30, skipping insertion in model container [2024-11-09 00:28:30,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:28:30" (3/3) ... [2024-11-09 00:28:30,187 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-69.i [2024-11-09 00:28:30,204 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:28:30,205 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:28:30,280 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:28:30,289 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;@2d861f5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:28:30,290 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:28:30,294 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 00:28:30,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-09 00:28:30,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:28:30,311 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:28:30,312 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:28:30,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:28:30,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1063871195, now seen corresponding path program 1 times [2024-11-09 00:28:30,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:28:30,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [804638891] [2024-11-09 00:28:30,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:28:30,338 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-09 00:28:30,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:28:30,342 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-09 00:28:30,359 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-09 00:28:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:31,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:28:31,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:28:31,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2024-11-09 00:28:31,390 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:28:31,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:28:31,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [804638891] [2024-11-09 00:28:31,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [804638891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:28:31,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:28:31,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:28:31,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819245655] [2024-11-09 00:28:31,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:28:31,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:28:31,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:28:31,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:28:31,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:28:31,433 INFO L87 Difference]: Start difference. First operand has 87 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) 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, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-09 00:28:31,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:28:31,463 INFO L93 Difference]: Finished difference Result 167 states and 300 transitions. [2024-11-09 00:28:31,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:28:31,466 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, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 177 [2024-11-09 00:28:31,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:28:31,473 INFO L225 Difference]: With dead ends: 167 [2024-11-09 00:28:31,473 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 00:28:31,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 176 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-09 00:28:31,482 INFO L432 NwaCegarLoop]: 132 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, 132 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-09 00:28:31,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:28:31,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 00:28:31,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-09 00:28:31,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 53 states have internal predecessors, (76), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 00:28:31,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 132 transitions. [2024-11-09 00:28:31,539 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 132 transitions. Word has length 177 [2024-11-09 00:28:31,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:28:31,539 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 132 transitions. [2024-11-09 00:28:31,540 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, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-09 00:28:31,540 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 132 transitions. [2024-11-09 00:28:31,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-09 00:28:31,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:28:31,547 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:28:31,571 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-09 00:28:31,748 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-09 00:28:31,748 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:28:31,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:28:31,749 INFO L85 PathProgramCache]: Analyzing trace with hash -112237409, now seen corresponding path program 1 times [2024-11-09 00:28:31,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:28:31,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823771138] [2024-11-09 00:28:31,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:28:31,751 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-09 00:28:31,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:28:31,753 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-09 00:28:31,754 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-09 00:28:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:32,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 00:28:32,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:28:33,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 573 proven. 18 refuted. 0 times theorem prover too weak. 921 trivial. 0 not checked. [2024-11-09 00:28:33,834 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:28:36,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 63 proven. 18 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-09 00:28:36,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:28:36,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823771138] [2024-11-09 00:28:36,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823771138] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:28:36,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 00:28:36,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-09 00:28:36,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352389447] [2024-11-09 00:28:36,178 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 00:28:36,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 00:28:36,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:28:36,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 00:28:36,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:28:36,182 INFO L87 Difference]: Start difference. First operand 83 states and 132 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-09 00:28:42,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:28:46,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:28:50,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:28:50,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:28:50,668 INFO L93 Difference]: Finished difference Result 171 states and 268 transitions. [2024-11-09 00:28:50,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 00:28:50,776 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 177 [2024-11-09 00:28:50,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:28:50,779 INFO L225 Difference]: With dead ends: 171 [2024-11-09 00:28:50,779 INFO L226 Difference]: Without dead ends: 91 [2024-11-09 00:28:50,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-09 00:28:50,781 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 153 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 51 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:28:50,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 234 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 153 Invalid, 3 Unknown, 0 Unchecked, 14.1s Time] [2024-11-09 00:28:50,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-09 00:28:50,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2024-11-09 00:28:50,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 00:28:50,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 134 transitions. [2024-11-09 00:28:50,807 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 134 transitions. Word has length 177 [2024-11-09 00:28:50,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:28:50,808 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 134 transitions. [2024-11-09 00:28:50,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-09 00:28:50,809 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 134 transitions. [2024-11-09 00:28:50,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-09 00:28:50,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:28:50,815 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:28:50,838 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-09 00:28:51,015 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-09 00:28:51,016 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:28:51,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:28:51,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1735493023, now seen corresponding path program 1 times [2024-11-09 00:28:51,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:28:51,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823469919] [2024-11-09 00:28:51,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:28:51,018 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-09 00:28:51,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:28:51,021 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-09 00:28:51,023 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-09 00:28:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:28:51,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 00:28:51,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:28:53,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 573 proven. 18 refuted. 0 times theorem prover too weak. 921 trivial. 0 not checked. [2024-11-09 00:28:53,326 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:28:55,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 63 proven. 18 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-09 00:28:55,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:28:55,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823469919] [2024-11-09 00:28:55,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823469919] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:28:55,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 00:28:55,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-09 00:28:55,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994512998] [2024-11-09 00:28:55,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 00:28:55,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 00:28:55,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:28:55,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 00:28:55,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 00:28:55,908 INFO L87 Difference]: Start difference. First operand 87 states and 134 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-09 00:29:03,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:29:07,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:29:11,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:29:15,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []