./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-46.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 16bedafa7367c5fdfd22a91a49a3bc51f874f132ae36e0fa9860d4d7f4f51ac0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:08:43,363 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:08:43,433 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 05:08:43,436 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:08:43,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:08:43,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:08:43,453 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:08:43,454 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:08:43,454 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:08:43,454 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:08:43,455 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:08:43,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:08:43,455 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:08:43,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:08:43,456 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:08:43,456 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:08:43,456 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:08:43,457 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:08:43,457 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 05:08:43,457 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:08:43,457 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:08:43,459 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:08:43,459 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:08:43,459 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:08:43,459 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:08:43,460 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:08:43,460 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:08:43,460 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:08:43,460 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:08:43,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:08:43,461 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:08:43,461 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:08:43,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:08:43,461 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:08:43,461 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:08:43,462 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:08:43,462 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 05:08:43,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 05:08:43,462 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:08:43,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:08:43,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:08:43,466 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:08:43,466 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 -> 16bedafa7367c5fdfd22a91a49a3bc51f874f132ae36e0fa9860d4d7f4f51ac0 [2024-10-24 05:08:43,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:08:43,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:08:43,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:08:43,706 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:08:43,707 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:08:43,708 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-46.i [2024-10-24 05:08:44,974 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:08:45,188 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:08:45,189 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-46.i [2024-10-24 05:08:45,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73ff7d8f3/7b47d4f5a7744f349b2c473ae32ca660/FLAG5913ce0ec [2024-10-24 05:08:45,538 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73ff7d8f3/7b47d4f5a7744f349b2c473ae32ca660 [2024-10-24 05:08:45,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:08:45,541 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:08:45,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:08:45,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:08:45,550 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:08:45,551 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:08:45" (1/1) ... [2024-10-24 05:08:45,553 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61c31201 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:08:45, skipping insertion in model container [2024-10-24 05:08:45,553 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:08:45" (1/1) ... [2024-10-24 05:08:45,579 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:08:45,731 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-46.i[919,932] [2024-10-24 05:08:45,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:08:45,795 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:08:45,804 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-46.i[919,932] [2024-10-24 05:08:45,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:08:45,847 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:08:45,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:08:45 WrapperNode [2024-10-24 05:08:45,847 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:08:45,848 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:08:45,848 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:08:45,848 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:08:45,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:08:45" (1/1) ... [2024-10-24 05:08:45,864 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:08:45" (1/1) ... [2024-10-24 05:08:45,897 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 169 [2024-10-24 05:08:45,898 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:08:45,898 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:08:45,898 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:08:45,898 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:08:45,910 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:08:45" (1/1) ... [2024-10-24 05:08:45,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:08:45" (1/1) ... [2024-10-24 05:08:45,915 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:08:45" (1/1) ... [2024-10-24 05:08:45,937 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 05:08:45,938 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:08:45" (1/1) ... [2024-10-24 05:08:45,938 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:08:45" (1/1) ... [2024-10-24 05:08:45,951 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:08:45" (1/1) ... [2024-10-24 05:08:45,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:08:45" (1/1) ... [2024-10-24 05:08:45,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:08:45" (1/1) ... [2024-10-24 05:08:45,964 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:08:45" (1/1) ... [2024-10-24 05:08:45,973 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:08:45,974 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:08:45,975 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:08:45,975 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:08:45,976 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:08:45" (1/1) ... [2024-10-24 05:08:45,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:08:45,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:08:46,017 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 05:08:46,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 05:08:46,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:08:46,061 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:08:46,061 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:08:46,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 05:08:46,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:08:46,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:08:46,127 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:08:46,128 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:08:46,462 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-24 05:08:46,463 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:08:46,520 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:08:46,521 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:08:46,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:08:46 BoogieIcfgContainer [2024-10-24 05:08:46,521 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:08:46,529 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:08:46,529 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:08:46,532 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:08:46,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:08:45" (1/3) ... [2024-10-24 05:08:46,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cfc134c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:08:46, skipping insertion in model container [2024-10-24 05:08:46,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:08:45" (2/3) ... [2024-10-24 05:08:46,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cfc134c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:08:46, skipping insertion in model container [2024-10-24 05:08:46,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:08:46" (3/3) ... [2024-10-24 05:08:46,555 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-46.i [2024-10-24 05:08:46,574 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:08:46,575 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:08:46,623 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:08:46,628 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;@3d701af0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:08:46,629 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:08:46,632 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 44 states have internal predecessors, (64), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 05:08:46,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 05:08:46,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:08:46,642 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:08:46,642 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:08:46,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:08:46,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1781409717, now seen corresponding path program 1 times [2024-10-24 05:08:46,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:08:46,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220434775] [2024-10-24 05:08:46,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:08:46,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:08:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:46,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:08:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:46,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:08:46,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:46,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:08:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:46,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:08:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:46,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:08:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:46,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:08:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:46,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:08:46,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:46,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:08:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:46,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:08:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:46,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:08:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:46,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:08:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:46,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:08:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:46,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:08:46,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:46,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:08:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:46,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:08:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:46,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:08:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:46,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:08:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:46,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:08:46,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:46,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:08:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:47,001 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 05:08:47,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:08:47,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220434775] [2024-10-24 05:08:47,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220434775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:08:47,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:08:47,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:08:47,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843349747] [2024-10-24 05:08:47,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:08:47,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:08:47,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:08:47,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:08:47,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:08:47,037 INFO L87 Difference]: Start difference. First operand has 65 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 44 states have internal predecessors, (64), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 05:08:47,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:08:47,077 INFO L93 Difference]: Finished difference Result 127 states and 221 transitions. [2024-10-24 05:08:47,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:08:47,079 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 120 [2024-10-24 05:08:47,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:08:47,085 INFO L225 Difference]: With dead ends: 127 [2024-10-24 05:08:47,086 INFO L226 Difference]: Without dead ends: 63 [2024-10-24 05:08:47,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:08:47,095 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:08:47,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:08:47,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-24 05:08:47,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-24 05:08:47,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 05:08:47,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 96 transitions. [2024-10-24 05:08:47,133 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 96 transitions. Word has length 120 [2024-10-24 05:08:47,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:08:47,133 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 96 transitions. [2024-10-24 05:08:47,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 05:08:47,133 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 96 transitions. [2024-10-24 05:08:47,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 05:08:47,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:08:47,137 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:08:47,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 05:08:47,138 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:08:47,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:08:47,138 INFO L85 PathProgramCache]: Analyzing trace with hash 271416512, now seen corresponding path program 1 times [2024-10-24 05:08:47,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:08:47,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626314124] [2024-10-24 05:08:47,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:08:47,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:08:47,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:59,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:08:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:59,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:08:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:59,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:08:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:59,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:08:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:59,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:08:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:59,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:08:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:59,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:08:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:59,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:08:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:59,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:08:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:59,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:08:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:59,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:08:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:59,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:08:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:59,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:08:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:59,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:08:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:59,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:08:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:59,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:08:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:59,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:08:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:59,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:08:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:59,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:08:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:59,155 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 05:08:59,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:08:59,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626314124] [2024-10-24 05:08:59,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626314124] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:08:59,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:08:59,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 05:08:59,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497693565] [2024-10-24 05:08:59,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:08:59,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 05:08:59,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:08:59,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 05:08:59,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-24 05:08:59,159 INFO L87 Difference]: Start difference. First operand 63 states and 96 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 05:09:03,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:09:03,359 INFO L93 Difference]: Finished difference Result 231 states and 342 transitions. [2024-10-24 05:09:03,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 05:09:03,360 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 121 [2024-10-24 05:09:03,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:09:03,363 INFO L225 Difference]: With dead ends: 231 [2024-10-24 05:09:03,363 INFO L226 Difference]: Without dead ends: 169 [2024-10-24 05:09:03,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-10-24 05:09:03,365 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 412 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 05:09:03,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 350 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 05:09:03,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-24 05:09:03,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 117. [2024-10-24 05:09:03,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 86 states have (on average 1.430232558139535) internal successors, (123), 87 states have internal predecessors, (123), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-24 05:09:03,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 177 transitions. [2024-10-24 05:09:03,383 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 177 transitions. Word has length 121 [2024-10-24 05:09:03,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:09:03,383 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 177 transitions. [2024-10-24 05:09:03,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-24 05:09:03,384 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 177 transitions. [2024-10-24 05:09:03,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 05:09:03,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:09:03,385 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:09:03,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 05:09:03,386 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:09:03,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:09:03,386 INFO L85 PathProgramCache]: Analyzing trace with hash -315389502, now seen corresponding path program 1 times [2024-10-24 05:09:03,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:09:03,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668765319] [2024-10-24 05:09:03,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:09:03,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:09:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 05:09:03,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [125954798] [2024-10-24 05:09:03,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:09:03,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:09:03,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:09:03,435 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 05:09:03,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 05:09:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:09:03,555 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 05:09:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:09:03,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 05:09:03,655 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 05:09:03,656 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 05:09:03,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 05:09:03,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:09:03,861 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 05:09:03,938 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 05:09:03,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 05:09:03 BoogieIcfgContainer [2024-10-24 05:09:03,945 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 05:09:03,946 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 05:09:03,946 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 05:09:03,946 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 05:09:03,947 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:08:46" (3/4) ... [2024-10-24 05:09:03,948 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 05:09:03,949 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 05:09:03,950 INFO L158 Benchmark]: Toolchain (without parser) took 18408.59ms. Allocated memory was 165.7MB in the beginning and 310.4MB in the end (delta: 144.7MB). Free memory was 135.3MB in the beginning and 176.4MB in the end (delta: -41.1MB). Peak memory consumption was 103.6MB. Max. memory is 16.1GB. [2024-10-24 05:09:03,950 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 130.0MB. Free memory is still 91.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:09:03,952 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.86ms. Allocated memory is still 165.7MB. Free memory was 135.3MB in the beginning and 119.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 05:09:03,953 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.47ms. Allocated memory is still 165.7MB. Free memory was 119.2MB in the beginning and 114.3MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 05:09:03,953 INFO L158 Benchmark]: Boogie Preprocessor took 74.97ms. Allocated memory is still 165.7MB. Free memory was 114.3MB in the beginning and 107.3MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-24 05:09:03,954 INFO L158 Benchmark]: RCFGBuilder took 546.89ms. Allocated memory is still 165.7MB. Free memory was 107.3MB in the beginning and 129.9MB in the end (delta: -22.6MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2024-10-24 05:09:03,954 INFO L158 Benchmark]: TraceAbstraction took 17416.66ms. Allocated memory was 165.7MB in the beginning and 310.4MB in the end (delta: 144.7MB). Free memory was 129.8MB in the beginning and 177.4MB in the end (delta: -47.6MB). Peak memory consumption was 97.2MB. Max. memory is 16.1GB. [2024-10-24 05:09:03,957 INFO L158 Benchmark]: Witness Printer took 3.30ms. Allocated memory is still 310.4MB. Free memory was 177.4MB in the beginning and 176.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:09:03,959 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.09ms. Allocated memory is still 130.0MB. Free memory is still 91.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.86ms. Allocated memory is still 165.7MB. Free memory was 135.3MB in the beginning and 119.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.47ms. Allocated memory is still 165.7MB. Free memory was 119.2MB in the beginning and 114.3MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.97ms. Allocated memory is still 165.7MB. Free memory was 114.3MB in the beginning and 107.3MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 546.89ms. Allocated memory is still 165.7MB. Free memory was 107.3MB in the beginning and 129.9MB in the end (delta: -22.6MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. * TraceAbstraction took 17416.66ms. Allocated memory was 165.7MB in the beginning and 310.4MB in the end (delta: 144.7MB). Free memory was 129.8MB in the beginning and 177.4MB in the end (delta: -47.6MB). Peak memory consumption was 97.2MB. Max. memory is 16.1GB. * Witness Printer took 3.30ms. Allocated memory is still 310.4MB. Free memory was 177.4MB in the beginning and 176.4MB 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 someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 124. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 16; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_4 = 128; [L26] unsigned char var_1_5 = 10; [L27] unsigned short int var_1_6 = 10; [L28] unsigned short int var_1_7 = 52077; [L29] unsigned short int var_1_8 = 47248; [L30] unsigned short int var_1_9 = 50; [L31] float var_1_11 = 63.75; [L32] signed long int var_1_12 = 100000; [L33] unsigned short int var_1_13 = 8; [L34] signed long int var_1_14 = 2; [L35] signed long int var_1_15 = 32; [L36] double var_1_17 = 127.5; [L37] double var_1_18 = 32.75; [L38] signed char var_1_19 = 0; [L39] unsigned long int var_1_20 = 128; [L40] unsigned short int last_1_var_1_13 = 8; [L41] double last_1_var_1_17 = 127.5; [L128] isInitial = 1 [L129] FCALL initially() [L130] COND TRUE 1 [L131] CALL updateLastVariables() [L120] last_1_var_1_13 = var_1_13 [L121] last_1_var_1_17 = var_1_17 [L131] RET updateLastVariables() [L132] CALL updateVariables() [L89] var_1_2 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L90] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L91] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L91] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L92] var_1_3 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L93] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L94] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L94] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L95] var_1_4 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_4 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L96] RET assume_abort_if_not(var_1_4 >= 127) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L97] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L97] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L98] var_1_5 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L99] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L100] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L100] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L101] var_1_7 = __VERIFIER_nondet_ushort() [L102] CALL assume_abort_if_not(var_1_7 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=47248, var_1_9=50] [L102] RET assume_abort_if_not(var_1_7 >= 32767) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=47248, var_1_9=50] [L103] CALL assume_abort_if_not(var_1_7 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=47248, var_1_9=50] [L103] RET assume_abort_if_not(var_1_7 <= 65534) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=47248, var_1_9=50] [L104] var_1_8 = __VERIFIER_nondet_ushort() [L105] CALL assume_abort_if_not(var_1_8 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L105] RET assume_abort_if_not(var_1_8 >= 32767) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L106] CALL assume_abort_if_not(var_1_8 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L106] RET assume_abort_if_not(var_1_8 <= 65534) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L107] var_1_11 = __VERIFIER_nondet_float() [L108] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L108] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L109] CALL assume_abort_if_not(var_1_11 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L109] RET assume_abort_if_not(var_1_11 != 0.0F) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L110] var_1_14 = __VERIFIER_nondet_long() [L111] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L111] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L112] CALL assume_abort_if_not(var_1_14 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L112] RET assume_abort_if_not(var_1_14 <= 32) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L113] var_1_15 = __VERIFIER_nondet_long() [L114] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L114] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L115] CALL assume_abort_if_not(var_1_15 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L115] RET assume_abort_if_not(var_1_15 <= 32) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L116] var_1_18 = __VERIFIER_nondet_double() [L117] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L117] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L132] RET updateVariables() [L133] CALL step() [L45] COND FALSE !(-100000 >= last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L48] COND FALSE !((last_1_var_1_17 / var_1_11) == 999999.6f) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L52] COND TRUE var_1_2 && var_1_3 [L53] var_1_1 = (var_1_4 - var_1_5) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=65534, var_1_8=65534, var_1_9=50] [L57] COND FALSE !(var_1_1 <= (var_1_5 * var_1_4)) [L64] var_1_6 = var_1_5 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L66] var_1_17 = var_1_18 [L67] var_1_19 = 5 [L68] var_1_20 = var_1_15 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L69] EXPR -4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L69] EXPR var_1_7 | ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L69] COND FALSE !((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) [L76] var_1_13 = var_1_1 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=254, var_1_14=0, var_1_15=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L78] COND FALSE !(var_1_1 < var_1_20) [L85] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=0, var_1_15=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L133] RET step() [L134] CALL, EXPR property() [L124] EXPR (((((var_1_2 && var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 - var_1_5))) : (var_1_1 == ((unsigned char) (var_1_4 - var_1_5)))) && ((var_1_1 <= (var_1_5 * var_1_4)) ? (var_1_2 ? (var_1_6 == ((unsigned short int) (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5)))) && ((-100000 >= last_1_var_1_13) ? (var_1_9 == ((unsigned short int) (((((last_1_var_1_13 + var_1_5)) > (64)) ? ((last_1_var_1_13 + var_1_5)) : (64))))) : (((last_1_var_1_17 / var_1_11) == 999999.6f) ? (var_1_9 == ((unsigned short int) var_1_7)) : 1))) && ((var_1_1 < var_1_20) ? ((var_1_5 == (~ (var_1_1 + var_1_20))) ? (var_1_12 == ((signed long int) (((((var_1_5) > (((((-1) < (var_1_1)) ? (-1) : (var_1_1))))) ? (var_1_5) : (((((-1) < (var_1_1)) ? (-1) : (var_1_1)))))) - 1000))) : (var_1_12 == ((signed long int) ((((var_1_20) < (var_1_8)) ? (var_1_20) : (var_1_8)))))) : (var_1_12 == ((signed long int) var_1_6)))) && (((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) ? (var_1_3 ? (var_1_13 == ((unsigned short int) var_1_6)) : (var_1_13 == ((unsigned short int) var_1_4))) : (var_1_13 == ((unsigned short int) var_1_1))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=0, var_1_15=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L124-L125] return ((((((((var_1_2 && var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 - var_1_5))) : (var_1_1 == ((unsigned char) (var_1_4 - var_1_5)))) && ((var_1_1 <= (var_1_5 * var_1_4)) ? (var_1_2 ? (var_1_6 == ((unsigned short int) (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5)))) && ((-100000 >= last_1_var_1_13) ? (var_1_9 == ((unsigned short int) (((((last_1_var_1_13 + var_1_5)) > (64)) ? ((last_1_var_1_13 + var_1_5)) : (64))))) : (((last_1_var_1_17 / var_1_11) == 999999.6f) ? (var_1_9 == ((unsigned short int) var_1_7)) : 1))) && ((var_1_1 < var_1_20) ? ((var_1_5 == (~ (var_1_1 + var_1_20))) ? (var_1_12 == ((signed long int) (((((var_1_5) > (((((-1) < (var_1_1)) ? (-1) : (var_1_1))))) ? (var_1_5) : (((((-1) < (var_1_1)) ? (-1) : (var_1_1)))))) - 1000))) : (var_1_12 == ((signed long int) ((((var_1_20) < (var_1_8)) ? (var_1_20) : (var_1_8)))))) : (var_1_12 == ((signed long int) var_1_6)))) && (((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) ? (var_1_3 ? (var_1_13 == ((unsigned short int) var_1_6)) : (var_1_13 == ((unsigned short int) var_1_4))) : (var_1_13 == ((unsigned short int) var_1_1)))) && (var_1_17 == ((double) var_1_18))) && (var_1_19 == ((signed char) 5))) && (var_1_20 == ((unsigned long int) var_1_15)) ; [L134] RET, EXPR property() [L134] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=0, var_1_15=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=0, var_1_15=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=65534, var_1_8=65534, var_1_9=50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.3s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 412 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 412 mSDsluCounter, 443 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 246 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 545 IncrementalHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 197 mSDtfsCounter, 545 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 52 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 483 NumberOfCodeBlocks, 483 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 239 ConstructedInterpolants, 0 QuantifiedInterpolants, 1249 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1368/1368 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 05:09:04,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-46.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 16bedafa7367c5fdfd22a91a49a3bc51f874f132ae36e0fa9860d4d7f4f51ac0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:09:05,868 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:09:05,936 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 05:09:05,941 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:09:05,941 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:09:05,971 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:09:05,971 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:09:05,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:09:05,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:09:05,972 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:09:05,972 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:09:05,972 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:09:05,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:09:05,975 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:09:05,975 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:09:05,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:09:05,976 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:09:05,979 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:09:05,980 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:09:05,980 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:09:05,980 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:09:05,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:09:05,981 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:09:05,981 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 05:09:05,981 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 05:09:05,981 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:09:05,981 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 05:09:05,981 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:09:05,982 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:09:05,982 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:09:05,982 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:09:05,982 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:09:05,982 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:09:05,982 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:09:05,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:09:05,983 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:09:05,983 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:09:05,983 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:09:05,983 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 05:09:05,983 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 05:09:05,984 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:09:05,986 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:09:05,986 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:09:05,986 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:09:05,986 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 05:09:05,986 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 -> 16bedafa7367c5fdfd22a91a49a3bc51f874f132ae36e0fa9860d4d7f4f51ac0 [2024-10-24 05:09:06,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:09:06,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:09:06,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:09:06,297 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:09:06,298 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:09:06,300 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-46.i [2024-10-24 05:09:07,578 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:09:07,773 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:09:07,774 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-46.i [2024-10-24 05:09:07,783 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de5aea01b/e83b3b3a4ca34a26ba269f37718aece4/FLAG2cfc500f8 [2024-10-24 05:09:07,799 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de5aea01b/e83b3b3a4ca34a26ba269f37718aece4 [2024-10-24 05:09:07,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:09:07,803 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:09:07,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:09:07,805 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:09:07,810 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:09:07,811 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:09:07" (1/1) ... [2024-10-24 05:09:07,812 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e2b868c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:07, skipping insertion in model container [2024-10-24 05:09:07,812 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:09:07" (1/1) ... [2024-10-24 05:09:07,837 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:09:07,984 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-46.i[919,932] [2024-10-24 05:09:08,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:09:08,059 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:09:08,069 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-46.i[919,932] [2024-10-24 05:09:08,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:09:08,110 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:09:08,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:08 WrapperNode [2024-10-24 05:09:08,110 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:09:08,111 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:09:08,111 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:09:08,111 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:09:08,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:08" (1/1) ... [2024-10-24 05:09:08,133 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:08" (1/1) ... [2024-10-24 05:09:08,157 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2024-10-24 05:09:08,158 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:09:08,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:09:08,158 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:09:08,158 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:09:08,167 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:08" (1/1) ... [2024-10-24 05:09:08,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:08" (1/1) ... [2024-10-24 05:09:08,171 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:08" (1/1) ... [2024-10-24 05:09:08,191 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 05:09:08,191 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:08" (1/1) ... [2024-10-24 05:09:08,192 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:08" (1/1) ... [2024-10-24 05:09:08,198 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:08" (1/1) ... [2024-10-24 05:09:08,201 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:08" (1/1) ... [2024-10-24 05:09:08,203 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:08" (1/1) ... [2024-10-24 05:09:08,204 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:08" (1/1) ... [2024-10-24 05:09:08,207 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:09:08,208 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:09:08,208 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:09:08,208 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:09:08,210 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:08" (1/1) ... [2024-10-24 05:09:08,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:09:08,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:09:08,240 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 05:09:08,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 05:09:08,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:09:08,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 05:09:08,278 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:09:08,278 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:09:08,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:09:08,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:09:08,361 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:09:08,363 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:09:21,095 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 05:09:21,096 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:09:21,158 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:09:21,158 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:09:21,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:09:21 BoogieIcfgContainer [2024-10-24 05:09:21,159 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:09:21,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:09:21,162 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:09:21,165 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:09:21,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:09:07" (1/3) ... [2024-10-24 05:09:21,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f6c9fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:09:21, skipping insertion in model container [2024-10-24 05:09:21,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:09:08" (2/3) ... [2024-10-24 05:09:21,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f6c9fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:09:21, skipping insertion in model container [2024-10-24 05:09:21,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:09:21" (3/3) ... [2024-10-24 05:09:21,168 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-46.i [2024-10-24 05:09:21,180 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:09:21,180 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:09:21,232 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:09:21,239 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;@24ac656a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:09:21,239 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:09:21,248 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 05:09:21,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 05:09:21,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:09:21,257 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:09:21,258 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:09:21,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:09:21,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1628079303, now seen corresponding path program 1 times [2024-10-24 05:09:21,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:09:21,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561965525] [2024-10-24 05:09:21,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:09:21,275 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:09:21,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:09:21,278 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:09:21,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 05:09:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:09:21,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 05:09:21,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:09:22,004 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-24 05:09:22,005 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:09:22,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:09:22,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561965525] [2024-10-24 05:09:22,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561965525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:09:22,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:09:22,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:09:22,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686501451] [2024-10-24 05:09:22,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:09:22,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:09:22,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:09:22,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:09:22,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:09:22,033 INFO L87 Difference]: Start difference. First operand has 52 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 05:09:26,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:09:26,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:09:26,317 INFO L93 Difference]: Finished difference Result 100 states and 179 transitions. [2024-10-24 05:09:26,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:09:26,399 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 116 [2024-10-24 05:09:26,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:09:26,404 INFO L225 Difference]: With dead ends: 100 [2024-10-24 05:09:26,404 INFO L226 Difference]: Without dead ends: 49 [2024-10-24 05:09:26,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:09:26,409 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-24 05:09:26,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-24 05:09:26,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-24 05:09:26,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-24 05:09:26,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-24 05:09:26,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 73 transitions. [2024-10-24 05:09:26,439 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 73 transitions. Word has length 116 [2024-10-24 05:09:26,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:09:26,440 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 73 transitions. [2024-10-24 05:09:26,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-24 05:09:26,440 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 73 transitions. [2024-10-24 05:09:26,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 05:09:26,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:09:26,443 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:09:26,464 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-10-24 05:09:26,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:09:26,645 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:09:26,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:09:26,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1518691168, now seen corresponding path program 1 times [2024-10-24 05:09:26,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:09:26,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1908428286] [2024-10-24 05:09:26,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:09:26,653 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:09:26,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:09:26,656 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:09:26,657 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