./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-12.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 755d5f76d73929589d64b16a7547856915b5d85bdf57f5b28a60878a4b98359f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 17:01:38,038 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:01:38,093 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 17:01:38,099 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:01:38,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:01:38,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:01:38,124 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:01:38,125 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:01:38,125 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:01:38,126 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:01:38,127 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:01:38,127 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:01:38,128 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:01:38,128 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:01:38,130 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:01:38,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:01:38,130 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:01:38,130 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:01:38,131 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 17:01:38,131 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:01:38,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:01:38,132 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:01:38,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:01:38,132 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:01:38,132 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:01:38,133 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:01:38,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:01:38,133 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:01:38,133 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:01:38,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:01:38,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:01:38,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:01:38,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:01:38,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:01:38,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:01:38,138 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:01:38,138 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 17:01:38,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 17:01:38,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:01:38,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:01:38,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:01:38,139 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:01:38,139 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 -> 755d5f76d73929589d64b16a7547856915b5d85bdf57f5b28a60878a4b98359f [2024-11-16 17:01:38,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:01:38,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:01:38,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:01:38,348 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:01:38,349 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:01:38,349 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-12.i [2024-11-16 17:01:39,530 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:01:39,718 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:01:39,720 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-12.i [2024-11-16 17:01:39,733 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5543db933/6d7d541b22594021a1fd1ed95092276f/FLAG15cdd0755 [2024-11-16 17:01:39,743 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5543db933/6d7d541b22594021a1fd1ed95092276f [2024-11-16 17:01:39,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:01:39,746 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:01:39,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:01:39,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:01:39,754 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:01:39,755 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:01:39" (1/1) ... [2024-11-16 17:01:39,756 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c44e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:39, skipping insertion in model container [2024-11-16 17:01:39,756 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:01:39" (1/1) ... [2024-11-16 17:01:39,785 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:01:39,911 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-12.i[916,929] [2024-11-16 17:01:39,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:01:39,983 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:01:39,991 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-12.i[916,929] [2024-11-16 17:01:40,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:01:40,053 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:01:40,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:40 WrapperNode [2024-11-16 17:01:40,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:01:40,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:01:40,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:01:40,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:01:40,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:40" (1/1) ... [2024-11-16 17:01:40,073 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:40" (1/1) ... [2024-11-16 17:01:40,118 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198 [2024-11-16 17:01:40,119 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:01:40,119 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:01:40,119 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:01:40,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:01:40,143 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:40" (1/1) ... [2024-11-16 17:01:40,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:40" (1/1) ... [2024-11-16 17:01:40,146 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:40" (1/1) ... [2024-11-16 17:01:40,166 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-16 17:01:40,167 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:40" (1/1) ... [2024-11-16 17:01:40,167 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:40" (1/1) ... [2024-11-16 17:01:40,176 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:40" (1/1) ... [2024-11-16 17:01:40,177 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:40" (1/1) ... [2024-11-16 17:01:40,179 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:40" (1/1) ... [2024-11-16 17:01:40,180 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:40" (1/1) ... [2024-11-16 17:01:40,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:01:40,185 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:01:40,185 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:01:40,185 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:01:40,186 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:40" (1/1) ... [2024-11-16 17:01:40,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:01:40,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:01:40,213 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-16 17:01:40,215 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-16 17:01:40,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:01:40,251 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:01:40,251 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:01:40,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 17:01:40,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:01:40,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:01:40,327 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:01:40,328 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:01:40,675 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L190: havoc property_#t~bitwise17#1;havoc property_#t~short18#1; [2024-11-16 17:01:40,705 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-16 17:01:40,705 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:01:40,723 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:01:40,723 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:01:40,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:01:40 BoogieIcfgContainer [2024-11-16 17:01:40,724 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:01:40,727 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:01:40,727 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:01:40,730 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:01:40,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:01:39" (1/3) ... [2024-11-16 17:01:40,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7291162c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:01:40, skipping insertion in model container [2024-11-16 17:01:40,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:40" (2/3) ... [2024-11-16 17:01:40,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7291162c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:01:40, skipping insertion in model container [2024-11-16 17:01:40,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:01:40" (3/3) ... [2024-11-16 17:01:40,733 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-12.i [2024-11-16 17:01:40,747 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:01:40,747 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:01:40,794 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:01:40,798 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;@6d279438, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:01:40,798 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:01:40,801 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 62 states have (on average 1.467741935483871) internal successors, (91), 63 states have internal predecessors, (91), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 17:01:40,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-16 17:01:40,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:01:40,811 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:01:40,811 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:01:40,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:01:40,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1604789315, now seen corresponding path program 1 times [2024-11-16 17:01:40,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:01:40,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366341228] [2024-11-16 17:01:40,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:01:40,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:01:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:01:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:01:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:01:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:01:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:01:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:01:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:01:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 17:01:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:01:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:01:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:01:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:01:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:01:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 17:01:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 17:01:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 17:01:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 17:01:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 17:01:41,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 17:01:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 17:01:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 17:01:41,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,156 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 17:01:41,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:01:41,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366341228] [2024-11-16 17:01:41,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366341228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:01:41,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:01:41,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 17:01:41,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856110691] [2024-11-16 17:01:41,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:01:41,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 17:01:41,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:01:41,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 17:01:41,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:01:41,183 INFO L87 Difference]: Start difference. First operand has 86 states, 62 states have (on average 1.467741935483871) internal successors, (91), 63 states have internal predecessors, (91), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-16 17:01:41,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:01:41,216 INFO L93 Difference]: Finished difference Result 164 states and 280 transitions. [2024-11-16 17:01:41,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 17:01:41,218 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 144 [2024-11-16 17:01:41,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:01:41,224 INFO L225 Difference]: With dead ends: 164 [2024-11-16 17:01:41,225 INFO L226 Difference]: Without dead ends: 81 [2024-11-16 17:01:41,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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-16 17:01:41,232 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:01:41,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:01:41,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-16 17:01:41,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-16 17:01:41,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 58 states have internal predecessors, (83), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 17:01:41,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 125 transitions. [2024-11-16 17:01:41,306 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 125 transitions. Word has length 144 [2024-11-16 17:01:41,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:01:41,306 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 125 transitions. [2024-11-16 17:01:41,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-16 17:01:41,307 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 125 transitions. [2024-11-16 17:01:41,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-16 17:01:41,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:01:41,314 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:01:41,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 17:01:41,314 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:01:41,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:01:41,315 INFO L85 PathProgramCache]: Analyzing trace with hash -197146660, now seen corresponding path program 1 times [2024-11-16 17:01:41,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:01:41,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370122065] [2024-11-16 17:01:41,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:01:41,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:01:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:01:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:01:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:01:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:01:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:01:41,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:01:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:01:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 17:01:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:01:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:01:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:01:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:01:41,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:01:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 17:01:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 17:01:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 17:01:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 17:01:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 17:01:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 17:01:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 17:01:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 17:01:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,582 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 17:01:41,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:01:41,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370122065] [2024-11-16 17:01:41,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370122065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:01:41,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:01:41,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 17:01:41,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170674485] [2024-11-16 17:01:41,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:01:41,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 17:01:41,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:01:41,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 17:01:41,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 17:01:41,588 INFO L87 Difference]: Start difference. First operand 81 states and 125 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 17:01:41,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:01:41,637 INFO L93 Difference]: Finished difference Result 190 states and 295 transitions. [2024-11-16 17:01:41,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 17:01:41,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 144 [2024-11-16 17:01:41,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:01:41,639 INFO L225 Difference]: With dead ends: 190 [2024-11-16 17:01:41,639 INFO L226 Difference]: Without dead ends: 112 [2024-11-16 17:01:41,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 17:01:41,641 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 45 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:01:41,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 233 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:01:41,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-16 17:01:41,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 87. [2024-11-16 17:01:41,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.46875) internal successors, (94), 64 states have internal predecessors, (94), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 17:01:41,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 136 transitions. [2024-11-16 17:01:41,657 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 136 transitions. Word has length 144 [2024-11-16 17:01:41,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:01:41,658 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 136 transitions. [2024-11-16 17:01:41,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 17:01:41,658 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 136 transitions. [2024-11-16 17:01:41,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-16 17:01:41,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:01:41,660 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:01:41,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 17:01:41,660 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:01:41,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:01:41,660 INFO L85 PathProgramCache]: Analyzing trace with hash -68063941, now seen corresponding path program 1 times [2024-11-16 17:01:41,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:01:41,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036043856] [2024-11-16 17:01:41,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:01:41,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:01:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:01:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:01:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:01:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:01:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:01:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:01:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:01:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 17:01:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:01:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:01:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:01:41,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:01:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:01:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 17:01:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 17:01:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 17:01:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 17:01:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 17:01:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 17:01:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 17:01:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 17:01:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:41,792 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 17:01:41,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:01:41,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036043856] [2024-11-16 17:01:41,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036043856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:01:41,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:01:41,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 17:01:41,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947808512] [2024-11-16 17:01:41,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:01:41,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 17:01:41,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:01:41,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 17:01:41,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 17:01:41,794 INFO L87 Difference]: Start difference. First operand 87 states and 136 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 17:01:41,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:01:41,857 INFO L93 Difference]: Finished difference Result 213 states and 328 transitions. [2024-11-16 17:01:41,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 17:01:41,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 144 [2024-11-16 17:01:41,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:01:41,872 INFO L225 Difference]: With dead ends: 213 [2024-11-16 17:01:41,872 INFO L226 Difference]: Without dead ends: 129 [2024-11-16 17:01:41,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 17:01:41,877 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 51 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:01:41,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 240 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:01:41,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-16 17:01:41,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 122. [2024-11-16 17:01:41,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 88 states have (on average 1.3636363636363635) internal successors, (120), 89 states have internal predecessors, (120), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-16 17:01:41,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 182 transitions. [2024-11-16 17:01:41,894 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 182 transitions. Word has length 144 [2024-11-16 17:01:41,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:01:41,896 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 182 transitions. [2024-11-16 17:01:41,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 17:01:41,896 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 182 transitions. [2024-11-16 17:01:41,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-16 17:01:41,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:01:41,901 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:01:41,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 17:01:41,901 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:01:41,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:01:41,901 INFO L85 PathProgramCache]: Analyzing trace with hash 783040001, now seen corresponding path program 1 times [2024-11-16 17:01:41,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:01:41,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79612813] [2024-11-16 17:01:41,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:01:41,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:01:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:42,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:01:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:42,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:01:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:42,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:01:42,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:42,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:01:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:42,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:01:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:42,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:01:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:42,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:01:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:42,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 17:01:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:42,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:01:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:42,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:01:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:42,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:01:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:42,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:01:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:42,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:01:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:42,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 17:01:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:42,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 17:01:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:42,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 17:01:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:42,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 17:01:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:42,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 17:01:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:42,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 17:01:42,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:42,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 17:01:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:42,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 17:01:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:42,449 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 17:01:42,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:01:42,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79612813] [2024-11-16 17:01:42,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79612813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:01:42,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:01:42,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 17:01:42,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003371295] [2024-11-16 17:01:42,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:01:42,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 17:01:42,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:01:42,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 17:01:42,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 17:01:42,453 INFO L87 Difference]: Start difference. First operand 122 states and 182 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 17:01:42,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:01:42,528 INFO L93 Difference]: Finished difference Result 243 states and 363 transitions. [2024-11-16 17:01:42,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 17:01:42,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 145 [2024-11-16 17:01:42,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:01:42,532 INFO L225 Difference]: With dead ends: 243 [2024-11-16 17:01:42,533 INFO L226 Difference]: Without dead ends: 124 [2024-11-16 17:01:42,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 17:01:42,534 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 39 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:01:42,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 502 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:01:42,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-16 17:01:42,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2024-11-16 17:01:42,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 89 states have internal predecessors, (118), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-16 17:01:42,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 180 transitions. [2024-11-16 17:01:42,550 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 180 transitions. Word has length 145 [2024-11-16 17:01:42,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:01:42,551 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 180 transitions. [2024-11-16 17:01:42,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 17:01:42,551 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 180 transitions. [2024-11-16 17:01:42,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-16 17:01:42,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:01:42,554 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:01:42,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 17:01:42,554 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:01:42,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:01:42,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1033586947, now seen corresponding path program 1 times [2024-11-16 17:01:42,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:01:42,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614122657] [2024-11-16 17:01:42,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:01:42,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:01:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 17:01:42,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1648387539] [2024-11-16 17:01:42,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:01:42,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:01:42,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:01:42,694 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-16 17:01:42,695 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-16 17:01:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:01:42,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 17:01:42,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:01:43,323 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 17:01:43,323 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:01:43,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:01:43,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614122657] [2024-11-16 17:01:43,324 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 17:01:43,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648387539] [2024-11-16 17:01:43,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648387539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:01:43,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:01:43,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 17:01:43,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802901423] [2024-11-16 17:01:43,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:01:43,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 17:01:43,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:01:43,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 17:01:43,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 17:01:43,326 INFO L87 Difference]: Start difference. First operand 122 states and 180 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 17:01:43,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:01:43,426 INFO L93 Difference]: Finished difference Result 355 states and 527 transitions. [2024-11-16 17:01:43,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 17:01:43,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 147 [2024-11-16 17:01:43,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:01:43,428 INFO L225 Difference]: With dead ends: 355 [2024-11-16 17:01:43,428 INFO L226 Difference]: Without dead ends: 236 [2024-11-16 17:01:43,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 17:01:43,430 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 117 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 17:01:43,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 317 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 17:01:43,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-16 17:01:43,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 163. [2024-11-16 17:01:43,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 107 states have (on average 1.280373831775701) internal successors, (137), 108 states have internal predecessors, (137), 52 states have call successors, (52), 3 states have call predecessors, (52), 3 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-16 17:01:43,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 241 transitions. [2024-11-16 17:01:43,454 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 241 transitions. Word has length 147 [2024-11-16 17:01:43,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:01:43,455 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 241 transitions. [2024-11-16 17:01:43,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 17:01:43,455 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 241 transitions. [2024-11-16 17:01:43,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-16 17:01:43,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:01:43,457 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:01:43,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 17:01:43,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:01:43,658 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:01:43,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:01:43,659 INFO L85 PathProgramCache]: Analyzing trace with hash 966580194, now seen corresponding path program 1 times [2024-11-16 17:01:43,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:01:43,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188373485] [2024-11-16 17:01:43,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:01:43,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:01:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 17:01:43,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [257618730] [2024-11-16 17:01:43,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:01:43,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:01:43,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:01:43,756 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-16 17:01:43,757 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-16 17:01:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 17:01:43,879 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 17:01:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 17:01:44,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 17:01:44,008 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 17:01:44,010 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 17:01:44,024 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-16 17:01:44,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-16 17:01:44,214 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-16 17:01:44,299 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 17:01:44,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 05:01:44 BoogieIcfgContainer [2024-11-16 17:01:44,302 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 17:01:44,302 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 17:01:44,302 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 17:01:44,302 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 17:01:44,303 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:01:40" (3/4) ... [2024-11-16 17:01:44,304 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 17:01:44,305 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 17:01:44,306 INFO L158 Benchmark]: Toolchain (without parser) took 4560.04ms. Allocated memory was 146.8MB in the beginning and 247.5MB in the end (delta: 100.7MB). Free memory was 75.7MB in the beginning and 206.8MB in the end (delta: -131.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:01:44,306 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 146.8MB. Free memory is still 97.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:01:44,306 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.28ms. Allocated memory is still 146.8MB. Free memory was 75.5MB in the beginning and 57.8MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 17:01:44,306 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.28ms. Allocated memory is still 146.8MB. Free memory was 57.8MB in the beginning and 114.7MB in the end (delta: -56.9MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2024-11-16 17:01:44,306 INFO L158 Benchmark]: Boogie Preprocessor took 65.24ms. Allocated memory was 146.8MB in the beginning and 205.5MB in the end (delta: 58.7MB). Free memory was 114.7MB in the beginning and 168.7MB in the end (delta: -54.0MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2024-11-16 17:01:44,307 INFO L158 Benchmark]: IcfgBuilder took 539.06ms. Allocated memory is still 205.5MB. Free memory was 168.7MB in the beginning and 139.3MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-16 17:01:44,307 INFO L158 Benchmark]: TraceAbstraction took 3574.67ms. Allocated memory was 205.5MB in the beginning and 247.5MB in the end (delta: 41.9MB). Free memory was 138.3MB in the beginning and 207.8MB in the end (delta: -69.5MB). Peak memory consumption was 109.8MB. Max. memory is 16.1GB. [2024-11-16 17:01:44,307 INFO L158 Benchmark]: Witness Printer took 3.16ms. Allocated memory is still 247.5MB. Free memory was 207.8MB in the beginning and 206.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:01:44,308 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.15ms. Allocated memory is still 146.8MB. Free memory is still 97.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.28ms. Allocated memory is still 146.8MB. Free memory was 75.5MB in the beginning and 57.8MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.28ms. Allocated memory is still 146.8MB. Free memory was 57.8MB in the beginning and 114.7MB in the end (delta: -56.9MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.24ms. Allocated memory was 146.8MB in the beginning and 205.5MB in the end (delta: 58.7MB). Free memory was 114.7MB in the beginning and 168.7MB in the end (delta: -54.0MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * IcfgBuilder took 539.06ms. Allocated memory is still 205.5MB. Free memory was 168.7MB in the beginning and 139.3MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3574.67ms. Allocated memory was 205.5MB in the beginning and 247.5MB in the end (delta: 41.9MB). Free memory was 138.3MB in the beginning and 207.8MB in the end (delta: -69.5MB). Peak memory consumption was 109.8MB. Max. memory is 16.1GB. * Witness Printer took 3.16ms. Allocated memory is still 247.5MB. Free memory was 207.8MB in the beginning and 206.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 190, overapproximation of someBinaryArithmeticDOUBLEoperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 100; [L23] unsigned char var_1_5 = 0; [L24] double var_1_6 = 4.5; [L25] unsigned char var_1_7 = 2; [L26] unsigned char var_1_8 = 2; [L27] double var_1_12 = 16.4; [L28] signed long int var_1_13 = 32; [L29] signed short int var_1_15 = -10; [L30] signed long int var_1_16 = -5; [L31] unsigned char var_1_17 = 1; [L32] signed short int var_1_18 = 500; [L33] double var_1_19 = 32.5; [L34] signed char var_1_20 = 0; [L35] double var_1_21 = 2.5; [L36] double var_1_22 = 0.0; [L37] double var_1_23 = 9.6; [L38] unsigned char var_1_24 = 64; [L39] unsigned char var_1_25 = 0; [L40] unsigned short int var_1_26 = 8; [L41] unsigned short int var_1_28 = 16; [L42] double var_1_29 = 200.5; [L43] unsigned short int var_1_30 = 20701; [L44] double last_1_var_1_6 = 4.5; [L45] signed long int last_1_var_1_16 = -5; [L46] signed short int last_1_var_1_18 = 500; [L47] signed char last_1_var_1_20 = 0; [L48] double last_1_var_1_21 = 2.5; [L49] unsigned char last_1_var_1_24 = 64; [L50] unsigned short int last_1_var_1_26 = 8; [L51] unsigned short int last_1_var_1_28 = 16; VAL [isInitial=0, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L194] isInitial = 1 [L195] FCALL initially() [L196] COND TRUE 1 [L197] CALL updateLastVariables() [L180] last_1_var_1_6 = var_1_6 [L181] last_1_var_1_16 = var_1_16 [L182] last_1_var_1_18 = var_1_18 [L183] last_1_var_1_20 = var_1_20 [L184] last_1_var_1_21 = var_1_21 [L185] last_1_var_1_24 = var_1_24 [L186] last_1_var_1_26 = var_1_26 [L187] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L197] RET updateLastVariables() [L198] CALL updateVariables() [L145] var_1_5 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_6=9/2, var_1_7=2, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_6=9/2, var_1_7=2, var_1_8=2] [L146] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_6=9/2, var_1_7=2, var_1_8=2] [L147] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L147] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L148] var_1_7 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_8=2] [L149] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_8=2] [L150] CALL assume_abort_if_not(var_1_7 <= 23) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L150] RET assume_abort_if_not(var_1_7 <= 23) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L151] var_1_8 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2] [L152] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2] [L153] CALL assume_abort_if_not(var_1_8 <= 23) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L153] RET assume_abort_if_not(var_1_8 <= 23) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L154] var_1_12 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L155] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L156] var_1_15 = __VERIFIER_nondet_short() [L157] CALL assume_abort_if_not(var_1_15 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L157] RET assume_abort_if_not(var_1_15 >= -32768) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L158] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L158] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L159] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L159] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L160] var_1_17 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L161] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L162] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L162] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L163] var_1_19 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854776000e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L164] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854776000e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L165] var_1_22 = __VERIFIER_nondet_double() [L166] CALL assume_abort_if_not((var_1_22 >= 4611686.018427382800e+12F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L166] RET assume_abort_if_not((var_1_22 >= 4611686.018427382800e+12F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L167] var_1_23 = __VERIFIER_nondet_double() [L168] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L168] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L169] var_1_25 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L170] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L171] CALL assume_abort_if_not(var_1_25 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L171] RET assume_abort_if_not(var_1_25 <= 254) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L172] var_1_29 = __VERIFIER_nondet_double() [L173] CALL assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L173] RET assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L174] CALL assume_abort_if_not(var_1_29 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L174] RET assume_abort_if_not(var_1_29 != 0.0F) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L175] var_1_30 = __VERIFIER_nondet_ushort() [L176] CALL assume_abort_if_not(var_1_30 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L176] RET assume_abort_if_not(var_1_30 >= 16383) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L177] CALL assume_abort_if_not(var_1_30 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L177] RET assume_abort_if_not(var_1_30 <= 32767) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L198] RET updateVariables() [L199] CALL step() [L55] unsigned char stepLocal_0 = ! var_1_5; VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_0=1, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L56] COND FALSE !(((last_1_var_1_26 * last_1_var_1_20) >= last_1_var_1_28) && stepLocal_0) [L59] var_1_1 = last_1_var_1_26 VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L61] EXPR (last_1_var_1_24 - last_1_var_1_28) << ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L61] signed long int stepLocal_1 = (last_1_var_1_24 - last_1_var_1_28) << ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))); [L62] COND FALSE !(last_1_var_1_18 <= stepLocal_1) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L69] signed long int stepLocal_3 = last_1_var_1_26 + var_1_8; VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_3=8, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L70] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_3=8, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L81] COND TRUE ! (last_1_var_1_18 <= (var_1_7 / var_1_15)) [L82] var_1_21 = ((((((var_1_22 - 7.5) - var_1_23)) > (var_1_12)) ? (((var_1_22 - 7.5) - var_1_23)) : (var_1_12))) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_3=8, var_1_12=0, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L86] COND FALSE !(var_1_17 || (var_1_8 >= last_1_var_1_24)) [L91] var_1_24 = var_1_7 VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_3=8, var_1_12=0, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L93] COND FALSE !(var_1_19 == var_1_21) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_3=8, var_1_12=0, var_1_13=32, var_1_15=-3, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L100] COND FALSE !(var_1_5 && var_1_17) [L103] var_1_16 = (var_1_8 - var_1_7) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_3=8, var_1_12=0, var_1_13=32, var_1_15=-3, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L105] unsigned char stepLocal_2 = var_1_24; VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_2=2, stepLocal_3=8, var_1_12=0, var_1_13=32, var_1_15=-3, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L106] COND TRUE var_1_21 > var_1_21 [L107] var_1_13 = (var_1_7 - var_1_24) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_2=2, stepLocal_3=8, var_1_12=0, var_1_13=0, var_1_15=-3, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L115] COND FALSE !(\read(var_1_17)) [L122] var_1_28 = var_1_1 VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_2=2, stepLocal_3=8, var_1_12=0, var_1_13=0, var_1_15=-3, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=8, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L124] COND TRUE ! var_1_17 VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_2=2, stepLocal_3=8, var_1_12=0, var_1_13=0, var_1_15=-3, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=8, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L125] COND FALSE !(\read(var_1_17)) [L138] var_1_26 = var_1_18 VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_2=2, stepLocal_3=8, var_1_12=0, var_1_13=0, var_1_15=-3, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=8, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L199] RET step() [L200] CALL, EXPR property() [L190] EXPR ((((last_1_var_1_26 * last_1_var_1_20) >= last_1_var_1_28) && (! var_1_5)) ? (var_1_1 == ((signed short int) last_1_var_1_26)) : (var_1_1 == ((signed short int) last_1_var_1_26))) && ((last_1_var_1_18 <= ((last_1_var_1_24 - last_1_var_1_28) << ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))))) ? (((- last_1_var_1_21) > (last_1_var_1_6 + (- last_1_var_1_21))) ? (var_1_6 == ((double) var_1_12)) : (var_1_6 == ((double) var_1_12))) : 1) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=0, var_1_13=0, var_1_15=-3, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=8, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L190] EXPR (last_1_var_1_24 - last_1_var_1_28) << ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=0, var_1_13=0, var_1_15=-3, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=8, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L190] EXPR ((((last_1_var_1_26 * last_1_var_1_20) >= last_1_var_1_28) && (! var_1_5)) ? (var_1_1 == ((signed short int) last_1_var_1_26)) : (var_1_1 == ((signed short int) last_1_var_1_26))) && ((last_1_var_1_18 <= ((last_1_var_1_24 - last_1_var_1_28) << ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))))) ? (((- last_1_var_1_21) > (last_1_var_1_6 + (- last_1_var_1_21))) ? (var_1_6 == ((double) var_1_12)) : (var_1_6 == ((double) var_1_12))) : 1) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=0, var_1_13=0, var_1_15=-3, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=8, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L190-L191] return ((((((((((((last_1_var_1_26 * last_1_var_1_20) >= last_1_var_1_28) && (! var_1_5)) ? (var_1_1 == ((signed short int) last_1_var_1_26)) : (var_1_1 == ((signed short int) last_1_var_1_26))) && ((last_1_var_1_18 <= ((last_1_var_1_24 - last_1_var_1_28) << ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))))) ? (((- last_1_var_1_21) > (last_1_var_1_6 + (- last_1_var_1_21))) ? (var_1_6 == ((double) var_1_12)) : (var_1_6 == ((double) var_1_12))) : 1)) && ((var_1_21 > var_1_21) ? (var_1_13 == ((signed long int) (var_1_7 - var_1_24))) : (((var_1_16 / var_1_15) < var_1_24) ? (var_1_13 == ((signed long int) var_1_7)) : (var_1_13 == ((signed long int) var_1_15))))) && ((var_1_5 && var_1_17) ? (var_1_16 == ((signed long int) ((((last_1_var_1_16) > (var_1_15)) ? (last_1_var_1_16) : (var_1_15))))) : (var_1_16 == ((signed long int) (var_1_8 - var_1_7))))) && (var_1_5 ? ((((((last_1_var_1_6) < ((1.0000000075E8 - var_1_19))) ? (last_1_var_1_6) : ((1.0000000075E8 - var_1_19)))) > var_1_12) ? (((last_1_var_1_26 + var_1_8) >= last_1_var_1_24) ? (var_1_18 == ((signed short int) var_1_7)) : (var_1_18 == ((signed short int) last_1_var_1_24))) : (var_1_18 == ((signed short int) var_1_8))) : 1)) && ((var_1_19 == var_1_21) ? ((! var_1_17) ? (var_1_20 == ((signed char) ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) : (var_1_20 == ((signed char) var_1_7))) : 1)) && ((! (last_1_var_1_18 <= (var_1_7 / var_1_15))) ? (var_1_21 == ((double) ((((((var_1_22 - 7.5) - var_1_23)) > (var_1_12)) ? (((var_1_22 - 7.5) - var_1_23)) : (var_1_12))))) : (var_1_21 == ((double) var_1_22)))) && ((var_1_17 || (var_1_8 >= last_1_var_1_24)) ? ((var_1_17 && (var_1_21 != var_1_23)) ? (var_1_24 == ((unsigned char) ((((var_1_7) < (var_1_25)) ? (var_1_7) : (var_1_25))))) : 1) : (var_1_24 == ((unsigned char) var_1_7)))) && ((! var_1_17) ? (var_1_17 ? ((var_1_6 <= ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))) ? ((var_1_19 <= ((var_1_12 + var_1_6) / var_1_22)) ? (((~ var_1_24) > var_1_1) ? (var_1_26 == ((unsigned short int) var_1_13)) : (var_1_26 == ((unsigned short int) var_1_7))) : 1) : (var_1_26 == ((unsigned short int) var_1_18))) : (var_1_26 == ((unsigned short int) var_1_18))) : (var_1_26 == ((unsigned short int) var_1_8)))) && (var_1_17 ? ((var_1_21 <= ((var_1_6 / var_1_22) + (var_1_21 / var_1_29))) ? (var_1_28 == ((unsigned short int) ((59265 - ((((var_1_8) > (var_1_18)) ? (var_1_8) : (var_1_18)))) - (var_1_30 - var_1_13)))) : (var_1_28 == ((unsigned short int) var_1_13))) : (var_1_28 == ((unsigned short int) var_1_1))) ; [L200] RET, EXPR property() [L200] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=0, var_1_13=0, var_1_15=-3, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=8, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=0, var_1_13=0, var_1_15=-3, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=8, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 6, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 252 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 252 mSDsluCounter, 1415 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 809 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 103 IncrementalHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 606 mSDtfsCounter, 103 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 352 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=5, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 107 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1165 NumberOfCodeBlocks, 1165 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 719 ConstructedInterpolants, 0 QuantifiedInterpolants, 1863 SizeOfPredicates, 2 NumberOfNonLiveVariables, 368 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 4200/4200 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-16 17:01:44,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-12.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 755d5f76d73929589d64b16a7547856915b5d85bdf57f5b28a60878a4b98359f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 17:01:46,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:01:46,217 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 17:01:46,223 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:01:46,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:01:46,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:01:46,248 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:01:46,248 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:01:46,249 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:01:46,251 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:01:46,251 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:01:46,252 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:01:46,252 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:01:46,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:01:46,252 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:01:46,253 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:01:46,253 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:01:46,253 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:01:46,253 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:01:46,253 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:01:46,253 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:01:46,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:01:46,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:01:46,255 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 17:01:46,255 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 17:01:46,255 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:01:46,255 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 17:01:46,255 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:01:46,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:01:46,256 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:01:46,256 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:01:46,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:01:46,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:01:46,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:01:46,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:01:46,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:01:46,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:01:46,258 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:01:46,258 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 17:01:46,258 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 17:01:46,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:01:46,259 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:01:46,259 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:01:46,259 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:01:46,259 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 -> 755d5f76d73929589d64b16a7547856915b5d85bdf57f5b28a60878a4b98359f [2024-11-16 17:01:46,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:01:46,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:01:46,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:01:46,506 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:01:46,507 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:01:46,508 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-12.i [2024-11-16 17:01:47,697 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:01:47,901 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:01:47,901 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-12.i [2024-11-16 17:01:47,911 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31946cd5f/35e5e8604b4f42e19733d7b670603614/FLAG61d9e4828 [2024-11-16 17:01:48,248 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31946cd5f/35e5e8604b4f42e19733d7b670603614 [2024-11-16 17:01:48,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:01:48,251 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:01:48,252 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:01:48,252 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:01:48,255 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:01:48,256 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:01:48" (1/1) ... [2024-11-16 17:01:48,257 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64495f14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:48, skipping insertion in model container [2024-11-16 17:01:48,257 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:01:48" (1/1) ... [2024-11-16 17:01:48,285 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:01:48,424 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-12.i[916,929] [2024-11-16 17:01:48,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:01:48,498 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:01:48,509 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-12.i[916,929] [2024-11-16 17:01:48,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:01:48,561 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:01:48,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:48 WrapperNode [2024-11-16 17:01:48,562 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:01:48,563 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:01:48,563 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:01:48,563 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:01:48,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:48" (1/1) ... [2024-11-16 17:01:48,580 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:48" (1/1) ... [2024-11-16 17:01:48,613 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-11-16 17:01:48,614 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:01:48,614 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:01:48,614 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:01:48,614 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:01:48,623 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:48" (1/1) ... [2024-11-16 17:01:48,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:48" (1/1) ... [2024-11-16 17:01:48,628 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:48" (1/1) ... [2024-11-16 17:01:48,642 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-16 17:01:48,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:48" (1/1) ... [2024-11-16 17:01:48,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:48" (1/1) ... [2024-11-16 17:01:48,665 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:48" (1/1) ... [2024-11-16 17:01:48,666 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:48" (1/1) ... [2024-11-16 17:01:48,685 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:48" (1/1) ... [2024-11-16 17:01:48,686 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:48" (1/1) ... [2024-11-16 17:01:48,693 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:01:48,698 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:01:48,698 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:01:48,698 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:01:48,698 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:48" (1/1) ... [2024-11-16 17:01:48,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:01:48,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:01:48,729 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-16 17:01:48,731 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-16 17:01:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:01:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 17:01:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:01:48,759 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:01:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:01:48,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:01:48,830 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:01:48,832 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:02:13,234 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-16 17:02:13,235 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:02:13,245 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:02:13,245 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:02:13,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:02:13 BoogieIcfgContainer [2024-11-16 17:02:13,246 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:02:13,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:02:13,247 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:02:13,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:02:13,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:01:48" (1/3) ... [2024-11-16 17:02:13,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db6a8d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:02:13, skipping insertion in model container [2024-11-16 17:02:13,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:48" (2/3) ... [2024-11-16 17:02:13,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db6a8d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:02:13, skipping insertion in model container [2024-11-16 17:02:13,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:02:13" (3/3) ... [2024-11-16 17:02:13,251 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-12.i [2024-11-16 17:02:13,261 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:02:13,262 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:02:13,311 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:02:13,316 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;@6b3eeb2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:02:13,316 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:02:13,319 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 17:02:13,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-16 17:02:13,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:02:13,329 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:02:13,329 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:02:13,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:02:13,336 INFO L85 PathProgramCache]: Analyzing trace with hash 898750873, now seen corresponding path program 1 times [2024-11-16 17:02:13,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:02:13,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436830683] [2024-11-16 17:02:13,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:02:13,349 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-16 17:02:13,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:02:13,352 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-16 17:02:13,353 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-16 17:02:14,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:14,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 17:02:14,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:02:14,765 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-11-16 17:02:14,765 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:02:14,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:02:14,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436830683] [2024-11-16 17:02:14,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [436830683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:02:14,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:02:14,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 17:02:14,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21318218] [2024-11-16 17:02:14,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:02:14,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 17:02:14,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:02:14,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 17:02:14,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:02:14,799 INFO L87 Difference]: Start difference. First operand has 79 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-16 17:02:14,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:02:14,820 INFO L93 Difference]: Finished difference Result 150 states and 260 transitions. [2024-11-16 17:02:14,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 17:02:14,822 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 141 [2024-11-16 17:02:14,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:02:14,827 INFO L225 Difference]: With dead ends: 150 [2024-11-16 17:02:14,827 INFO L226 Difference]: Without dead ends: 74 [2024-11-16 17:02:14,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 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-16 17:02:14,832 INFO L432 NwaCegarLoop]: 114 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, 114 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-16 17:02:14,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:02:14,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-16 17:02:14,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-16 17:02:14,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 17:02:14,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 114 transitions. [2024-11-16 17:02:14,865 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 114 transitions. Word has length 141 [2024-11-16 17:02:14,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:02:14,865 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 114 transitions. [2024-11-16 17:02:14,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-16 17:02:14,866 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 114 transitions. [2024-11-16 17:02:14,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-16 17:02:14,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:02:14,868 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:02:14,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-16 17:02:15,068 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-16 17:02:15,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:02:15,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:02:15,070 INFO L85 PathProgramCache]: Analyzing trace with hash -892519608, now seen corresponding path program 1 times [2024-11-16 17:02:15,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:02:15,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930263461] [2024-11-16 17:02:15,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:02:15,071 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-16 17:02:15,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:02:15,073 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-16 17:02:15,075 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-16 17:02:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:16,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 17:02:16,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:02:28,910 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 17:02:28,910 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:02:28,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:02:28,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1930263461] [2024-11-16 17:02:28,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1930263461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:02:28,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:02:28,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 17:02:28,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643144331] [2024-11-16 17:02:28,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:02:28,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 17:02:28,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:02:28,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 17:02:28,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 17:02:28,914 INFO L87 Difference]: Start difference. First operand 74 states and 114 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 17:02:33,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 17:02:38,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.47s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 17:02:42,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.49s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 17:02:47,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.50s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 17:02:51,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.76s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 17:02:55,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 17:03:00,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 17:03:05,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.50s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 17:03:10,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.79s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 17:03:14,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 17:03:14,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:03:14,116 INFO L93 Difference]: Finished difference Result 224 states and 348 transitions. [2024-11-16 17:03:14,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 17:03:14,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 142 [2024-11-16 17:03:14,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:03:14,382 INFO L225 Difference]: With dead ends: 224 [2024-11-16 17:03:14,382 INFO L226 Difference]: Without dead ends: 153 [2024-11-16 17:03:14,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 17:03:14,384 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 109 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 43 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.9s IncrementalHoareTripleChecker+Time [2024-11-16 17:03:14,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 321 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 11 Invalid, 10 Unknown, 0 Unchecked, 44.9s Time] [2024-11-16 17:03:14,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-16 17:03:14,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 115. [2024-11-16 17:03:14,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-16 17:03:14,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 175 transitions. [2024-11-16 17:03:14,407 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 175 transitions. Word has length 142 [2024-11-16 17:03:14,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:03:14,408 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 175 transitions. [2024-11-16 17:03:14,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 17:03:14,408 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 175 transitions. [2024-11-16 17:03:14,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-16 17:03:14,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:03:14,409 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:03:14,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-16 17:03:14,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:03:14,610 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:03:14,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:03:14,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1736991479, now seen corresponding path program 1 times [2024-11-16 17:03:14,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:03:14,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212966335] [2024-11-16 17:03:14,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:03:14,612 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-16 17:03:14,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:03:14,614 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 17:03:14,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 17:03:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:15,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 17:03:15,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:03:16,174 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 17:03:16,174 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:03:16,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:03:16,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212966335] [2024-11-16 17:03:16,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1212966335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:03:16,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:03:16,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 17:03:16,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907062175] [2024-11-16 17:03:16,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:03:16,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 17:03:16,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:03:16,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 17:03:16,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 17:03:16,176 INFO L87 Difference]: Start difference. First operand 115 states and 175 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 17:03:21,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.63s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []