./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-51.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 4d0d9346d03692e5aa17dc110f0097921008598edde0d474bc7067d212c257c2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:28:30,377 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:28:30,470 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:28:30,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:28:30,479 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:28:30,517 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:28:30,518 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:28:30,518 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:28:30,519 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:28:30,520 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:28:30,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:28:30,521 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:28:30,522 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:28:30,524 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:28:30,524 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:28:30,524 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:28:30,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:28:30,525 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:28:30,525 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:28:30,526 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:28:30,526 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:28:30,529 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:28:30,529 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:28:30,530 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:28:30,530 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:28:30,530 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:28:30,530 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:28:30,531 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:28:30,531 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:28:30,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:28:30,531 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:28:30,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:28:30,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:28:30,532 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:28:30,532 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:28:30,533 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:28:30,533 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:28:30,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:28:30,534 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:28:30,534 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:28:30,535 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:28:30,535 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:28:30,536 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-clean/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-clean/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 -> 4d0d9346d03692e5aa17dc110f0097921008598edde0d474bc7067d212c257c2 [2024-10-11 11:28:30,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:28:30,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:28:30,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:28:30,808 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:28:30,808 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:28:30,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-51.i [2024-10-11 11:28:32,151 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:28:32,350 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:28:32,351 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-51.i [2024-10-11 11:28:32,359 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/39645c7c3/84a6d05703ed4874a2d705fba00c0aed/FLAG8377c9188 [2024-10-11 11:28:32,376 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/39645c7c3/84a6d05703ed4874a2d705fba00c0aed [2024-10-11 11:28:32,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:28:32,381 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:28:32,384 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:28:32,384 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:28:32,389 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:28:32,390 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:28:32" (1/1) ... [2024-10-11 11:28:32,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66362720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:28:32, skipping insertion in model container [2024-10-11 11:28:32,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:28:32" (1/1) ... [2024-10-11 11:28:32,417 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:28:32,602 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-51.i[915,928] [2024-10-11 11:28:32,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:28:32,668 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:28:32,681 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-51.i[915,928] [2024-10-11 11:28:32,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:28:32,715 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:28:32,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:28:32 WrapperNode [2024-10-11 11:28:32,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:28:32,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:28:32,717 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:28:32,717 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:28:32,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:28:32" (1/1) ... [2024-10-11 11:28:32,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:28:32" (1/1) ... [2024-10-11 11:28:32,750 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 99 [2024-10-11 11:28:32,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:28:32,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:28:32,752 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:28:32,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:28:32,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:28:32" (1/1) ... [2024-10-11 11:28:32,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:28:32" (1/1) ... [2024-10-11 11:28:32,765 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:28:32" (1/1) ... [2024-10-11 11:28:32,777 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:28:32,778 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:28:32" (1/1) ... [2024-10-11 11:28:32,778 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:28:32" (1/1) ... [2024-10-11 11:28:32,783 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:28:32" (1/1) ... [2024-10-11 11:28:32,786 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:28:32" (1/1) ... [2024-10-11 11:28:32,787 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:28:32" (1/1) ... [2024-10-11 11:28:32,788 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:28:32" (1/1) ... [2024-10-11 11:28:32,790 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:28:32,791 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:28:32,791 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:28:32,791 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:28:32,794 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:28:32" (1/1) ... [2024-10-11 11:28:32,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:28:32,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:28:32,827 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:28:32,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:28:32,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:28:32,875 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:28:32,875 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:28:32,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:28:32,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:28:32,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:28:32,952 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:28:32,954 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:28:33,220 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-11 11:28:33,220 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:28:33,283 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:28:33,283 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:28:33,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:28:33 BoogieIcfgContainer [2024-10-11 11:28:33,284 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:28:33,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:28:33,288 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:28:33,291 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:28:33,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:28:32" (1/3) ... [2024-10-11 11:28:33,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@690b0bfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:28:33, skipping insertion in model container [2024-10-11 11:28:33,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:28:32" (2/3) ... [2024-10-11 11:28:33,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@690b0bfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:28:33, skipping insertion in model container [2024-10-11 11:28:33,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:28:33" (3/3) ... [2024-10-11 11:28:33,296 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-51.i [2024-10-11 11:28:33,310 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:28:33,311 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:28:33,374 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:28:33,381 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;@1d161c0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:28:33,381 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:28:33,386 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 11:28:33,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 11:28:33,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:28:33,395 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:28:33,396 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:28:33,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:28:33,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1085182673, now seen corresponding path program 1 times [2024-10-11 11:28:33,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:28:33,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060491820] [2024-10-11 11:28:33,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:28:33,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:28:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:33,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:28:33,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:33,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:28:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:33,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:28:33,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:33,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:28:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:33,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 11:28:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:33,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:28:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:33,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:28:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:33,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:28:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:33,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:28:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:33,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:28:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:33,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:28:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:33,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:28:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:33,663 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 11:28:33,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:28:33,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060491820] [2024-10-11 11:28:33,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060491820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:28:33,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:28:33,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:28:33,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799539334] [2024-10-11 11:28:33,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:28:33,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:28:33,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:28:33,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:28:33,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:28:33,696 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 11:28:33,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:28:33,741 INFO L93 Difference]: Finished difference Result 75 states and 125 transitions. [2024-10-11 11:28:33,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:28:33,744 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 76 [2024-10-11 11:28:33,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:28:33,753 INFO L225 Difference]: With dead ends: 75 [2024-10-11 11:28:33,753 INFO L226 Difference]: Without dead ends: 36 [2024-10-11 11:28:33,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:28:33,762 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:28:33,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:28:33,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-11 11:28:33,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-11 11:28:33,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 11:28:33,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2024-10-11 11:28:33,812 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 76 [2024-10-11 11:28:33,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:28:33,814 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2024-10-11 11:28:33,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 11:28:33,815 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2024-10-11 11:28:33,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 11:28:33,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:28:33,818 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:28:33,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:28:33,821 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:28:33,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:28:33,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1668569621, now seen corresponding path program 1 times [2024-10-11 11:28:33,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:28:33,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807927625] [2024-10-11 11:28:33,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:28:33,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:28:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:28:34,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1058797980] [2024-10-11 11:28:34,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:28:34,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:28:34,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:28:34,053 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:28:34,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 11:28:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:28:34,215 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:28:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:28:34,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:28:34,311 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:28:34,312 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:28:34,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 11:28:34,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:28:34,519 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-11 11:28:34,583 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:28:34,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:28:34 BoogieIcfgContainer [2024-10-11 11:28:34,590 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:28:34,591 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:28:34,591 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:28:34,591 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:28:34,592 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:28:33" (3/4) ... [2024-10-11 11:28:34,594 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:28:34,595 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:28:34,596 INFO L158 Benchmark]: Toolchain (without parser) took 2214.69ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 97.6MB in the beginning and 149.1MB in the end (delta: -51.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:28:34,597 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 169.9MB. Free memory was 131.0MB in the beginning and 130.9MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:28:34,598 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.78ms. Allocated memory is still 169.9MB. Free memory was 97.4MB in the beginning and 135.0MB in the end (delta: -37.6MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2024-10-11 11:28:34,601 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.52ms. Allocated memory is still 169.9MB. Free memory was 135.0MB in the beginning and 133.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 11:28:34,602 INFO L158 Benchmark]: Boogie Preprocessor took 38.52ms. Allocated memory is still 169.9MB. Free memory was 133.0MB in the beginning and 130.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 11:28:34,602 INFO L158 Benchmark]: RCFGBuilder took 493.11ms. Allocated memory is still 169.9MB. Free memory was 130.3MB in the beginning and 112.0MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 11:28:34,603 INFO L158 Benchmark]: TraceAbstraction took 1302.50ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 112.0MB in the beginning and 149.1MB in the end (delta: -37.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:28:34,603 INFO L158 Benchmark]: Witness Printer took 4.60ms. Allocated memory is still 205.5MB. Free memory is still 149.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:28:34,606 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.17ms. Allocated memory is still 169.9MB. Free memory was 131.0MB in the beginning and 130.9MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.78ms. Allocated memory is still 169.9MB. Free memory was 97.4MB in the beginning and 135.0MB in the end (delta: -37.6MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.52ms. Allocated memory is still 169.9MB. Free memory was 135.0MB in the beginning and 133.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.52ms. Allocated memory is still 169.9MB. Free memory was 133.0MB in the beginning and 130.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 493.11ms. Allocated memory is still 169.9MB. Free memory was 130.3MB in the beginning and 112.0MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1302.50ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 112.0MB in the beginning and 149.1MB in the end (delta: -37.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.60ms. Allocated memory is still 205.5MB. Free memory is still 149.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 85. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 10.8; [L23] unsigned char var_1_2 = 0; [L24] signed short int var_1_5 = -16; [L25] double var_1_6 = 100.01; [L26] unsigned short int var_1_7 = 50; [L27] signed short int var_1_8 = 5; [L28] unsigned short int var_1_9 = 256; [L29] signed long int var_1_10 = -100; [L30] unsigned long int var_1_12 = 10000000; [L31] unsigned short int var_1_13 = 2; [L32] unsigned short int var_1_14 = 4; [L33] double var_1_15 = 4.5; [L89] isInitial = 1 [L90] FCALL initially() [L91] int k_loop; [L92] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L92] COND TRUE k_loop < 1 [L93] FCALL updateLastVariables() [L94] CALL updateVariables() [L63] var_1_2 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L64] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L65] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L65] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L66] var_1_5 = __VERIFIER_nondet_short() [L67] CALL assume_abort_if_not(var_1_5 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-32768, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-32768, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L67] RET assume_abort_if_not(var_1_5 >= -32768) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-32768, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L68] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-32768, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-32768, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L68] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-32768, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L69] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-32768, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-32768, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L69] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-32768, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L70] var_1_6 = __VERIFIER_nondet_double() [L71] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-32768, var_1_7=50, var_1_8=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-32768, var_1_7=50, var_1_8=5, var_1_9=256] [L71] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-32768, var_1_7=50, var_1_8=5, var_1_9=256] [L72] var_1_8 = __VERIFIER_nondet_short() [L73] CALL assume_abort_if_not(var_1_8 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-32768, var_1_7=50, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-32768, var_1_7=50, var_1_8=0, var_1_9=256] [L73] RET assume_abort_if_not(var_1_8 >= -32767) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-32768, var_1_7=50, var_1_8=0, var_1_9=256] [L74] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-32768, var_1_7=50, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-32768, var_1_7=50, var_1_8=0, var_1_9=256] [L74] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-32768, var_1_7=50, var_1_8=0, var_1_9=256] [L75] var_1_9 = __VERIFIER_nondet_ushort() [L76] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-32768, var_1_7=50, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-32768, var_1_7=50, var_1_8=0] [L76] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-32768, var_1_7=50, var_1_8=0] [L77] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-32768, var_1_7=50, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-32768, var_1_7=50, var_1_8=0, var_1_9=1] [L77] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-32768, var_1_7=50, var_1_8=0, var_1_9=1] [L78] var_1_14 = __VERIFIER_nondet_ushort() [L79] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-32768, var_1_7=50, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-32768, var_1_7=50, var_1_8=0, var_1_9=1] [L79] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-32768, var_1_7=50, var_1_8=0, var_1_9=1] [L80] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=0, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-32768, var_1_7=50, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=0, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-32768, var_1_7=50, var_1_8=0, var_1_9=1] [L80] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=0, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-32768, var_1_7=50, var_1_8=0, var_1_9=1] [L94] RET updateVariables() [L95] CALL step() [L37] COND TRUE ! (var_1_5 >= ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8)))) [L38] var_1_7 = (var_1_9 + 1) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=0, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-32768, var_1_7=2, var_1_8=0, var_1_9=1] [L40] var_1_12 = var_1_9 [L41] var_1_13 = var_1_14 [L42] var_1_15 = var_1_6 [L43] unsigned long int stepLocal_0 = var_1_12; VAL [isInitial=1, stepLocal_0=1, var_1_10=-100, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=54/5, var_1_2=0, var_1_5=-32768, var_1_6=2, var_1_7=2, var_1_8=0, var_1_9=1] [L44] COND FALSE !(\read(var_1_2)) [L51] var_1_1 = var_1_6 VAL [isInitial=1, stepLocal_0=1, var_1_10=-100, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=2, var_1_2=0, var_1_5=-32768, var_1_6=2, var_1_7=2, var_1_8=0, var_1_9=1] [L53] unsigned char stepLocal_1 = (var_1_6 * var_1_15) >= var_1_1; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=0, var_1_10=-100, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=2, var_1_2=0, var_1_5=-32768, var_1_6=2, var_1_7=2, var_1_8=0, var_1_9=1] [L54] COND FALSE !(stepLocal_1 || var_1_2) [L59] var_1_10 = -1 VAL [isInitial=1, stepLocal_0=1, var_1_10=-1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=2, var_1_2=0, var_1_5=-32768, var_1_6=2, var_1_7=2, var_1_8=0, var_1_9=1] [L95] RET step() [L96] CALL, EXPR property() [L85-L86] return (((((var_1_2 ? ((var_1_12 >= (var_1_12 / var_1_5)) ? (var_1_1 == ((double) ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))) : (var_1_1 == ((double) var_1_6))) : (var_1_1 == ((double) var_1_6))) && ((! (var_1_5 >= ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) ? (var_1_7 == ((unsigned short int) (var_1_9 + 1))) : 1)) && ((((var_1_6 * var_1_15) >= var_1_1) || var_1_2) ? ((var_1_6 <= var_1_1) ? (var_1_10 == ((signed long int) var_1_9)) : 1) : (var_1_10 == ((signed long int) -1)))) && (var_1_12 == ((unsigned long int) var_1_9))) && (var_1_13 == ((unsigned short int) var_1_14))) && (var_1_15 == ((double) var_1_6)) ; [L96] RET, EXPR property() [L96] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=2, var_1_2=0, var_1_5=-32768, var_1_6=2, var_1_7=2, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=-1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=2, var_1_2=0, var_1_5=-32768, var_1_6=2, var_1_7=2, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 12, 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, 49 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 49 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 75 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 264/264 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 11:28:34,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-51.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 4d0d9346d03692e5aa17dc110f0097921008598edde0d474bc7067d212c257c2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:28:36,756 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:28:36,834 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:28:36,841 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:28:36,842 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:28:36,880 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:28:36,881 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:28:36,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:28:36,882 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:28:36,883 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:28:36,883 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:28:36,884 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:28:36,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:28:36,885 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:28:36,885 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:28:36,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:28:36,886 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:28:36,886 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:28:36,886 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:28:36,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:28:36,887 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:28:36,892 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:28:36,892 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:28:36,892 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:28:36,892 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:28:36,893 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:28:36,893 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:28:36,893 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:28:36,893 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:28:36,893 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:28:36,894 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:28:36,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:28:36,894 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:28:36,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:28:36,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:28:36,895 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:28:36,897 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:28:36,897 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:28:36,898 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:28:36,898 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:28:36,898 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:28:36,899 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:28:36,899 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:28:36,899 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:28:36,899 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:28:36,899 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-clean/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-clean/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 -> 4d0d9346d03692e5aa17dc110f0097921008598edde0d474bc7067d212c257c2 [2024-10-11 11:28:37,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:28:37,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:28:37,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:28:37,247 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:28:37,248 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:28:37,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-51.i [2024-10-11 11:28:38,776 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:28:39,000 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:28:39,001 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-51.i [2024-10-11 11:28:39,017 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/30e600cd3/9c62a2f896a047d9a0f1b33721c1fbfe/FLAGde7971923 [2024-10-11 11:28:39,032 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/30e600cd3/9c62a2f896a047d9a0f1b33721c1fbfe [2024-10-11 11:28:39,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:28:39,036 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:28:39,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:28:39,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:28:39,045 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:28:39,046 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:28:39" (1/1) ... [2024-10-11 11:28:39,047 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f33cd28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:28:39, skipping insertion in model container [2024-10-11 11:28:39,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:28:39" (1/1) ... [2024-10-11 11:28:39,075 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:28:39,238 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-51.i[915,928] [2024-10-11 11:28:39,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:28:39,300 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:28:39,313 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-51.i[915,928] [2024-10-11 11:28:39,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:28:39,357 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:28:39,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:28:39 WrapperNode [2024-10-11 11:28:39,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:28:39,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:28:39,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:28:39,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:28:39,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:28:39" (1/1) ... [2024-10-11 11:28:39,377 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:28:39" (1/1) ... [2024-10-11 11:28:39,402 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 97 [2024-10-11 11:28:39,404 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:28:39,405 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:28:39,406 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:28:39,406 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:28:39,416 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:28:39" (1/1) ... [2024-10-11 11:28:39,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:28:39" (1/1) ... [2024-10-11 11:28:39,420 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:28:39" (1/1) ... [2024-10-11 11:28:39,437 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:28:39,441 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:28:39" (1/1) ... [2024-10-11 11:28:39,441 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:28:39" (1/1) ... [2024-10-11 11:28:39,451 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:28:39" (1/1) ... [2024-10-11 11:28:39,458 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:28:39" (1/1) ... [2024-10-11 11:28:39,462 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:28:39" (1/1) ... [2024-10-11 11:28:39,463 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:28:39" (1/1) ... [2024-10-11 11:28:39,469 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:28:39,475 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:28:39,475 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:28:39,475 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:28:39,476 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:28:39" (1/1) ... [2024-10-11 11:28:39,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:28:39,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:28:39,511 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:28:39,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:28:39,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:28:39,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:28:39,553 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:28:39,553 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:28:39,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:28:39,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:28:39,627 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:28:39,629 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:28:44,048 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-11 11:28:44,049 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:28:44,107 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:28:44,107 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:28:44,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:28:44 BoogieIcfgContainer [2024-10-11 11:28:44,108 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:28:44,110 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:28:44,110 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:28:44,114 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:28:44,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:28:39" (1/3) ... [2024-10-11 11:28:44,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da4ad8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:28:44, skipping insertion in model container [2024-10-11 11:28:44,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:28:39" (2/3) ... [2024-10-11 11:28:44,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da4ad8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:28:44, skipping insertion in model container [2024-10-11 11:28:44,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:28:44" (3/3) ... [2024-10-11 11:28:44,119 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-51.i [2024-10-11 11:28:44,152 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:28:44,152 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:28:44,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:28:44,227 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;@112fbff8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:28:44,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:28:44,232 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 11:28:44,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 11:28:44,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:28:44,242 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:28:44,243 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:28:44,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:28:44,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1085182673, now seen corresponding path program 1 times [2024-10-11 11:28:44,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:28:44,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1790963171] [2024-10-11 11:28:44,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:28:44,266 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:28:44,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:28:44,270 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:28:44,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 11:28:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:44,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:28:44,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:28:44,606 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-10-11 11:28:44,606 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:28:44,607 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:28:44,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1790963171] [2024-10-11 11:28:44,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1790963171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:28:44,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:28:44,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:28:44,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982603715] [2024-10-11 11:28:44,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:28:44,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:28:44,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:28:44,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:28:44,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:28:44,641 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 11:28:46,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:28:46,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:28:46,226 INFO L93 Difference]: Finished difference Result 75 states and 125 transitions. [2024-10-11 11:28:46,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:28:46,229 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 76 [2024-10-11 11:28:46,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:28:46,237 INFO L225 Difference]: With dead ends: 75 [2024-10-11 11:28:46,237 INFO L226 Difference]: Without dead ends: 36 [2024-10-11 11:28:46,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:28:46,244 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 11:28:46,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 11:28:46,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-11 11:28:46,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-11 11:28:46,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 11:28:46,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2024-10-11 11:28:46,284 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 76 [2024-10-11 11:28:46,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:28:46,284 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2024-10-11 11:28:46,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 11:28:46,284 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2024-10-11 11:28:46,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 11:28:46,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:28:46,287 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:28:46,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 11:28:46,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:28:46,489 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:28:46,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:28:46,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1668569621, now seen corresponding path program 1 times [2024-10-11 11:28:46,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:28:46,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474914362] [2024-10-11 11:28:46,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:28:46,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:28:46,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:28:46,494 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:28:46,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 11:28:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:28:46,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 11:28:46,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:29:19,352 WARN L286 SmtUtils]: Spent 5.59s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-11 11:30:05,124 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)