./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-77.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-77.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 80d0dbd642f174f1d467e22c7cd881540a5b30cdbb6826a74a2a8a7b559c2f1a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:24:24,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:24:24,377 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 05:24:24,382 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:24:24,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:24:24,407 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:24:24,408 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:24:24,408 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:24:24,409 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:24:24,412 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:24:24,412 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:24:24,412 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:24:24,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:24:24,413 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:24:24,413 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:24:24,413 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:24:24,413 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:24:24,415 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:24:24,415 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 05:24:24,415 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:24:24,415 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:24:24,416 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:24:24,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:24:24,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:24:24,416 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:24:24,416 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:24:24,417 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:24:24,417 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:24:24,417 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:24:24,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:24:24,417 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:24:24,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:24:24,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:24:24,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:24:24,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:24:24,419 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:24:24,419 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 05:24:24,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 05:24:24,420 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:24:24,420 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:24:24,420 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:24:24,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:24:24,421 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 -> 80d0dbd642f174f1d467e22c7cd881540a5b30cdbb6826a74a2a8a7b559c2f1a [2024-11-12 05:24:24,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:24:24,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:24:24,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:24:24,680 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:24:24,681 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:24:24,682 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-77.i [2024-11-12 05:24:25,949 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:24:26,126 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:24:26,126 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-77.i [2024-11-12 05:24:26,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0b124524/850e467080074f1b8db5b6603ff15353/FLAGe941759eb [2024-11-12 05:24:26,144 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0b124524/850e467080074f1b8db5b6603ff15353 [2024-11-12 05:24:26,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:24:26,147 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:24:26,152 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:24:26,152 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:24:26,156 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:24:26,157 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:24:26" (1/1) ... [2024-11-12 05:24:26,158 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bd0054e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:26, skipping insertion in model container [2024-11-12 05:24:26,158 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:24:26" (1/1) ... [2024-11-12 05:24:26,181 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:24:26,348 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-77.i[915,928] [2024-11-12 05:24:26,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:24:26,387 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:24:26,396 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-77.i[915,928] [2024-11-12 05:24:26,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:24:26,441 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:24:26,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:26 WrapperNode [2024-11-12 05:24:26,441 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:24:26,442 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:24:26,442 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:24:26,442 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:24:26,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:26" (1/1) ... [2024-11-12 05:24:26,455 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:26" (1/1) ... [2024-11-12 05:24:26,481 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2024-11-12 05:24:26,485 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:24:26,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:24:26,486 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:24:26,486 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:24:26,494 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:26" (1/1) ... [2024-11-12 05:24:26,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:26" (1/1) ... [2024-11-12 05:24:26,497 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:26" (1/1) ... [2024-11-12 05:24:26,516 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 05:24:26,516 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:26" (1/1) ... [2024-11-12 05:24:26,516 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:26" (1/1) ... [2024-11-12 05:24:26,522 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:26" (1/1) ... [2024-11-12 05:24:26,525 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:26" (1/1) ... [2024-11-12 05:24:26,530 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:26" (1/1) ... [2024-11-12 05:24:26,531 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:26" (1/1) ... [2024-11-12 05:24:26,533 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:24:26,533 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:24:26,534 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:24:26,534 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:24:26,534 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:26" (1/1) ... [2024-11-12 05:24:26,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:24:26,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:24:26,566 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:24:26,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:24:26,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:24:26,607 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:24:26,607 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:24:26,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 05:24:26,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:24:26,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:24:26,681 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:24:26,685 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:24:26,900 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-12 05:24:26,900 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:24:26,914 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:24:26,914 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:24:26,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:24:26 BoogieIcfgContainer [2024-11-12 05:24:26,914 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:24:26,916 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:24:26,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:24:26,918 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:24:26,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:24:26" (1/3) ... [2024-11-12 05:24:26,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52396aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:24:26, skipping insertion in model container [2024-11-12 05:24:26,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:26" (2/3) ... [2024-11-12 05:24:26,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52396aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:24:26, skipping insertion in model container [2024-11-12 05:24:26,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:24:26" (3/3) ... [2024-11-12 05:24:26,921 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-77.i [2024-11-12 05:24:26,935 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:24:26,935 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:24:26,986 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:24:26,991 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;@4fe20735, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:24:26,991 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:24:26,994 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 05:24:27,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-12 05:24:27,001 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:24:27,005 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:24:27,005 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:24:27,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:24:27,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1832740109, now seen corresponding path program 1 times [2024-11-12 05:24:27,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:24:27,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141738218] [2024-11-12 05:24:27,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:24:27,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:24:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:27,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:24:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:27,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:24:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:27,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:24:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:27,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:24:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:27,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:24:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:27,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:24:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:27,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:24:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:27,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:24:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:27,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:24:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:27,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 05:24:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:27,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 05:24:27,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:27,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 05:24:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:27,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 05:24:27,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:27,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 05:24:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:27,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 05:24:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:27,289 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 05:24:27,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:24:27,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141738218] [2024-11-12 05:24:27,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141738218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:24:27,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:24:27,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:24:27,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831939993] [2024-11-12 05:24:27,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:24:27,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:24:27,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:24:27,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:24:27,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:24:27,324 INFO L87 Difference]: Start difference. First operand has 50 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 05:24:27,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:24:27,345 INFO L93 Difference]: Finished difference Result 97 states and 154 transitions. [2024-11-12 05:24:27,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:24:27,348 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 98 [2024-11-12 05:24:27,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:24:27,355 INFO L225 Difference]: With dead ends: 97 [2024-11-12 05:24:27,355 INFO L226 Difference]: Without dead ends: 46 [2024-11-12 05:24:27,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:24:27,361 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:24:27,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:24:27,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-12 05:24:27,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-12 05:24:27,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 05:24:27,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2024-11-12 05:24:27,394 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 98 [2024-11-12 05:24:27,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:24:27,395 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2024-11-12 05:24:27,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 05:24:27,395 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2024-11-12 05:24:27,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-12 05:24:27,398 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:24:27,398 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:24:27,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 05:24:27,399 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:24:27,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:24:27,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1678042361, now seen corresponding path program 1 times [2024-11-12 05:24:27,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:24:27,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472689139] [2024-11-12 05:24:27,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:24:27,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:24:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:24:27,564 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 05:24:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:24:27,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 05:24:27,647 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 05:24:27,648 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 05:24:27,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 05:24:27,654 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-12 05:24:27,724 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 05:24:27,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:24:27 BoogieIcfgContainer [2024-11-12 05:24:27,728 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 05:24:27,728 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 05:24:27,729 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 05:24:27,729 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 05:24:27,729 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:24:26" (3/4) ... [2024-11-12 05:24:27,731 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 05:24:27,732 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 05:24:27,733 INFO L158 Benchmark]: Toolchain (without parser) took 1585.59ms. Allocated memory is still 151.0MB. Free memory was 83.1MB in the beginning and 102.5MB in the end (delta: -19.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:24:27,734 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 107.0MB. Free memory is still 68.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:24:27,734 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.90ms. Allocated memory is still 151.0MB. Free memory was 82.8MB in the beginning and 112.8MB in the end (delta: -30.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 05:24:27,735 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.09ms. Allocated memory is still 151.0MB. Free memory was 112.8MB in the beginning and 109.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 05:24:27,735 INFO L158 Benchmark]: Boogie Preprocessor took 47.03ms. Allocated memory is still 151.0MB. Free memory was 109.7MB in the beginning and 105.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 05:24:27,735 INFO L158 Benchmark]: RCFGBuilder took 381.00ms. Allocated memory is still 151.0MB. Free memory was 105.5MB in the beginning and 88.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 05:24:27,737 INFO L158 Benchmark]: TraceAbstraction took 812.02ms. Allocated memory is still 151.0MB. Free memory was 87.7MB in the beginning and 102.5MB in the end (delta: -14.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:24:27,737 INFO L158 Benchmark]: Witness Printer took 3.92ms. Allocated memory is still 151.0MB. Free memory is still 102.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:24:27,739 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.14ms. Allocated memory is still 107.0MB. Free memory is still 68.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.90ms. Allocated memory is still 151.0MB. Free memory was 82.8MB in the beginning and 112.8MB in the end (delta: -30.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.09ms. Allocated memory is still 151.0MB. Free memory was 112.8MB in the beginning and 109.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.03ms. Allocated memory is still 151.0MB. Free memory was 109.7MB in the beginning and 105.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 381.00ms. Allocated memory is still 151.0MB. Free memory was 105.5MB in the beginning and 88.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 812.02ms. Allocated memory is still 151.0MB. Free memory was 87.7MB in the beginning and 102.5MB in the end (delta: -14.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.92ms. Allocated memory is still 151.0MB. Free memory is still 102.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someUnaryFLOAToperation at line 40. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 50; [L23] unsigned short int var_1_4 = 60871; [L24] unsigned short int var_1_5 = 1; [L25] unsigned short int var_1_6 = 28896; [L26] unsigned short int var_1_7 = 5; [L27] float var_1_8 = 63.8; [L28] float var_1_9 = 49.5; [L29] float var_1_10 = 31.875; [L30] float var_1_11 = 255.25; [L31] unsigned short int var_1_12 = 0; [L32] unsigned char var_1_13 = 0; [L33] unsigned char var_1_14 = 1; [L34] float var_1_16 = 0.8; [L35] unsigned short int var_1_17 = 64; VAL [isInitial=0, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=60871, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L92] isInitial = 1 [L93] FCALL initially() [L94] int k_loop; [L95] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=60871, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L95] COND TRUE k_loop < 1 [L96] FCALL updateLastVariables() [L97] CALL updateVariables() [L60] var_1_4 = __VERIFIER_nondet_ushort() [L61] CALL assume_abort_if_not(var_1_4 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L61] RET assume_abort_if_not(var_1_4 >= 32767) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L62] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L62] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L63] var_1_5 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L64] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L65] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L65] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L66] var_1_6 = __VERIFIER_nondet_ushort() [L67] CALL assume_abort_if_not(var_1_6 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L67] RET assume_abort_if_not(var_1_6 >= 16383) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L68] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L68] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L69] var_1_7 = __VERIFIER_nondet_ushort() [L70] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_8=319/5, var_1_9=99/2] [L70] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_8=319/5, var_1_9=99/2] [L71] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=16383, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=16383, var_1_8=319/5, var_1_9=99/2] [L71] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=16383, var_1_8=319/5, var_1_9=99/2] [L72] var_1_9 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L73] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L74] var_1_10 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L75] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L76] var_1_11 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L77] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L78] var_1_13 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L79] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_12=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L80] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L80] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L81] var_1_14 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=-256, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=-256, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L82] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_12=0, var_1_13=-256, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L83] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L83] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L97] RET updateVariables() [L98] CALL step() [L39] COND TRUE var_1_7 > var_1_5 [L40] var_1_8 = ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) VAL [isInitial=1, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=16383, var_1_8=60876, var_1_9=60876] [L44] var_1_16 = var_1_11 [L45] var_1_17 = var_1_5 VAL [isInitial=1, var_1_11=60877, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_16=60877, var_1_17=-49183, var_1_1=50, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=16383, var_1_8=60876, var_1_9=60876] [L46] COND TRUE var_1_8 != var_1_16 [L47] var_1_1 = (var_1_4 - ((((var_1_5) < ((var_1_6 - var_1_7))) ? (var_1_5) : ((var_1_6 - var_1_7))))) VAL [isInitial=1, var_1_11=60877, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_16=60877, var_1_17=-49183, var_1_1=16414, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=16383, var_1_8=60876, var_1_9=60876] [L49] unsigned char stepLocal_1 = var_1_13; [L50] signed long int stepLocal_0 = (((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)); VAL [isInitial=1, stepLocal_0=16353, stepLocal_1=-256, var_1_11=60877, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_16=60877, var_1_17=-49183, var_1_1=16414, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=16383, var_1_8=60876, var_1_9=60876] [L51] COND FALSE !(stepLocal_1 && var_1_14) [L56] var_1_12 = 64 VAL [isInitial=1, stepLocal_0=16353, var_1_11=60877, var_1_12=64, var_1_13=-256, var_1_14=1, var_1_16=60877, var_1_17=-49183, var_1_1=16414, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=16383, var_1_8=60876, var_1_9=60876] [L98] RET step() [L99] CALL, EXPR property() [L88-L89] return (((((var_1_8 != var_1_16) ? (var_1_1 == ((unsigned short int) (var_1_4 - ((((var_1_5) < ((var_1_6 - var_1_7))) ? (var_1_5) : ((var_1_6 - var_1_7))))))) : 1) && ((var_1_7 > var_1_5) ? (var_1_8 == ((float) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) : (var_1_8 == ((float) (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - 1.6f))))) && ((var_1_13 && var_1_14) ? ((((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))) < ((((32) > ((var_1_1 - var_1_7))) ? (32) : ((var_1_1 - var_1_7))))) ? (var_1_12 == ((unsigned short int) (var_1_7 + 5))) : 1) : (var_1_12 == ((unsigned short int) 64)))) && (var_1_16 == ((float) var_1_11))) && (var_1_17 == ((unsigned short int) var_1_5)) ; VAL [\result=0, isInitial=1, var_1_11=60877, var_1_12=64, var_1_13=-256, var_1_14=1, var_1_16=60877, var_1_17=-49183, var_1_1=16414, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=16383, var_1_8=60876, var_1_9=60876] [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=60877, var_1_12=64, var_1_13=-256, var_1_14=1, var_1_16=60877, var_1_17=-49183, var_1_1=16414, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=16383, var_1_8=60876, var_1_9=60876] [L19] reach_error() VAL [isInitial=1, var_1_11=60877, var_1_12=64, var_1_13=-256, var_1_14=1, var_1_16=60877, var_1_17=-49183, var_1_1=16414, var_1_4=-1071677441, var_1_5=-49183, var_1_6=32737, var_1_7=16383, var_1_8=60876, var_1_9=60876] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 15, 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, 68 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 68 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred 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.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 196 NumberOfCodeBlocks, 196 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 97 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 420/420 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 05:24:27,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-77.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 80d0dbd642f174f1d467e22c7cd881540a5b30cdbb6826a74a2a8a7b559c2f1a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:24:29,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:24:29,850 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 05:24:29,856 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:24:29,857 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:24:29,882 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:24:29,882 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:24:29,882 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:24:29,883 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:24:29,883 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:24:29,883 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:24:29,883 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:24:29,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:24:29,884 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:24:29,884 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:24:29,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:24:29,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:24:29,888 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:24:29,888 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:24:29,888 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:24:29,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:24:29,892 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:24:29,892 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:24:29,892 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 05:24:29,893 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 05:24:29,893 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:24:29,893 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 05:24:29,893 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:24:29,893 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:24:29,893 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:24:29,893 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:24:29,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:24:29,894 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:24:29,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:24:29,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:24:29,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:24:29,894 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:24:29,894 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:24:29,895 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 05:24:29,895 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 05:24:29,895 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:24:29,901 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:24:29,901 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:24:29,901 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:24:29,901 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 -> 80d0dbd642f174f1d467e22c7cd881540a5b30cdbb6826a74a2a8a7b559c2f1a [2024-11-12 05:24:30,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:24:30,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:24:30,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:24:30,224 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:24:30,225 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:24:30,226 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-77.i [2024-11-12 05:24:31,595 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:24:31,765 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:24:31,766 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-77.i [2024-11-12 05:24:31,773 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74a61e193/fed0f62d217640c6b66267bad5096351/FLAGa1f5ddc50 [2024-11-12 05:24:31,785 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74a61e193/fed0f62d217640c6b66267bad5096351 [2024-11-12 05:24:31,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:24:31,788 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:24:31,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:24:31,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:24:31,793 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:24:31,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:24:31" (1/1) ... [2024-11-12 05:24:31,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1374679d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:31, skipping insertion in model container [2024-11-12 05:24:31,794 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:24:31" (1/1) ... [2024-11-12 05:24:31,812 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:24:31,948 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-77.i[915,928] [2024-11-12 05:24:32,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:24:32,015 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:24:32,027 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-77.i[915,928] [2024-11-12 05:24:32,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:24:32,086 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:24:32,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:32 WrapperNode [2024-11-12 05:24:32,087 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:24:32,088 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:24:32,088 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:24:32,088 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:24:32,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:32" (1/1) ... [2024-11-12 05:24:32,109 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:32" (1/1) ... [2024-11-12 05:24:32,137 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2024-11-12 05:24:32,140 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:24:32,141 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:24:32,141 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:24:32,141 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:24:32,150 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:32" (1/1) ... [2024-11-12 05:24:32,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:32" (1/1) ... [2024-11-12 05:24:32,155 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:32" (1/1) ... [2024-11-12 05:24:32,174 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 05:24:32,175 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:32" (1/1) ... [2024-11-12 05:24:32,175 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:32" (1/1) ... [2024-11-12 05:24:32,181 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:32" (1/1) ... [2024-11-12 05:24:32,188 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:32" (1/1) ... [2024-11-12 05:24:32,190 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:32" (1/1) ... [2024-11-12 05:24:32,192 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:32" (1/1) ... [2024-11-12 05:24:32,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:24:32,202 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:24:32,202 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:24:32,202 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:24:32,203 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:32" (1/1) ... [2024-11-12 05:24:32,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:24:32,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:24:32,235 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:24:32,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:24:32,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:24:32,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 05:24:32,273 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:24:32,273 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:24:32,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:24:32,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:24:32,334 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:24:32,336 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:24:32,644 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-12 05:24:32,644 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:24:32,657 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:24:32,657 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:24:32,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:24:32 BoogieIcfgContainer [2024-11-12 05:24:32,658 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:24:32,659 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:24:32,659 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:24:32,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:24:32,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:24:31" (1/3) ... [2024-11-12 05:24:32,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@775ed82f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:24:32, skipping insertion in model container [2024-11-12 05:24:32,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:24:32" (2/3) ... [2024-11-12 05:24:32,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@775ed82f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:24:32, skipping insertion in model container [2024-11-12 05:24:32,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:24:32" (3/3) ... [2024-11-12 05:24:32,665 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-77.i [2024-11-12 05:24:32,678 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:24:32,678 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:24:32,728 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:24:32,732 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;@1c0c52d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:24:32,732 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:24:32,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 05:24:32,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-12 05:24:32,748 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:24:32,749 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:24:32,749 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:24:32,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:24:32,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1832740109, now seen corresponding path program 1 times [2024-11-12 05:24:32,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:24:32,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467297619] [2024-11-12 05:24:32,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:24:32,777 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:24:32,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:24:32,782 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:24:32,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 05:24:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:32,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 05:24:32,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:24:33,003 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-12 05:24:33,004 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:24:33,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:24:33,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467297619] [2024-11-12 05:24:33,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1467297619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:24:33,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:24:33,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:24:33,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543582923] [2024-11-12 05:24:33,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:24:33,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:24:33,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:24:33,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:24:33,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:24:33,036 INFO L87 Difference]: Start difference. First operand has 50 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 05:24:33,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:24:33,060 INFO L93 Difference]: Finished difference Result 97 states and 154 transitions. [2024-11-12 05:24:33,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:24:33,063 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 98 [2024-11-12 05:24:33,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:24:33,069 INFO L225 Difference]: With dead ends: 97 [2024-11-12 05:24:33,070 INFO L226 Difference]: Without dead ends: 46 [2024-11-12 05:24:33,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:24:33,075 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:24:33,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:24:33,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-12 05:24:33,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-12 05:24:33,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 05:24:33,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2024-11-12 05:24:33,114 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 98 [2024-11-12 05:24:33,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:24:33,115 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2024-11-12 05:24:33,116 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 05:24:33,116 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2024-11-12 05:24:33,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-12 05:24:33,121 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:24:33,122 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:24:33,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 05:24:33,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:24:33,324 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:24:33,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:24:33,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1678042361, now seen corresponding path program 1 times [2024-11-12 05:24:33,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:24:33,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477802004] [2024-11-12 05:24:33,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:24:33,326 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:24:33,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:24:33,329 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:24:33,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 05:24:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:24:33,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-12 05:24:33,516 INFO L279 TraceCheckSpWp]: Computing forward predicates...