./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_normal_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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_normal_file-17.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 3c9817d9968452d1361a56af62fb626e41d77a4f0cc22e579efdac17c2ac50b5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:58:44,123 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:58:44,177 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 23:58:44,181 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:58:44,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:58:44,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:58:44,209 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:58:44,209 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:58:44,210 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:58:44,210 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:58:44,210 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:58:44,211 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:58:44,211 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:58:44,212 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:58:44,212 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:58:44,212 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:58:44,212 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:58:44,213 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 23:58:44,213 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 23:58:44,213 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 23:58:44,213 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:58:44,214 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:58:44,214 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:58:44,214 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:58:44,215 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:58:44,215 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 23:58:44,215 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:58:44,215 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:58:44,216 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:58:44,216 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:58:44,216 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:58:44,216 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:58:44,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:58:44,217 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:58:44,217 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:58:44,217 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:58:44,217 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 23:58:44,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 23:58:44,218 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:58:44,218 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:58:44,218 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:58:44,219 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:58:44,219 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 -> 3c9817d9968452d1361a56af62fb626e41d77a4f0cc22e579efdac17c2ac50b5 [2024-10-12 23:58:44,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:58:44,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:58:44,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:58:44,464 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:58:44,464 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:58:44,465 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-17.i [2024-10-12 23:58:45,826 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:58:46,002 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:58:46,003 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-17.i [2024-10-12 23:58:46,013 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1309700f5/f2b8439362574f2ea8c8e02694e7d5e5/FLAGc36e64e34 [2024-10-12 23:58:46,387 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1309700f5/f2b8439362574f2ea8c8e02694e7d5e5 [2024-10-12 23:58:46,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:58:46,391 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:58:46,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:58:46,392 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:58:46,397 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:58:46,397 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:58:46" (1/1) ... [2024-10-12 23:58:46,398 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b770480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:58:46, skipping insertion in model container [2024-10-12 23:58:46,398 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:58:46" (1/1) ... [2024-10-12 23:58:46,419 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:58:46,579 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_normal_file-17.i[913,926] [2024-10-12 23:58:46,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:58:46,656 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:58:46,665 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_normal_file-17.i[913,926] [2024-10-12 23:58:46,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:58:46,706 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:58:46,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:58:46 WrapperNode [2024-10-12 23:58:46,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:58:46,711 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:58:46,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:58:46,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:58:46,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:58:46" (1/1) ... [2024-10-12 23:58:46,731 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:58:46" (1/1) ... [2024-10-12 23:58:46,764 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2024-10-12 23:58:46,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:58:46,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:58:46,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:58:46,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:58:46,778 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:58:46" (1/1) ... [2024-10-12 23:58:46,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:58:46" (1/1) ... [2024-10-12 23:58:46,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:58:46" (1/1) ... [2024-10-12 23:58:46,803 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-12 23:58:46,807 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:58:46" (1/1) ... [2024-10-12 23:58:46,807 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:58:46" (1/1) ... [2024-10-12 23:58:46,822 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:58:46" (1/1) ... [2024-10-12 23:58:46,825 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:58:46" (1/1) ... [2024-10-12 23:58:46,829 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:58:46" (1/1) ... [2024-10-12 23:58:46,834 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:58:46" (1/1) ... [2024-10-12 23:58:46,841 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:58:46,842 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:58:46,842 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:58:46,842 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:58:46,843 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:58:46" (1/1) ... [2024-10-12 23:58:46,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:58:46,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:58:46,891 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-12 23:58:46,895 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-12 23:58:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:58:46,940 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 23:58:46,940 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 23:58:46,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 23:58:46,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:58:46,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:58:47,011 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:58:47,013 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:58:47,311 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-12 23:58:47,312 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:58:47,349 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:58:47,349 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:58:47,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:58:47 BoogieIcfgContainer [2024-10-12 23:58:47,350 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:58:47,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:58:47,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:58:47,354 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:58:47,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:58:46" (1/3) ... [2024-10-12 23:58:47,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e91ca1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:58:47, skipping insertion in model container [2024-10-12 23:58:47,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:58:46" (2/3) ... [2024-10-12 23:58:47,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e91ca1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:58:47, skipping insertion in model container [2024-10-12 23:58:47,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:58:47" (3/3) ... [2024-10-12 23:58:47,357 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-17.i [2024-10-12 23:58:47,370 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:58:47,371 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:58:47,427 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:58:47,433 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;@622bd605, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:58:47,433 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:58:47,441 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 45 states have (on average 1.488888888888889) internal successors, (67), 46 states have internal predecessors, (67), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-12 23:58:47,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-12 23:58:47,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:58:47,455 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:58:47,455 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:58:47,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:58:47,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1524283683, now seen corresponding path program 1 times [2024-10-12 23:58:47,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:58:47,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366350548] [2024-10-12 23:58:47,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:58:47,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:58:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:58:47,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:58:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:58:47,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:58:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:58:47,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:58:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:58:47,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:58:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:58:47,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:58:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:58:47,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:58:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:58:47,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:58:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:58:47,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:58:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:58:47,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:58:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:58:47,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:58:47,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:58:47,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:58:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:58:47,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 23:58:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:58:47,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 23:58:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:58:47,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 23:58:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:58:47,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 23:58:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:58:47,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 23:58:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:58:47,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 23:58:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:58:47,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 23:58:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:58:47,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 23:58:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:58:47,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 23:58:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:58:47,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-12 23:58:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:58:47,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 23:58:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:58:47,861 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-12 23:58:47,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:58:47,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366350548] [2024-10-12 23:58:47,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366350548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:58:47,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:58:47,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 23:58:47,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734981487] [2024-10-12 23:58:47,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:58:47,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 23:58:47,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:58:47,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 23:58:47,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 23:58:47,895 INFO L87 Difference]: Start difference. First operand has 70 states, 45 states have (on average 1.488888888888889) internal successors, (67), 46 states have internal predecessors, (67), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-12 23:58:47,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:58:47,934 INFO L93 Difference]: Finished difference Result 137 states and 242 transitions. [2024-10-12 23:58:47,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 23:58:47,938 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 135 [2024-10-12 23:58:47,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:58:47,945 INFO L225 Difference]: With dead ends: 137 [2024-10-12 23:58:47,946 INFO L226 Difference]: Without dead ends: 68 [2024-10-12 23:58:47,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 23:58:47,952 INFO L432 NwaCegarLoop]: 103 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, 103 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-12 23:58:47,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:58:47,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-12 23:58:48,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-12 23:58:48,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 44 states have internal predecessors, (62), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-12 23:58:48,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 106 transitions. [2024-10-12 23:58:48,025 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 106 transitions. Word has length 135 [2024-10-12 23:58:48,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:58:48,025 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 106 transitions. [2024-10-12 23:58:48,025 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-12 23:58:48,026 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 106 transitions. [2024-10-12 23:58:48,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-12 23:58:48,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:58:48,031 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:58:48,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 23:58:48,032 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:58:48,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:58:48,033 INFO L85 PathProgramCache]: Analyzing trace with hash 2082239007, now seen corresponding path program 1 times [2024-10-12 23:58:48,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:58:48,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129426883] [2024-10-12 23:58:48,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:58:48,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:58:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:58:48,272 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 23:58:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:58:48,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 23:58:48,467 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 23:58:48,470 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 23:58:48,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 23:58:48,475 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-12 23:58:48,567 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 23:58:48,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 11:58:48 BoogieIcfgContainer [2024-10-12 23:58:48,571 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 23:58:48,572 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 23:58:48,572 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 23:58:48,572 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 23:58:48,572 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:58:47" (3/4) ... [2024-10-12 23:58:48,574 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 23:58:48,577 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 23:58:48,577 INFO L158 Benchmark]: Toolchain (without parser) took 2186.19ms. Allocated memory was 161.5MB in the beginning and 216.0MB in the end (delta: 54.5MB). Free memory was 89.9MB in the beginning and 136.8MB in the end (delta: -46.9MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2024-10-12 23:58:48,578 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 161.5MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:58:48,579 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.34ms. Allocated memory is still 161.5MB. Free memory was 89.7MB in the beginning and 127.7MB in the end (delta: -38.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-12 23:58:48,579 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.98ms. Allocated memory is still 161.5MB. Free memory was 127.7MB in the beginning and 124.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 23:58:48,581 INFO L158 Benchmark]: Boogie Preprocessor took 76.40ms. Allocated memory is still 161.5MB. Free memory was 124.6MB in the beginning and 119.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 23:58:48,581 INFO L158 Benchmark]: RCFGBuilder took 507.96ms. Allocated memory is still 161.5MB. Free memory was 119.4MB in the beginning and 92.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-12 23:58:48,582 INFO L158 Benchmark]: TraceAbstraction took 1220.12ms. Allocated memory was 161.5MB in the beginning and 216.0MB in the end (delta: 54.5MB). Free memory was 92.1MB in the beginning and 136.8MB in the end (delta: -44.7MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2024-10-12 23:58:48,582 INFO L158 Benchmark]: Witness Printer took 4.99ms. Allocated memory is still 216.0MB. Free memory is still 136.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:58:48,584 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.11ms. Allocated memory is still 161.5MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 318.34ms. Allocated memory is still 161.5MB. Free memory was 89.7MB in the beginning and 127.7MB in the end (delta: -38.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.98ms. Allocated memory is still 161.5MB. Free memory was 127.7MB in the beginning and 124.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.40ms. Allocated memory is still 161.5MB. Free memory was 124.6MB in the beginning and 119.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 507.96ms. Allocated memory is still 161.5MB. Free memory was 119.4MB in the beginning and 92.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1220.12ms. Allocated memory was 161.5MB in the beginning and 216.0MB in the end (delta: 54.5MB). Free memory was 92.1MB in the beginning and 136.8MB in the end (delta: -44.7MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Witness Printer took 4.99ms. Allocated memory is still 216.0MB. Free memory is still 136.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 121. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 25; [L23] unsigned char var_1_2 = 25; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_4 = 0; [L26] signed long int var_1_5 = 4; [L27] unsigned char var_1_6 = 1; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 1; [L30] unsigned char var_1_9 = 0; [L31] unsigned char var_1_10 = 0; [L32] double var_1_11 = 7.3; [L33] double var_1_12 = 1.25; [L34] double var_1_13 = 128.8; [L35] signed char var_1_14 = -1; [L36] signed char var_1_15 = 10; [L37] signed short int var_1_16 = 8; [L38] signed short int var_1_17 = 10; [L39] unsigned long int var_1_18 = 128; [L40] unsigned long int var_1_19 = 3963666122; [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] FCALL updateLastVariables() [L129] CALL updateVariables() [L83] var_1_2 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L84] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L85] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L86] var_1_3 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_4=0, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_4=0, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L87] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_4=0, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L88] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=0, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=0, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L88] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=0, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L89] var_1_4 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L90] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L91] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L92] var_1_6 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L93] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L94] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L95] var_1_7 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_8=1, var_1_9=0] [L96] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_8=1, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=0] [L97] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=0] [L98] var_1_9 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L99] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L100] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L100] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L101] var_1_10 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L102] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L103] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L103] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L104] var_1_12 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L105] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L106] var_1_13 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L107] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L108] var_1_15 = __VERIFIER_nondet_char() [L109] CALL assume_abort_if_not(var_1_15 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L109] RET assume_abort_if_not(var_1_15 >= -127) VAL [isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L110] CALL assume_abort_if_not(var_1_15 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L110] RET assume_abort_if_not(var_1_15 <= 126) VAL [isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=10, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L111] var_1_17 = __VERIFIER_nondet_short() [L112] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=0, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=0, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L112] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=0, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L113] CALL assume_abort_if_not(var_1_17 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=0, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=0, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L113] RET assume_abort_if_not(var_1_17 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=0, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L114] var_1_19 = __VERIFIER_nondet_ulong() [L115] CALL assume_abort_if_not(var_1_19 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=0, var_1_18=128, var_1_19=4294967294, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=0, var_1_18=128, var_1_19=4294967294, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L115] RET assume_abort_if_not(var_1_19 >= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=0, var_1_18=128, var_1_19=4294967294, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L116] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=0, var_1_18=128, var_1_19=4294967294, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=0, var_1_18=128, var_1_19=4294967294, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L116] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=0, var_1_18=128, var_1_19=4294967294, var_1_1=25, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L129] RET updateVariables() [L130] CALL step() [L44] var_1_1 = (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))) VAL [isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=0, var_1_18=128, var_1_19=4294967294, var_1_1=50, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L45] COND FALSE !(var_1_6 && var_1_7) VAL [isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=0, var_1_18=128, var_1_19=4294967294, var_1_1=50, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L52] COND TRUE var_1_1 < var_1_3 [L53] var_1_8 = ((var_1_7 || (var_1_6 || var_1_9)) && var_1_10) VAL [isInitial=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=0, var_1_18=128, var_1_19=4294967294, var_1_1=50, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L57] COND TRUE var_1_4 == (8 + var_1_1) [L58] var_1_11 = ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))) VAL [isInitial=1, var_1_10=1, var_1_11=4294967299, var_1_12=4294967299, var_1_13=4294967299, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=0, var_1_18=128, var_1_19=4294967294, var_1_1=50, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L60] COND FALSE !((64.4f + 1.5f) <= var_1_13) VAL [isInitial=1, var_1_10=1, var_1_11=4294967299, var_1_12=4294967299, var_1_13=4294967299, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=0, var_1_18=128, var_1_19=4294967294, var_1_1=50, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L65] COND FALSE !(var_1_12 >= 9.6) VAL [isInitial=1, var_1_10=1, var_1_11=4294967299, var_1_12=4294967299, var_1_13=4294967299, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=0, var_1_18=128, var_1_19=4294967294, var_1_1=50, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L76] COND TRUE (var_1_9 && var_1_6) || (var_1_7 && var_1_10) [L77] var_1_18 = (var_1_19 - (((((1991720936u - var_1_17)) < (var_1_2)) ? ((1991720936u - var_1_17)) : (var_1_2)))) VAL [isInitial=1, var_1_10=1, var_1_11=4294967299, var_1_12=4294967299, var_1_13=4294967299, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=0, var_1_18=4294967294, var_1_19=4294967294, var_1_1=50, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR (((((var_1_1 == ((unsigned char) (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))))) && ((var_1_6 && var_1_7) ? (var_1_7 ? (var_1_5 == ((signed long int) (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))))) : (var_1_5 == ((signed long int) 8))) : 1)) && ((var_1_1 < var_1_3) ? (var_1_8 == ((unsigned char) ((var_1_7 || (var_1_6 || var_1_9)) && var_1_10))) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_4 == (8 + var_1_1)) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (((64.4f + 1.5f) <= var_1_13) ? ((var_1_5 >= var_1_4) ? (var_1_14 == ((signed char) var_1_15)) : 1) : 1)) && ((var_1_12 >= 9.6) ? (var_1_10 ? (var_1_16 == ((signed short int) (2 - var_1_17))) : (((var_1_1 * (var_1_15 & var_1_17)) <= var_1_3) ? (var_1_16 == ((signed short int) var_1_1)) : (var_1_16 == ((signed short int) var_1_4)))) : 1) VAL [isInitial=1, var_1_10=1, var_1_11=4294967299, var_1_12=4294967299, var_1_13=4294967299, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=0, var_1_18=4294967294, var_1_19=4294967294, var_1_1=50, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L121-L122] return ((((((var_1_1 == ((unsigned char) (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))))) && ((var_1_6 && var_1_7) ? (var_1_7 ? (var_1_5 == ((signed long int) (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))))) : (var_1_5 == ((signed long int) 8))) : 1)) && ((var_1_1 < var_1_3) ? (var_1_8 == ((unsigned char) ((var_1_7 || (var_1_6 || var_1_9)) && var_1_10))) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_4 == (8 + var_1_1)) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (((64.4f + 1.5f) <= var_1_13) ? ((var_1_5 >= var_1_4) ? (var_1_14 == ((signed char) var_1_15)) : 1) : 1)) && ((var_1_12 >= 9.6) ? (var_1_10 ? (var_1_16 == ((signed short int) (2 - var_1_17))) : (((var_1_1 * (var_1_15 & var_1_17)) <= var_1_3) ? (var_1_16 == ((signed short int) var_1_1)) : (var_1_16 == ((signed short int) var_1_4)))) : 1)) && (((var_1_9 && var_1_6) || (var_1_7 && var_1_10)) ? (var_1_18 == ((unsigned long int) (var_1_19 - (((((1991720936u - var_1_17)) < (var_1_2)) ? ((1991720936u - var_1_17)) : (var_1_2)))))) : (var_1_18 == ((unsigned long int) var_1_2))) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=4294967299, var_1_12=4294967299, var_1_13=4294967299, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=0, var_1_18=4294967294, var_1_19=4294967294, var_1_1=50, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=4294967299, var_1_12=4294967299, var_1_13=4294967299, var_1_14=-1, var_1_15=-127, var_1_16=8, var_1_17=0, var_1_18=4294967294, var_1_19=4294967294, var_1_1=50, var_1_2=0, var_1_3=58, var_1_4=58, var_1_5=4, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 2, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 103 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 103 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 270 NumberOfCodeBlocks, 270 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 134 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 924/924 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-12 23:58:48,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-17.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 3c9817d9968452d1361a56af62fb626e41d77a4f0cc22e579efdac17c2ac50b5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:58:50,690 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:58:50,763 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-12 23:58:50,768 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:58:50,770 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:58:50,792 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:58:50,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:58:50,796 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:58:50,797 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:58:50,797 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:58:50,797 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:58:50,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:58:50,798 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:58:50,798 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:58:50,798 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:58:50,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:58:50,799 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:58:50,799 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 23:58:50,799 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 23:58:50,799 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:58:50,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:58:50,803 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:58:50,803 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:58:50,803 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-12 23:58:50,803 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-12 23:58:50,804 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:58:50,806 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-12 23:58:50,806 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 23:58:50,807 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:58:50,807 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:58:50,807 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:58:50,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:58:50,807 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:58:50,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:58:50,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:58:50,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:58:50,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:58:50,808 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:58:50,808 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-12 23:58:50,808 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-12 23:58:50,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:58:50,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:58:50,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:58:50,809 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:58:50,809 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-12 23:58:50,810 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 -> 3c9817d9968452d1361a56af62fb626e41d77a4f0cc22e579efdac17c2ac50b5 [2024-10-12 23:58:51,079 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:58:51,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:58:51,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:58:51,111 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:58:51,111 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:58:51,113 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-17.i [2024-10-12 23:58:52,563 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:58:52,788 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:58:52,792 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-17.i [2024-10-12 23:58:52,800 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccf91ed85/e761da99a60049af99c8aadd6364a272/FLAGf7683567d [2024-10-12 23:58:53,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccf91ed85/e761da99a60049af99c8aadd6364a272 [2024-10-12 23:58:53,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:58:53,137 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:58:53,138 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:58:53,138 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:58:53,142 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:58:53,143 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:58:53" (1/1) ... [2024-10-12 23:58:53,143 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@171efc8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:58:53, skipping insertion in model container [2024-10-12 23:58:53,144 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:58:53" (1/1) ... [2024-10-12 23:58:53,173 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:58:53,348 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_normal_file-17.i[913,926] [2024-10-12 23:58:53,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:58:53,438 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:58:53,454 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_normal_file-17.i[913,926] [2024-10-12 23:58:53,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:58:53,512 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:58:53,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:58:53 WrapperNode [2024-10-12 23:58:53,513 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:58:53,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:58:53,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:58:53,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:58:53,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:58:53" (1/1) ... [2024-10-12 23:58:53,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:58:53" (1/1) ... [2024-10-12 23:58:53,562 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2024-10-12 23:58:53,563 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:58:53,563 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:58:53,563 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:58:53,563 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:58:53,572 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:58:53" (1/1) ... [2024-10-12 23:58:53,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:58:53" (1/1) ... [2024-10-12 23:58:53,577 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:58:53" (1/1) ... [2024-10-12 23:58:53,593 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-12 23:58:53,596 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:58:53" (1/1) ... [2024-10-12 23:58:53,599 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:58:53" (1/1) ... [2024-10-12 23:58:53,606 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:58:53" (1/1) ... [2024-10-12 23:58:53,613 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:58:53" (1/1) ... [2024-10-12 23:58:53,618 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:58:53" (1/1) ... [2024-10-12 23:58:53,622 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:58:53" (1/1) ... [2024-10-12 23:58:53,624 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:58:53,627 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:58:53,627 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:58:53,627 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:58:53,628 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:58:53" (1/1) ... [2024-10-12 23:58:53,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:58:53,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:58:53,660 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-12 23:58:53,668 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-12 23:58:53,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:58:53,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-12 23:58:53,708 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 23:58:53,708 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 23:58:53,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:58:53,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:58:53,790 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:58:53,792 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:58:54,414 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-12 23:58:54,414 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:58:54,469 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:58:54,469 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:58:54,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:58:54 BoogieIcfgContainer [2024-10-12 23:58:54,470 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:58:54,472 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:58:54,472 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:58:54,474 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:58:54,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:58:53" (1/3) ... [2024-10-12 23:58:54,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@567605cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:58:54, skipping insertion in model container [2024-10-12 23:58:54,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:58:53" (2/3) ... [2024-10-12 23:58:54,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@567605cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:58:54, skipping insertion in model container [2024-10-12 23:58:54,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:58:54" (3/3) ... [2024-10-12 23:58:54,476 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-17.i [2024-10-12 23:58:54,490 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:58:54,490 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:58:54,554 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:58:54,560 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;@6614be90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:58:54,560 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:58:54,565 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 32 states have (on average 1.46875) internal successors, (47), 33 states have internal predecessors, (47), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-12 23:58:54,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-12 23:58:54,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:58:54,580 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:58:54,580 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:58:54,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:58:54,587 INFO L85 PathProgramCache]: Analyzing trace with hash -841840719, now seen corresponding path program 1 times [2024-10-12 23:58:54,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:58:54,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184877733] [2024-10-12 23:58:54,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:58:54,603 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-12 23:58:54,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:58:54,610 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-12 23:58:54,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-12 23:58:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:58:54,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-12 23:58:54,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:58:54,863 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2024-10-12 23:58:54,863 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 23:58:54,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:58:54,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [184877733] [2024-10-12 23:58:54,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [184877733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:58:54,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:58:54,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 23:58:54,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016955013] [2024-10-12 23:58:54,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:58:54,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 23:58:54,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:58:54,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 23:58:54,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 23:58:54,918 INFO L87 Difference]: Start difference. First operand has 57 states, 32 states have (on average 1.46875) internal successors, (47), 33 states have internal predecessors, (47), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-12 23:58:55,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:58:55,107 INFO L93 Difference]: Finished difference Result 111 states and 202 transitions. [2024-10-12 23:58:55,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 23:58:55,116 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 133 [2024-10-12 23:58:55,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:58:55,122 INFO L225 Difference]: With dead ends: 111 [2024-10-12 23:58:55,122 INFO L226 Difference]: Without dead ends: 55 [2024-10-12 23:58:55,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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-12 23:58:55,127 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 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.2s IncrementalHoareTripleChecker+Time [2024-10-12 23:58:55,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 23:58:55,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-12 23:58:55,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-12 23:58:55,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-12 23:58:55,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 86 transitions. [2024-10-12 23:58:55,158 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 86 transitions. Word has length 133 [2024-10-12 23:58:55,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:58:55,159 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 86 transitions. [2024-10-12 23:58:55,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-12 23:58:55,159 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 86 transitions. [2024-10-12 23:58:55,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-12 23:58:55,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:58:55,162 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:58:55,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-12 23:58:55,365 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-12 23:58:55,366 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:58:55,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:58:55,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1692815277, now seen corresponding path program 1 times [2024-10-12 23:58:55,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:58:55,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193632392] [2024-10-12 23:58:55,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:58:55,368 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-12 23:58:55,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:58:55,370 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-12 23:58:55,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-12 23:58:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:58:55,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-12 23:58:55,561 INFO L278 TraceCheckSpWp]: Computing forward predicates...