./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-16.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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_amount50_file-16.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 75aa5f2ee03271bd7ea8f31048e96d5efa8e1cf538471333e970760dcc6ec02a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:44:27,746 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:44:27,832 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:44:27,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:44:27,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:44:27,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:44:27,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:44:27,888 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:44:27,889 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:44:27,891 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:44:27,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:44:27,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:44:27,893 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:44:27,895 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:44:27,895 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:44:27,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:44:27,896 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:44:27,896 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:44:27,896 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:44:27,897 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:44:27,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:44:27,900 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:44:27,900 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:44:27,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:44:27,901 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:44:27,901 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:44:27,901 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:44:27,902 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:44:27,902 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:44:27,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:44:27,902 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:44:27,903 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:44:27,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:44:27,905 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:44:27,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:44:27,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:44:27,906 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:44:27,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:44:27,907 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:44:27,907 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:44:27,907 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:44:27,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:44:27,908 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 -> 75aa5f2ee03271bd7ea8f31048e96d5efa8e1cf538471333e970760dcc6ec02a [2024-11-12 06:44:28,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:44:28,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:44:28,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:44:28,261 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:44:28,262 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:44:28,263 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-16.i [2024-11-12 06:44:29,892 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:44:30,114 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:44:30,116 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-16.i [2024-11-12 06:44:30,132 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61df049ca/fcf1e3d0b8df4084abb9fc0372a50650/FLAG020b4accd [2024-11-12 06:44:30,149 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61df049ca/fcf1e3d0b8df4084abb9fc0372a50650 [2024-11-12 06:44:30,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:44:30,154 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:44:30,156 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:44:30,156 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:44:30,165 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:44:30,166 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:44:30" (1/1) ... [2024-11-12 06:44:30,169 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@723b9133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:44:30, skipping insertion in model container [2024-11-12 06:44:30,170 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:44:30" (1/1) ... [2024-11-12 06:44:30,203 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:44:30,417 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_amount50_file-16.i[915,928] [2024-11-12 06:44:30,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:44:30,495 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:44:30,506 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_amount50_file-16.i[915,928] [2024-11-12 06:44:30,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:44:30,568 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:44:30,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:44:30 WrapperNode [2024-11-12 06:44:30,569 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:44:30,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:44:30,571 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:44:30,571 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:44:30,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:44:30" (1/1) ... [2024-11-12 06:44:30,598 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:44:30" (1/1) ... [2024-11-12 06:44:30,646 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 181 [2024-11-12 06:44:30,647 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:44:30,648 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:44:30,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:44:30,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:44:30,675 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:44:30" (1/1) ... [2024-11-12 06:44:30,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:44:30" (1/1) ... [2024-11-12 06:44:30,683 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:44:30" (1/1) ... [2024-11-12 06:44:30,703 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-12 06:44:30,703 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:44:30" (1/1) ... [2024-11-12 06:44:30,704 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:44:30" (1/1) ... [2024-11-12 06:44:30,713 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:44:30" (1/1) ... [2024-11-12 06:44:30,718 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:44:30" (1/1) ... [2024-11-12 06:44:30,720 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:44:30" (1/1) ... [2024-11-12 06:44:30,722 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:44:30" (1/1) ... [2024-11-12 06:44:30,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:44:30,727 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:44:30,728 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:44:30,728 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:44:30,729 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:44:30" (1/1) ... [2024-11-12 06:44:30,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:44:30,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:44:30,790 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-12 06:44:30,797 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-12 06:44:30,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:44:30,851 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:44:30,851 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:44:30,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:44:30,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:44:30,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:44:30,955 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:44:30,958 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:44:31,375 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-12 06:44:31,376 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:44:31,396 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:44:31,400 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:44:31,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:44:31 BoogieIcfgContainer [2024-11-12 06:44:31,401 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:44:31,404 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:44:31,404 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:44:31,412 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:44:31,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:44:30" (1/3) ... [2024-11-12 06:44:31,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3edbdfd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:44:31, skipping insertion in model container [2024-11-12 06:44:31,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:44:30" (2/3) ... [2024-11-12 06:44:31,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3edbdfd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:44:31, skipping insertion in model container [2024-11-12 06:44:31,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:44:31" (3/3) ... [2024-11-12 06:44:31,419 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-16.i [2024-11-12 06:44:31,441 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:44:31,441 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:44:31,522 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:44:31,533 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;@4d02d125, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:44:31,533 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:44:31,539 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 06:44:31,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-12 06:44:31,558 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:44:31,559 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:44:31,559 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:44:31,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:44:31,568 INFO L85 PathProgramCache]: Analyzing trace with hash -902327246, now seen corresponding path program 1 times [2024-11-12 06:44:31,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:44:31,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320622007] [2024-11-12 06:44:31,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:44:31,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:44:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:31,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:44:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:31,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:44:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:31,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:44:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:31,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:44:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:31,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:44:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:44:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:44:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:44:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:44:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:44:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:44:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:44:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:44:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:44:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:44:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 06:44:32,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:44:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 06:44:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 06:44:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 06:44:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 06:44:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 06:44:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,161 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 06:44:32,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:44:32,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320622007] [2024-11-12 06:44:32,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320622007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:44:32,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:44:32,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:44:32,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450901436] [2024-11-12 06:44:32,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:44:32,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:44:32,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:44:32,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:44:32,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:44:32,197 INFO L87 Difference]: Start difference. First operand has 78 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-12 06:44:32,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:44:32,225 INFO L93 Difference]: Finished difference Result 149 states and 252 transitions. [2024-11-12 06:44:32,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:44:32,228 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 147 [2024-11-12 06:44:32,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:44:32,235 INFO L225 Difference]: With dead ends: 149 [2024-11-12 06:44:32,236 INFO L226 Difference]: Without dead ends: 74 [2024-11-12 06:44:32,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-12 06:44:32,244 INFO L435 NwaCegarLoop]: 111 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, 111 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-12 06:44:32,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:44:32,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-12 06:44:32,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-12 06:44:32,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.34) internal successors, (67), 50 states have internal predecessors, (67), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 06:44:32,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 111 transitions. [2024-11-12 06:44:32,287 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 111 transitions. Word has length 147 [2024-11-12 06:44:32,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:44:32,288 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 111 transitions. [2024-11-12 06:44:32,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-12 06:44:32,289 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 111 transitions. [2024-11-12 06:44:32,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-12 06:44:32,293 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:44:32,293 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:44:32,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:44:32,294 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:44:32,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:44:32,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1213434746, now seen corresponding path program 1 times [2024-11-12 06:44:32,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:44:32,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131934892] [2024-11-12 06:44:32,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:44:32,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:44:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:44:32,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:44:32,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:44:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:44:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:44:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:44:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:44:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:44:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:44:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:44:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:44:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:44:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:44:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:44:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:44:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 06:44:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:44:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 06:44:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 06:44:32,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 06:44:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 06:44:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 06:44:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:32,970 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 06:44:32,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:44:32,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131934892] [2024-11-12 06:44:32,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131934892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:44:32,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:44:32,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 06:44:32,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183936273] [2024-11-12 06:44:32,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:44:32,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 06:44:32,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:44:32,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 06:44:32,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 06:44:32,983 INFO L87 Difference]: Start difference. First operand 74 states and 111 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:44:33,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:44:33,224 INFO L93 Difference]: Finished difference Result 253 states and 369 transitions. [2024-11-12 06:44:33,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 06:44:33,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2024-11-12 06:44:33,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:44:33,232 INFO L225 Difference]: With dead ends: 253 [2024-11-12 06:44:33,233 INFO L226 Difference]: Without dead ends: 182 [2024-11-12 06:44:33,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 06:44:33,237 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 189 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 06:44:33,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 357 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 06:44:33,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-12 06:44:33,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 126. [2024-11-12 06:44:33,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 100 states have internal predecessors, (141), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 06:44:33,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 189 transitions. [2024-11-12 06:44:33,271 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 189 transitions. Word has length 147 [2024-11-12 06:44:33,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:44:33,272 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 189 transitions. [2024-11-12 06:44:33,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:44:33,272 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 189 transitions. [2024-11-12 06:44:33,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-12 06:44:33,280 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:44:33,281 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:44:33,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 06:44:33,281 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:44:33,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:44:33,283 INFO L85 PathProgramCache]: Analyzing trace with hash -374913156, now seen corresponding path program 1 times [2024-11-12 06:44:33,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:44:33,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421839426] [2024-11-12 06:44:33,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:44:33,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:44:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:33,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:44:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:33,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:44:33,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:33,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:44:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:33,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:44:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:33,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:44:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:33,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:44:33,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:33,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:44:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:33,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:44:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:33,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:44:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:33,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:44:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:33,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:44:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:33,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:44:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:33,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:44:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:33,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:44:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:33,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:44:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:33,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 06:44:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:33,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:44:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:33,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 06:44:33,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:33,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 06:44:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:33,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 06:44:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:33,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 06:44:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:33,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 06:44:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:33,706 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 06:44:33,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:44:33,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421839426] [2024-11-12 06:44:33,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421839426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:44:33,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:44:33,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 06:44:33,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32559440] [2024-11-12 06:44:33,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:44:33,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 06:44:33,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:44:33,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 06:44:33,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 06:44:33,711 INFO L87 Difference]: Start difference. First operand 126 states and 189 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:44:33,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:44:33,935 INFO L93 Difference]: Finished difference Result 326 states and 476 transitions. [2024-11-12 06:44:33,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 06:44:33,937 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2024-11-12 06:44:33,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:44:33,940 INFO L225 Difference]: With dead ends: 326 [2024-11-12 06:44:33,941 INFO L226 Difference]: Without dead ends: 203 [2024-11-12 06:44:33,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-12 06:44:33,944 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 216 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 06:44:33,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 550 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 06:44:33,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-12 06:44:33,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 179. [2024-11-12 06:44:33,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 146 states have (on average 1.4246575342465753) internal successors, (208), 148 states have internal predecessors, (208), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 06:44:33,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 264 transitions. [2024-11-12 06:44:33,967 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 264 transitions. Word has length 147 [2024-11-12 06:44:33,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:44:33,968 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 264 transitions. [2024-11-12 06:44:33,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:44:33,968 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 264 transitions. [2024-11-12 06:44:33,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-12 06:44:33,970 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:44:33,970 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:44:33,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 06:44:33,971 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:44:33,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:44:33,984 INFO L85 PathProgramCache]: Analyzing trace with hash -116747718, now seen corresponding path program 1 times [2024-11-12 06:44:33,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:44:33,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727343860] [2024-11-12 06:44:33,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:44:33,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:44:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:34,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:44:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:34,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:44:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:44:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:44:35,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:44:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:44:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:44:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:44:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:44:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:44:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:44:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:44:35,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:44:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:44:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:44:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 06:44:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:44:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 06:44:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 06:44:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 06:44:35,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 06:44:35,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 06:44:35,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,060 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 06:44:35,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:44:35,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727343860] [2024-11-12 06:44:35,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727343860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:44:35,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:44:35,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 06:44:35,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745704701] [2024-11-12 06:44:35,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:44:35,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 06:44:35,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:44:35,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 06:44:35,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 06:44:35,063 INFO L87 Difference]: Start difference. First operand 179 states and 264 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:44:35,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:44:35,323 INFO L93 Difference]: Finished difference Result 456 states and 679 transitions. [2024-11-12 06:44:35,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 06:44:35,324 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 147 [2024-11-12 06:44:35,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:44:35,331 INFO L225 Difference]: With dead ends: 456 [2024-11-12 06:44:35,331 INFO L226 Difference]: Without dead ends: 280 [2024-11-12 06:44:35,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-12 06:44:35,336 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 77 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 06:44:35,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 412 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 06:44:35,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-12 06:44:35,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 243. [2024-11-12 06:44:35,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 210 states have (on average 1.4619047619047618) internal successors, (307), 212 states have internal predecessors, (307), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 06:44:35,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 363 transitions. [2024-11-12 06:44:35,361 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 363 transitions. Word has length 147 [2024-11-12 06:44:35,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:44:35,362 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 363 transitions. [2024-11-12 06:44:35,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:44:35,363 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 363 transitions. [2024-11-12 06:44:35,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-12 06:44:35,364 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:44:35,365 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:44:35,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 06:44:35,365 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:44:35,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:44:35,366 INFO L85 PathProgramCache]: Analyzing trace with hash 60265199, now seen corresponding path program 1 times [2024-11-12 06:44:35,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:44:35,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635248992] [2024-11-12 06:44:35,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:44:35,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:44:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:44:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:44:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:44:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:44:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:44:35,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:44:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:44:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:44:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:44:35,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:44:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:44:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:44:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:44:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:44:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:44:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 06:44:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:44:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 06:44:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 06:44:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 06:44:35,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 06:44:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 06:44:35,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:35,794 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 06:44:35,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:44:35,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635248992] [2024-11-12 06:44:35,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635248992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:44:35,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:44:35,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 06:44:35,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007349611] [2024-11-12 06:44:35,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:44:35,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 06:44:35,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:44:35,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 06:44:35,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 06:44:35,799 INFO L87 Difference]: Start difference. First operand 243 states and 363 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:44:36,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:44:36,003 INFO L93 Difference]: Finished difference Result 694 states and 1023 transitions. [2024-11-12 06:44:36,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 06:44:36,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2024-11-12 06:44:36,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:44:36,010 INFO L225 Difference]: With dead ends: 694 [2024-11-12 06:44:36,011 INFO L226 Difference]: Without dead ends: 454 [2024-11-12 06:44:36,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 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-12 06:44:36,013 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 106 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:44:36,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 426 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:44:36,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-11-12 06:44:36,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 390. [2024-11-12 06:44:36,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 325 states have (on average 1.4246153846153846) internal successors, (463), 329 states have internal predecessors, (463), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-12 06:44:36,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 575 transitions. [2024-11-12 06:44:36,064 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 575 transitions. Word has length 148 [2024-11-12 06:44:36,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:44:36,065 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 575 transitions. [2024-11-12 06:44:36,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 06:44:36,065 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 575 transitions. [2024-11-12 06:44:36,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-12 06:44:36,067 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:44:36,067 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:44:36,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 06:44:36,067 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:44:36,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:44:36,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1359558539, now seen corresponding path program 1 times [2024-11-12 06:44:36,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:44:36,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853179879] [2024-11-12 06:44:36,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:44:36,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:44:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:36,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:44:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:36,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:44:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:36,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:44:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:36,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:44:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:36,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:44:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:36,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:44:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:36,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:44:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:36,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:44:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:36,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:44:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:36,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:44:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:36,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:44:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:36,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:44:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:36,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:44:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:36,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 06:44:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:36,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 06:44:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:36,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 06:44:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:36,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 06:44:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:36,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 06:44:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:36,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 06:44:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:36,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 06:44:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:36,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 06:44:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:36,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 06:44:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:36,429 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-12 06:44:36,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:44:36,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853179879] [2024-11-12 06:44:36,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853179879] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 06:44:36,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548924008] [2024-11-12 06:44:36,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:44:36,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 06:44:36,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:44:36,436 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-12 06:44:36,438 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-12 06:44:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:36,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 06:44:36,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:44:36,825 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 301 proven. 51 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2024-11-12 06:44:36,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 06:44:37,089 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 12 proven. 51 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-12 06:44:37,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548924008] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 06:44:37,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 06:44:37,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-12 06:44:37,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972157929] [2024-11-12 06:44:37,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 06:44:37,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 06:44:37,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:44:37,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 06:44:37,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-12 06:44:37,093 INFO L87 Difference]: Start difference. First operand 390 states and 575 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-12 06:44:37,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:44:37,734 INFO L93 Difference]: Finished difference Result 859 states and 1238 transitions. [2024-11-12 06:44:37,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-12 06:44:37,735 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 149 [2024-11-12 06:44:37,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:44:37,740 INFO L225 Difference]: With dead ends: 859 [2024-11-12 06:44:37,740 INFO L226 Difference]: Without dead ends: 476 [2024-11-12 06:44:37,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 337 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=273, Invalid=597, Unknown=0, NotChecked=0, Total=870 [2024-11-12 06:44:37,745 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 380 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 06:44:37,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 484 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 06:44:37,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-11-12 06:44:37,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 249. [2024-11-12 06:44:37,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 196 states have (on average 1.4081632653061225) internal successors, (276), 197 states have internal predecessors, (276), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-12 06:44:37,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 368 transitions. [2024-11-12 06:44:37,780 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 368 transitions. Word has length 149 [2024-11-12 06:44:37,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:44:37,781 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 368 transitions. [2024-11-12 06:44:37,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-12 06:44:37,781 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 368 transitions. [2024-11-12 06:44:37,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-12 06:44:37,782 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:44:37,783 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:44:37,803 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-12 06:44:37,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-12 06:44:37,987 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:44:37,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:44:37,988 INFO L85 PathProgramCache]: Analyzing trace with hash 522854003, now seen corresponding path program 1 times [2024-11-12 06:44:37,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:44:37,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775239259] [2024-11-12 06:44:37,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:44:37,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:44:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 06:44:38,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1861090524] [2024-11-12 06:44:38,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:44:38,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 06:44:38,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:44:38,044 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-12 06:44:38,063 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-12 06:44:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:44:38,219 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 06:44:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:44:38,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 06:44:38,391 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 06:44:38,392 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 06:44:38,404 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-12 06:44:38,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-12 06:44:38,598 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:44:38,719 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 06:44:38,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:44:38 BoogieIcfgContainer [2024-11-12 06:44:38,723 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 06:44:38,723 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 06:44:38,723 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 06:44:38,724 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 06:44:38,724 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:44:31" (3/4) ... [2024-11-12 06:44:38,727 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 06:44:38,728 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 06:44:38,729 INFO L158 Benchmark]: Toolchain (without parser) took 8575.60ms. Allocated memory was 157.3MB in the beginning and 293.6MB in the end (delta: 136.3MB). Free memory was 101.2MB in the beginning and 221.3MB in the end (delta: -120.0MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2024-11-12 06:44:38,729 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 157.3MB. Free memory was 122.1MB in the beginning and 121.8MB in the end (delta: 302.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:44:38,729 INFO L158 Benchmark]: CACSL2BoogieTranslator took 413.67ms. Allocated memory is still 157.3MB. Free memory was 100.9MB in the beginning and 85.5MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 06:44:38,730 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.77ms. Allocated memory is still 157.3MB. Free memory was 85.2MB in the beginning and 82.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 06:44:38,730 INFO L158 Benchmark]: Boogie Preprocessor took 78.78ms. Allocated memory is still 157.3MB. Free memory was 82.4MB in the beginning and 78.9MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:44:38,730 INFO L158 Benchmark]: RCFGBuilder took 673.79ms. Allocated memory is still 157.3MB. Free memory was 78.9MB in the beginning and 56.5MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-12 06:44:38,731 INFO L158 Benchmark]: TraceAbstraction took 7319.22ms. Allocated memory was 157.3MB in the beginning and 293.6MB in the end (delta: 136.3MB). Free memory was 55.8MB in the beginning and 221.3MB in the end (delta: -165.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:44:38,731 INFO L158 Benchmark]: Witness Printer took 4.94ms. Allocated memory is still 293.6MB. Free memory is still 221.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:44:38,732 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.27ms. Allocated memory is still 157.3MB. Free memory was 122.1MB in the beginning and 121.8MB in the end (delta: 302.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 413.67ms. Allocated memory is still 157.3MB. Free memory was 100.9MB in the beginning and 85.5MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.77ms. Allocated memory is still 157.3MB. Free memory was 85.2MB in the beginning and 82.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.78ms. Allocated memory is still 157.3MB. Free memory was 82.4MB in the beginning and 78.9MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 673.79ms. Allocated memory is still 157.3MB. Free memory was 78.9MB in the beginning and 56.5MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7319.22ms. Allocated memory was 157.3MB in the beginning and 293.6MB in the end (delta: 136.3MB). Free memory was 55.8MB in the beginning and 221.3MB in the end (delta: -165.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.94ms. Allocated memory is still 293.6MB. Free memory is still 221.3MB. 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 139, overapproximation of someBinaryDOUBLEComparisonOperation at line 139, overapproximation of someUnaryFLOAToperation at line 92, overapproximation of someBinaryArithmeticFLOAToperation at line 92. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -50; [L23] unsigned char var_1_4 = 0; [L24] signed short int var_1_5 = 8; [L25] signed short int var_1_6 = 64; [L26] unsigned short int var_1_7 = 8; [L27] unsigned short int var_1_8 = 256; [L28] signed long int var_1_9 = 2; [L29] signed long int var_1_10 = 1441729073; [L30] unsigned short int var_1_11 = 32; [L31] double var_1_12 = 7.6; [L32] double var_1_13 = 127.8; [L33] signed char var_1_14 = 32; [L34] signed char var_1_15 = 50; [L35] signed char var_1_16 = 0; [L36] signed char var_1_17 = 16; [L37] float var_1_18 = 0.4; [L38] unsigned char var_1_19 = 0; [L39] float var_1_20 = 24.4; [L40] float var_1_21 = 500.5; [L41] float var_1_22 = 99.324; [L42] unsigned short int var_1_23 = 128; [L43] unsigned short int last_1_var_1_7 = 8; [L44] unsigned short int last_1_var_1_11 = 32; [L45] signed char last_1_var_1_14 = 32; [L46] unsigned short int last_1_var_1_23 = 128; VAL [isInitial=0, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L143] isInitial = 1 [L144] FCALL initially() [L145] COND TRUE 1 [L146] CALL updateLastVariables() [L133] last_1_var_1_7 = var_1_7 [L134] last_1_var_1_11 = var_1_11 [L135] last_1_var_1_14 = var_1_14 [L136] last_1_var_1_23 = var_1_23 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L146] RET updateLastVariables() [L147] CALL updateVariables() [L96] var_1_4 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L97] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L98] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L98] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L99] var_1_5 = __VERIFIER_nondet_short() [L100] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L100] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L101] CALL assume_abort_if_not(var_1_5 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L101] RET assume_abort_if_not(var_1_5 <= 32766) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L102] var_1_6 = __VERIFIER_nondet_short() [L103] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=256, var_1_9=2] [L103] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=256, var_1_9=2] [L104] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=256, var_1_9=2] [L104] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=256, var_1_9=2] [L105] var_1_8 = __VERIFIER_nondet_ushort() [L106] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_9=2] [L106] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_9=2] [L107] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L107] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L108] var_1_10 = __VERIFIER_nondet_long() [L109] CALL assume_abort_if_not(var_1_10 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L109] RET assume_abort_if_not(var_1_10 >= 1073741823) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L110] CALL assume_abort_if_not(var_1_10 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L110] RET assume_abort_if_not(var_1_10 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L111] var_1_13 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L112] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L113] var_1_15 = __VERIFIER_nondet_char() [L114] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L114] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L115] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L115] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L116] var_1_16 = __VERIFIER_nondet_char() [L117] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L117] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L118] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L118] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L119] var_1_17 = __VERIFIER_nondet_char() [L120] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L120] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L121] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L121] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L122] var_1_19 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L123] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L124] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L124] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L125] var_1_20 = __VERIFIER_nondet_float() [L126] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L126] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L127] var_1_21 = __VERIFIER_nondet_float() [L128] CALL assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L128] RET assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_22=24831/250, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L129] var_1_22 = __VERIFIER_nondet_float() [L130] CALL assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L130] RET assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L147] RET updateVariables() [L148] CALL step() [L50] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_0=32, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L51] COND FALSE !((last_1_var_1_23 / -50) >= stepLocal_0) [L58] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L60] COND FALSE !(var_1_4 && (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))) > var_1_5)) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=2] [L63] COND TRUE var_1_6 > 128 [L64] var_1_9 = (var_1_8 - (var_1_10 - var_1_1)) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=-1073709058] [L66] EXPR var_1_5 | var_1_6 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=-1073709058] [L66] signed long int stepLocal_2 = var_1_5 | var_1_6; [L67] COND FALSE !(((var_1_9 + var_1_23) * var_1_9) < stepLocal_2) [L72] var_1_11 = var_1_8 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=98303, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=-1073709058] [L74] signed short int stepLocal_1 = var_1_6; VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_1=129, var_1_10=1073741825, var_1_11=98303, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=8, var_1_8=98303, var_1_9=-1073709058] [L75] COND TRUE last_1_var_1_7 < stepLocal_1 [L76] var_1_7 = (var_1_6 + var_1_8) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=98303, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=32896, var_1_8=98303, var_1_9=-1073709058] [L78] unsigned short int stepLocal_4 = var_1_8; [L79] signed long int stepLocal_3 = var_1_9; VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_3=-1073709058, stepLocal_4=98303, var_1_10=1073741825, var_1_11=98303, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=32896, var_1_8=98303, var_1_9=-1073709058] [L80] COND FALSE !(stepLocal_3 < (- var_1_10)) [L85] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_4=98303, var_1_10=1073741825, var_1_11=98303, var_1_12=2, var_1_13=2, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=32896, var_1_8=98303, var_1_9=-1073709058] [L87] unsigned short int stepLocal_5 = var_1_8; VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_4=98303, stepLocal_5=98303, var_1_10=1073741825, var_1_11=98303, var_1_12=2, var_1_13=2, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=32896, var_1_8=98303, var_1_9=-1073709058] [L88] COND TRUE last_1_var_1_14 <= stepLocal_5 [L89] var_1_14 = ((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) - var_1_17) + -2) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_4=98303, var_1_10=1073741825, var_1_11=98303, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=32896, var_1_8=98303, var_1_9=-1073709058] [L91] COND TRUE var_1_4 || var_1_19 [L92] var_1_18 = ((((var_1_20 + (var_1_21 + var_1_22)) < 0 ) ? -(var_1_20 + (var_1_21 + var_1_22)) : (var_1_20 + (var_1_21 + var_1_22)))) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, stepLocal_4=98303, var_1_10=1073741825, var_1_11=98303, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=32896, var_1_8=98303, var_1_9=-1073709058] [L148] RET step() [L149] CALL, EXPR property() [L139] EXPR (((((last_1_var_1_23 / -50) >= last_1_var_1_11) ? (var_1_4 ? (var_1_1 == ((signed short int) (var_1_5 - var_1_6))) : (var_1_1 == ((signed short int) var_1_5))) : (var_1_1 == ((signed short int) var_1_5))) && ((last_1_var_1_7 < var_1_6) ? (var_1_7 == ((unsigned short int) (var_1_6 + var_1_8))) : 1)) && ((var_1_6 > 128) ? (var_1_9 == ((signed long int) (var_1_8 - (var_1_10 - var_1_1)))) : 1)) && ((((var_1_9 + var_1_23) * var_1_9) < (var_1_5 | var_1_6)) ? (var_1_4 ? (var_1_11 == ((unsigned short int) var_1_8)) : 1) : (var_1_11 == ((unsigned short int) var_1_8))) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=98303, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=32896, var_1_8=98303, var_1_9=-1073709058] [L139] EXPR var_1_5 | var_1_6 VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=98303, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=32896, var_1_8=98303, var_1_9=-1073709058] [L139] EXPR (((((last_1_var_1_23 / -50) >= last_1_var_1_11) ? (var_1_4 ? (var_1_1 == ((signed short int) (var_1_5 - var_1_6))) : (var_1_1 == ((signed short int) var_1_5))) : (var_1_1 == ((signed short int) var_1_5))) && ((last_1_var_1_7 < var_1_6) ? (var_1_7 == ((unsigned short int) (var_1_6 + var_1_8))) : 1)) && ((var_1_6 > 128) ? (var_1_9 == ((signed long int) (var_1_8 - (var_1_10 - var_1_1)))) : 1)) && ((((var_1_9 + var_1_23) * var_1_9) < (var_1_5 | var_1_6)) ? (var_1_4 ? (var_1_11 == ((unsigned short int) var_1_8)) : 1) : (var_1_11 == ((unsigned short int) var_1_8))) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=98303, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=32896, var_1_8=98303, var_1_9=-1073709058] [L139-L140] return (((((((((last_1_var_1_23 / -50) >= last_1_var_1_11) ? (var_1_4 ? (var_1_1 == ((signed short int) (var_1_5 - var_1_6))) : (var_1_1 == ((signed short int) var_1_5))) : (var_1_1 == ((signed short int) var_1_5))) && ((last_1_var_1_7 < var_1_6) ? (var_1_7 == ((unsigned short int) (var_1_6 + var_1_8))) : 1)) && ((var_1_6 > 128) ? (var_1_9 == ((signed long int) (var_1_8 - (var_1_10 - var_1_1)))) : 1)) && ((((var_1_9 + var_1_23) * var_1_9) < (var_1_5 | var_1_6)) ? (var_1_4 ? (var_1_11 == ((unsigned short int) var_1_8)) : 1) : (var_1_11 == ((unsigned short int) var_1_8)))) && ((var_1_9 < (- var_1_10)) ? ((var_1_8 <= var_1_9) ? (var_1_12 == ((double) (var_1_13 - 63.75))) : 1) : (var_1_12 == ((double) var_1_13)))) && ((last_1_var_1_14 <= var_1_8) ? (var_1_14 == ((signed char) ((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) - var_1_17) + -2))) : 1)) && ((var_1_4 || var_1_19) ? (var_1_18 == ((float) ((((var_1_20 + (var_1_21 + var_1_22)) < 0 ) ? -(var_1_20 + (var_1_21 + var_1_22)) : (var_1_20 + (var_1_21 + var_1_22)))))) : 1)) && ((var_1_4 && (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))) > var_1_5)) ? (var_1_23 == ((unsigned short int) var_1_6)) : 1) ; [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=98303, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=32896, var_1_8=98303, var_1_9=-1073709058] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=32, last_1_var_1_14=32, last_1_var_1_23=128, last_1_var_1_7=8, var_1_10=1073741825, var_1_11=98303, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_4=0, var_1_5=0, var_1_6=129, var_1_7=32896, var_1_8=98303, var_1_9=-1073709058] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 7, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 974 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 968 mSDsluCounter, 2340 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1639 mSDsCounter, 148 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 880 IncrementalHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 148 mSolverCounterUnsat, 701 mSDtfsCounter, 880 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 649 GetRequests, 595 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=390occurred in iteration=5, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 408 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1332 NumberOfCodeBlocks, 1332 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1175 ConstructedInterpolants, 0 QuantifiedInterpolants, 2481 SizeOfPredicates, 4 NumberOfNonLiveVariables, 356 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 7239/7392 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-12 06:44:38,770 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_amount50_file-16.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 75aa5f2ee03271bd7ea8f31048e96d5efa8e1cf538471333e970760dcc6ec02a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:44:41,150 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:44:41,239 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 06:44:41,248 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:44:41,248 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:44:41,286 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:44:41,286 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:44:41,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:44:41,289 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:44:41,289 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:44:41,290 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:44:41,290 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:44:41,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:44:41,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:44:41,292 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:44:41,294 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:44:41,294 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:44:41,295 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:44:41,295 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:44:41,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:44:41,295 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:44:41,298 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:44:41,299 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:44:41,299 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 06:44:41,299 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 06:44:41,299 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:44:41,300 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 06:44:41,300 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:44:41,300 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:44:41,300 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:44:41,300 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:44:41,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:44:41,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:44:41,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:44:41,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:44:41,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:44:41,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:44:41,302 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:44:41,302 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 06:44:41,303 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 06:44:41,303 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:44:41,303 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:44:41,303 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:44:41,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:44:41,304 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 -> 75aa5f2ee03271bd7ea8f31048e96d5efa8e1cf538471333e970760dcc6ec02a [2024-11-12 06:44:41,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:44:41,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:44:41,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:44:41,683 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:44:41,684 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:44:41,686 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-16.i [2024-11-12 06:44:43,365 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:44:43,613 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:44:43,615 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-16.i [2024-11-12 06:44:43,632 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a41ff6242/fcad189c39194cee8344faba2c844643/FLAGce38ed617 [2024-11-12 06:44:43,653 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a41ff6242/fcad189c39194cee8344faba2c844643 [2024-11-12 06:44:43,656 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:44:43,657 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:44:43,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:44:43,659 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:44:43,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:44:43,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:44:43" (1/1) ... [2024-11-12 06:44:43,668 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6452256f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:44:43, skipping insertion in model container [2024-11-12 06:44:43,668 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:44:43" (1/1) ... [2024-11-12 06:44:43,700 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:44:43,899 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_amount50_file-16.i[915,928] [2024-11-12 06:44:43,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:44:44,017 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:44:44,030 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_amount50_file-16.i[915,928] [2024-11-12 06:44:44,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:44:44,100 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:44:44,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:44:44 WrapperNode [2024-11-12 06:44:44,101 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:44:44,102 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:44:44,102 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:44:44,102 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:44:44,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:44:44" (1/1) ... [2024-11-12 06:44:44,127 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:44:44" (1/1) ... [2024-11-12 06:44:44,162 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 153 [2024-11-12 06:44:44,167 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:44:44,168 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:44:44,169 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:44:44,169 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:44:44,180 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:44:44" (1/1) ... [2024-11-12 06:44:44,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:44:44" (1/1) ... [2024-11-12 06:44:44,186 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:44:44" (1/1) ... [2024-11-12 06:44:44,209 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-12 06:44:44,210 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:44:44" (1/1) ... [2024-11-12 06:44:44,210 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:44:44" (1/1) ... [2024-11-12 06:44:44,222 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:44:44" (1/1) ... [2024-11-12 06:44:44,229 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:44:44" (1/1) ... [2024-11-12 06:44:44,235 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:44:44" (1/1) ... [2024-11-12 06:44:44,241 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:44:44" (1/1) ... [2024-11-12 06:44:44,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:44:44,249 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:44:44,252 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:44:44,252 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:44:44,253 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:44:44" (1/1) ... [2024-11-12 06:44:44,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:44:44,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:44:44,290 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-12 06:44:44,296 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-12 06:44:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:44:44,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 06:44:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:44:44,343 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:44:44,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:44:44,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:44:44,447 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:44:44,451 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:44:46,280 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-12 06:44:46,281 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:44:46,295 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:44:46,296 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:44:46,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:44:46 BoogieIcfgContainer [2024-11-12 06:44:46,296 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:44:46,300 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:44:46,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:44:46,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:44:46,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:44:43" (1/3) ... [2024-11-12 06:44:46,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf2795e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:44:46, skipping insertion in model container [2024-11-12 06:44:46,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:44:44" (2/3) ... [2024-11-12 06:44:46,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf2795e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:44:46, skipping insertion in model container [2024-11-12 06:44:46,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:44:46" (3/3) ... [2024-11-12 06:44:46,308 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-16.i [2024-11-12 06:44:46,328 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:44:46,328 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:44:46,411 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:44:46,416 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;@2447286d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:44:46,417 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:44:46,421 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 06:44:46,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-12 06:44:46,433 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:44:46,434 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:44:46,434 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:44:46,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:44:46,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1928066714, now seen corresponding path program 1 times [2024-11-12 06:44:46,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:44:46,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756303858] [2024-11-12 06:44:46,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:44:46,457 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-12 06:44:46,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:44:46,460 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-12 06:44:46,461 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-12 06:44:46,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:46,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 06:44:46,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:44:46,988 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-11-12 06:44:46,988 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:44:46,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:44:46,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756303858] [2024-11-12 06:44:46,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [756303858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:44:46,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:44:46,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:44:46,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284241032] [2024-11-12 06:44:46,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:44:47,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:44:47,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:44:47,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:44:47,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:44:47,030 INFO L87 Difference]: Start difference. First operand has 69 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-12 06:44:47,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:44:47,062 INFO L93 Difference]: Finished difference Result 131 states and 224 transitions. [2024-11-12 06:44:47,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:44:47,065 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 144 [2024-11-12 06:44:47,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:44:47,074 INFO L225 Difference]: With dead ends: 131 [2024-11-12 06:44:47,074 INFO L226 Difference]: Without dead ends: 65 [2024-11-12 06:44:47,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 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-12 06:44:47,084 INFO L435 NwaCegarLoop]: 97 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, 97 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-12 06:44:47,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:44:47,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-12 06:44:47,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-12 06:44:47,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 06:44:47,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 97 transitions. [2024-11-12 06:44:47,144 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 97 transitions. Word has length 144 [2024-11-12 06:44:47,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:44:47,146 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 97 transitions. [2024-11-12 06:44:47,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-12 06:44:47,146 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 97 transitions. [2024-11-12 06:44:47,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-12 06:44:47,151 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:44:47,151 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:44:47,167 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-12 06:44:47,355 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-12 06:44:47,356 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:44:47,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:44:47,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1824750510, now seen corresponding path program 1 times [2024-11-12 06:44:47,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:44:47,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985839822] [2024-11-12 06:44:47,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:44:47,360 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-12 06:44:47,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:44:47,364 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-12 06:44:47,366 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-12 06:44:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:44:47,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-12 06:44:47,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:45:32,870 WARN L286 SmtUtils]: Spent 10.35s on a formula simplification that was a NOOP. DAG size: 107 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)