./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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-97.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 0daba001bb4159e329ea4e02bf43fad28551c83f8164fe6d87ea605497512373 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 22:50:21,680 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 22:50:21,751 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 22:50:21,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 22:50:21,759 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 22:50:21,797 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 22:50:21,798 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 22:50:21,798 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 22:50:21,799 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 22:50:21,799 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 22:50:21,799 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 22:50:21,800 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 22:50:21,800 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 22:50:21,801 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 22:50:21,801 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 22:50:21,801 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 22:50:21,802 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 22:50:21,802 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 22:50:21,802 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 22:50:21,803 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 22:50:21,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 22:50:21,803 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 22:50:21,804 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 22:50:21,804 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 22:50:21,804 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 22:50:21,805 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 22:50:21,805 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 22:50:21,805 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 22:50:21,806 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 22:50:21,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 22:50:21,806 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 22:50:21,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 22:50:21,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:50:21,807 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 22:50:21,807 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 22:50:21,808 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 22:50:21,808 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 22:50:21,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 22:50:21,808 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 22:50:21,808 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 22:50:21,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 22:50:21,809 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 22:50:21,810 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0daba001bb4159e329ea4e02bf43fad28551c83f8164fe6d87ea605497512373 [2024-11-18 22:50:22,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 22:50:22,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 22:50:22,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 22:50:22,138 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 22:50:22,139 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 22:50:22,140 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-97.i [2024-11-18 22:50:23,579 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 22:50:23,805 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 22:50:23,806 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-97.i [2024-11-18 22:50:23,815 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3a09446b/e52bc3212bac44709fc151a5465a2b80/FLAG5d9fbe43f [2024-11-18 22:50:24,186 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3a09446b/e52bc3212bac44709fc151a5465a2b80 [2024-11-18 22:50:24,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 22:50:24,189 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 22:50:24,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 22:50:24,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 22:50:24,196 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 22:50:24,197 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:50:24" (1/1) ... [2024-11-18 22:50:24,197 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f1dd38d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:24, skipping insertion in model container [2024-11-18 22:50:24,198 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:50:24" (1/1) ... [2024-11-18 22:50:24,223 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 22:50:24,400 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-97.i[915,928] [2024-11-18 22:50:24,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:50:24,451 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 22:50:24,465 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-97.i[915,928] [2024-11-18 22:50:24,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:50:24,523 INFO L204 MainTranslator]: Completed translation [2024-11-18 22:50:24,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:24 WrapperNode [2024-11-18 22:50:24,524 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 22:50:24,525 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 22:50:24,525 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 22:50:24,525 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 22:50:24,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:24" (1/1) ... [2024-11-18 22:50:24,540 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:24" (1/1) ... [2024-11-18 22:50:24,564 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2024-11-18 22:50:24,565 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 22:50:24,565 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 22:50:24,566 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 22:50:24,566 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 22:50:24,575 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:24" (1/1) ... [2024-11-18 22:50:24,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:24" (1/1) ... [2024-11-18 22:50:24,578 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:24" (1/1) ... [2024-11-18 22:50:24,590 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-18 22:50:24,590 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:24" (1/1) ... [2024-11-18 22:50:24,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:24" (1/1) ... [2024-11-18 22:50:24,596 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:24" (1/1) ... [2024-11-18 22:50:24,603 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:24" (1/1) ... [2024-11-18 22:50:24,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:24" (1/1) ... [2024-11-18 22:50:24,610 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:24" (1/1) ... [2024-11-18 22:50:24,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 22:50:24,616 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 22:50:24,616 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 22:50:24,616 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 22:50:24,617 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:24" (1/1) ... [2024-11-18 22:50:24,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:50:24,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:50:24,652 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-18 22:50:24,659 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-18 22:50:24,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 22:50:24,702 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 22:50:24,702 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 22:50:24,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 22:50:24,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 22:50:24,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 22:50:24,813 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 22:50:24,820 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 22:50:25,085 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-18 22:50:25,086 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 22:50:25,099 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 22:50:25,099 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 22:50:25,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:50:25 BoogieIcfgContainer [2024-11-18 22:50:25,100 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 22:50:25,102 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 22:50:25,102 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 22:50:25,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 22:50:25,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:50:24" (1/3) ... [2024-11-18 22:50:25,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50d94959 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:50:25, skipping insertion in model container [2024-11-18 22:50:25,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:24" (2/3) ... [2024-11-18 22:50:25,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50d94959 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:50:25, skipping insertion in model container [2024-11-18 22:50:25,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:50:25" (3/3) ... [2024-11-18 22:50:25,109 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-97.i [2024-11-18 22:50:25,123 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 22:50:25,123 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 22:50:25,176 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 22:50:25,183 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;@417ee8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 22:50:25,183 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 22:50:25,187 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-18 22:50:25,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-18 22:50:25,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:50:25,197 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:50:25,198 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:50:25,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:50:25,202 INFO L85 PathProgramCache]: Analyzing trace with hash 149025103, now seen corresponding path program 1 times [2024-11-18 22:50:25,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:50:25,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416831503] [2024-11-18 22:50:25,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:50:25,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:50:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:50:25,491 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-18 22:50:25,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:50:25,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416831503] [2024-11-18 22:50:25,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416831503] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:50:25,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774758534] [2024-11-18 22:50:25,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:50:25,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:50:25,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:50:25,497 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 22:50:25,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 22:50:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:50:25,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 22:50:25,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:50:25,683 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-18 22:50:25,685 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:50:25,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774758534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:50:25,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 22:50:25,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 22:50:25,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724649278] [2024-11-18 22:50:25,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:50:25,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 22:50:25,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:50:25,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 22:50:25,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:50:25,724 INFO L87 Difference]: Start difference. First operand has 62 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-18 22:50:25,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:50:25,753 INFO L93 Difference]: Finished difference Result 120 states and 195 transitions. [2024-11-18 22:50:25,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 22:50:25,755 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2024-11-18 22:50:25,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:50:25,761 INFO L225 Difference]: With dead ends: 120 [2024-11-18 22:50:25,761 INFO L226 Difference]: Without dead ends: 57 [2024-11-18 22:50:25,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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-18 22:50:25,767 INFO L432 NwaCegarLoop]: 86 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, 86 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-18 22:50:25,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:50:25,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-18 22:50:25,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-18 22:50:25,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-18 22:50:25,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 82 transitions. [2024-11-18 22:50:25,808 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 82 transitions. Word has length 103 [2024-11-18 22:50:25,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:50:25,808 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 82 transitions. [2024-11-18 22:50:25,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-18 22:50:25,809 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 82 transitions. [2024-11-18 22:50:25,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-18 22:50:25,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:50:25,812 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:50:25,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 22:50:26,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-18 22:50:26,014 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:50:26,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:50:26,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1693551379, now seen corresponding path program 1 times [2024-11-18 22:50:26,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:50:26,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875765397] [2024-11-18 22:50:26,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:50:26,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:50:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:50:26,490 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-18 22:50:26,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:50:26,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875765397] [2024-11-18 22:50:26,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875765397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:50:26,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:50:26,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 22:50:26,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332612753] [2024-11-18 22:50:26,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:50:26,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 22:50:26,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:50:26,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 22:50:26,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 22:50:26,495 INFO L87 Difference]: Start difference. First operand 57 states and 82 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 22:50:26,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:50:26,561 INFO L93 Difference]: Finished difference Result 134 states and 193 transitions. [2024-11-18 22:50:26,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 22:50:26,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2024-11-18 22:50:26,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:50:26,564 INFO L225 Difference]: With dead ends: 134 [2024-11-18 22:50:26,564 INFO L226 Difference]: Without dead ends: 80 [2024-11-18 22:50:26,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 22:50:26,566 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 28 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:50:26,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 248 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:50:26,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-18 22:50:26,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 65. [2024-11-18 22:50:26,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-18 22:50:26,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 95 transitions. [2024-11-18 22:50:26,588 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 95 transitions. Word has length 103 [2024-11-18 22:50:26,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:50:26,590 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 95 transitions. [2024-11-18 22:50:26,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 22:50:26,590 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 95 transitions. [2024-11-18 22:50:26,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-18 22:50:26,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:50:26,595 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:50:26,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 22:50:26,595 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:50:26,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:50:26,597 INFO L85 PathProgramCache]: Analyzing trace with hash 2076335929, now seen corresponding path program 1 times [2024-11-18 22:50:26,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:50:26,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134580986] [2024-11-18 22:50:26,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:50:26,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:50:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:50:26,861 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-18 22:50:26,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:50:26,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134580986] [2024-11-18 22:50:26,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134580986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:50:26,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:50:26,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 22:50:26,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058686475] [2024-11-18 22:50:26,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:50:26,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 22:50:26,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:50:26,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 22:50:26,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-18 22:50:26,866 INFO L87 Difference]: Start difference. First operand 65 states and 95 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 22:50:26,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:50:26,956 INFO L93 Difference]: Finished difference Result 144 states and 207 transitions. [2024-11-18 22:50:26,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 22:50:26,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2024-11-18 22:50:26,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:50:26,962 INFO L225 Difference]: With dead ends: 144 [2024-11-18 22:50:26,962 INFO L226 Difference]: Without dead ends: 82 [2024-11-18 22:50:26,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-18 22:50:26,967 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 50 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 22:50:26,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 259 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 22:50:26,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-18 22:50:26,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 68. [2024-11-18 22:50:26,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-18 22:50:26,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2024-11-18 22:50:26,980 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 96 transitions. Word has length 104 [2024-11-18 22:50:26,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:50:26,981 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 96 transitions. [2024-11-18 22:50:26,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-18 22:50:26,981 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 96 transitions. [2024-11-18 22:50:26,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-18 22:50:26,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:50:26,984 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:50:26,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 22:50:26,985 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:50:26,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:50:26,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1053122318, now seen corresponding path program 1 times [2024-11-18 22:50:26,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:50:26,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705950455] [2024-11-18 22:50:26,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:50:26,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:50:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 22:50:27,054 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 22:50:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 22:50:27,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 22:50:27,136 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 22:50:27,137 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 22:50:27,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 22:50:27,145 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-18 22:50:27,236 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 22:50:27,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:50:27 BoogieIcfgContainer [2024-11-18 22:50:27,242 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 22:50:27,242 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 22:50:27,243 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 22:50:27,243 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 22:50:27,243 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:50:25" (3/4) ... [2024-11-18 22:50:27,246 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 22:50:27,247 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 22:50:27,248 INFO L158 Benchmark]: Toolchain (without parser) took 3058.44ms. Allocated memory was 165.7MB in the beginning and 230.7MB in the end (delta: 65.0MB). Free memory was 130.7MB in the beginning and 112.2MB in the end (delta: 18.5MB). Peak memory consumption was 80.3MB. Max. memory is 16.1GB. [2024-11-18 22:50:27,249 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 165.7MB. Free memory was 128.6MB in the beginning and 128.4MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 22:50:27,251 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.82ms. Allocated memory is still 165.7MB. Free memory was 130.7MB in the beginning and 117.0MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 22:50:27,251 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.96ms. Allocated memory is still 165.7MB. Free memory was 116.3MB in the beginning and 114.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 22:50:27,252 INFO L158 Benchmark]: Boogie Preprocessor took 47.14ms. Allocated memory is still 165.7MB. Free memory was 114.2MB in the beginning and 112.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 22:50:27,252 INFO L158 Benchmark]: RCFGBuilder took 484.22ms. Allocated memory is still 165.7MB. Free memory was 112.1MB in the beginning and 126.1MB in the end (delta: -14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-18 22:50:27,252 INFO L158 Benchmark]: TraceAbstraction took 2140.00ms. Allocated memory was 165.7MB in the beginning and 230.7MB in the end (delta: 65.0MB). Free memory was 125.0MB in the beginning and 113.3MB in the end (delta: 11.8MB). Peak memory consumption was 77.8MB. Max. memory is 16.1GB. [2024-11-18 22:50:27,252 INFO L158 Benchmark]: Witness Printer took 4.86ms. Allocated memory is still 230.7MB. Free memory was 113.3MB in the beginning and 112.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 22:50:27,257 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.20ms. Allocated memory is still 165.7MB. Free memory was 128.6MB in the beginning and 128.4MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.82ms. Allocated memory is still 165.7MB. Free memory was 130.7MB in the beginning and 117.0MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.96ms. Allocated memory is still 165.7MB. Free memory was 116.3MB in the beginning and 114.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.14ms. Allocated memory is still 165.7MB. Free memory was 114.2MB in the beginning and 112.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 484.22ms. Allocated memory is still 165.7MB. Free memory was 112.1MB in the beginning and 126.1MB in the end (delta: -14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2140.00ms. Allocated memory was 165.7MB in the beginning and 230.7MB in the end (delta: 65.0MB). Free memory was 125.0MB in the beginning and 113.3MB in the end (delta: 11.8MB). Peak memory consumption was 77.8MB. Max. memory is 16.1GB. * Witness Printer took 4.86ms. Allocated memory is still 230.7MB. Free memory was 113.3MB in the beginning and 112.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryArithmeticFLOAToperation at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_6 = 1; [L25] signed short int var_1_7 = 32; [L26] signed short int var_1_8 = 20113; [L27] signed short int var_1_9 = 100; [L28] signed char var_1_10 = 100; [L29] signed char var_1_11 = -1; [L30] signed char var_1_12 = 16; [L31] float var_1_13 = 1.2; [L32] float var_1_14 = 3.6; [L33] float var_1_15 = 5.5; [L34] signed char last_1_var_1_10 = 100; VAL [isInitial=0, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=1, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L97] isInitial = 1 [L98] FCALL initially() [L99] int k_loop; [L100] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=1, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L100] COND TRUE k_loop < 1 [L101] CALL updateLastVariables() [L90] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=1, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L101] RET updateLastVariables() [L102] 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, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L64] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L65] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L65] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L66] var_1_6 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_7=32, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_7=32, var_1_8=20113, var_1_9=100] [L67] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_7=32, var_1_8=20113, var_1_9=100] [L68] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L68] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=32, var_1_8=20113, var_1_9=100] [L69] var_1_7 = __VERIFIER_nondet_short() [L70] CALL assume_abort_if_not(var_1_7 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=20113, var_1_9=100] [L70] RET assume_abort_if_not(var_1_7 >= -1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=20113, var_1_9=100] [L71] CALL assume_abort_if_not(var_1_7 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=20113, var_1_9=100] [L71] RET assume_abort_if_not(var_1_7 <= 32766) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=20113, var_1_9=100] [L72] var_1_8 = __VERIFIER_nondet_short() [L73] CALL assume_abort_if_not(var_1_8 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=100] [L73] RET assume_abort_if_not(var_1_8 >= 16383) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=100] [L74] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=100] [L74] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=100] [L75] var_1_9 = __VERIFIER_nondet_short() [L76] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L76] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L77] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L77] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L78] var_1_11 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L79] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L80] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L80] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=16, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L81] var_1_12 = __VERIFIER_nondet_char() [L82] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L82] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L83] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L83] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_14=18/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L84] var_1_14 = __VERIFIER_nondet_float() [L85] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L85] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_15=11/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L86] var_1_15 = __VERIFIER_nondet_float() [L87] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L87] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L102] RET updateVariables() [L103] CALL step() [L38] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L49] COND TRUE var_1_1 == var_1_7 [L50] var_1_10 = (var_1_11 + (var_1_12 + -25)) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-1, var_1_11=55, var_1_12=-31, var_1_13=6/5, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L56] COND TRUE \read(var_1_6) [L57] var_1_13 = ((((16.3f) < ((((((var_1_14 - 1.875f)) > (63.5f)) ? ((var_1_14 - 1.875f)) : (63.5f))))) ? (16.3f) : ((((((var_1_14 - 1.875f)) > (63.5f)) ? ((var_1_14 - 1.875f)) : (63.5f)))))) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-1, var_1_11=55, var_1_12=-31, var_1_13=127/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L103] RET step() [L104] CALL, EXPR property() [L93] EXPR (var_1_2 ? ((last_1_var_1_10 > last_1_var_1_10) ? (var_1_6 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) last_1_var_1_10))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_1 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : (((100 | var_1_1) >= var_1_7) ? (var_1_10 == ((signed char) var_1_11)) : 1)) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-1, var_1_11=55, var_1_12=-31, var_1_13=127/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L93] EXPR (var_1_1 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : (((100 | var_1_1) >= var_1_7) ? (var_1_10 == ((signed char) var_1_11)) : 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-1, var_1_11=55, var_1_12=-31, var_1_13=127/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L93] EXPR (var_1_2 ? ((last_1_var_1_10 > last_1_var_1_10) ? (var_1_6 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) last_1_var_1_10))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_1 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : (((100 | var_1_1) >= var_1_7) ? (var_1_10 == ((signed char) var_1_11)) : 1)) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-1, var_1_11=55, var_1_12=-31, var_1_13=127/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L93-L94] return ((var_1_2 ? ((last_1_var_1_10 > last_1_var_1_10) ? (var_1_6 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) last_1_var_1_10))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_1 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : (((100 | var_1_1) >= var_1_7) ? (var_1_10 == ((signed char) var_1_11)) : 1))) && (var_1_6 ? (var_1_13 == ((float) ((((16.3f) < ((((((var_1_14 - 1.875f)) > (63.5f)) ? ((var_1_14 - 1.875f)) : (63.5f))))) ? (16.3f) : ((((((var_1_14 - 1.875f)) > (63.5f)) ? ((var_1_14 - 1.875f)) : (63.5f)))))))) : (var_1_13 == ((float) (var_1_14 - var_1_15)))) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-1, var_1_11=55, var_1_12=-31, var_1_13=127/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=100, var_1_10=-1, var_1_11=55, var_1_12=-31, var_1_13=127/2, var_1_1=16, var_1_2=0, var_1_6=1, var_1_7=16, var_1_8=32766, var_1_9=16383] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 4, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 78 mSDsluCounter, 593 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 322 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 54 IncrementalHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 271 mSDtfsCounter, 54 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=3, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 29 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 518 NumberOfCodeBlocks, 518 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 409 ConstructedInterpolants, 0 QuantifiedInterpolants, 453 SizeOfPredicates, 0 NumberOfNonLiveVariables, 239 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1890/1920 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-18 22:50:27,294 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-97.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 0daba001bb4159e329ea4e02bf43fad28551c83f8164fe6d87ea605497512373 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 22:50:29,536 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 22:50:29,615 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 22:50:29,620 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 22:50:29,621 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 22:50:29,647 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 22:50:29,648 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 22:50:29,648 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 22:50:29,649 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 22:50:29,649 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 22:50:29,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 22:50:29,650 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 22:50:29,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 22:50:29,651 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 22:50:29,651 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 22:50:29,652 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 22:50:29,652 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 22:50:29,652 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 22:50:29,653 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 22:50:29,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 22:50:29,657 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 22:50:29,657 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 22:50:29,658 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 22:50:29,658 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 22:50:29,658 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 22:50:29,658 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 22:50:29,659 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 22:50:29,659 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 22:50:29,659 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 22:50:29,659 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 22:50:29,659 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 22:50:29,660 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 22:50:29,660 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 22:50:29,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 22:50:29,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:50:29,662 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 22:50:29,662 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 22:50:29,662 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 22:50:29,663 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 22:50:29,663 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 22:50:29,663 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 22:50:29,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 22:50:29,664 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 22:50:29,664 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 22:50:29,664 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 -> 0daba001bb4159e329ea4e02bf43fad28551c83f8164fe6d87ea605497512373 [2024-11-18 22:50:30,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 22:50:30,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 22:50:30,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 22:50:30,028 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 22:50:30,029 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 22:50:30,030 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-97.i [2024-11-18 22:50:31,592 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 22:50:31,796 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 22:50:31,797 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-97.i [2024-11-18 22:50:31,804 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fbf70aa7/1338f3963c214df1ba54ec511bd26ee4/FLAG150125731 [2024-11-18 22:50:31,817 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fbf70aa7/1338f3963c214df1ba54ec511bd26ee4 [2024-11-18 22:50:31,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 22:50:31,820 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 22:50:31,821 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 22:50:31,822 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 22:50:31,826 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 22:50:31,827 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:50:31" (1/1) ... [2024-11-18 22:50:31,828 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@674ff05d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:31, skipping insertion in model container [2024-11-18 22:50:31,828 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:50:31" (1/1) ... [2024-11-18 22:50:31,855 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 22:50:32,052 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-97.i[915,928] [2024-11-18 22:50:32,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:50:32,135 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 22:50:32,151 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-97.i[915,928] [2024-11-18 22:50:32,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:50:32,207 INFO L204 MainTranslator]: Completed translation [2024-11-18 22:50:32,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:32 WrapperNode [2024-11-18 22:50:32,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 22:50:32,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 22:50:32,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 22:50:32,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 22:50:32,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:32" (1/1) ... [2024-11-18 22:50:32,230 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:32" (1/1) ... [2024-11-18 22:50:32,263 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 109 [2024-11-18 22:50:32,264 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 22:50:32,265 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 22:50:32,266 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 22:50:32,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 22:50:32,276 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:32" (1/1) ... [2024-11-18 22:50:32,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:32" (1/1) ... [2024-11-18 22:50:32,279 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:32" (1/1) ... [2024-11-18 22:50:32,297 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-18 22:50:32,301 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:32" (1/1) ... [2024-11-18 22:50:32,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:32" (1/1) ... [2024-11-18 22:50:32,313 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:32" (1/1) ... [2024-11-18 22:50:32,319 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:32" (1/1) ... [2024-11-18 22:50:32,322 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:32" (1/1) ... [2024-11-18 22:50:32,327 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:32" (1/1) ... [2024-11-18 22:50:32,330 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 22:50:32,335 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 22:50:32,335 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 22:50:32,335 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 22:50:32,336 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:32" (1/1) ... [2024-11-18 22:50:32,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:50:32,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:50:32,368 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-18 22:50:32,375 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-18 22:50:32,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 22:50:32,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 22:50:32,419 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 22:50:32,419 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 22:50:32,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 22:50:32,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 22:50:32,504 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 22:50:32,506 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 22:50:32,927 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-18 22:50:32,928 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 22:50:32,943 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 22:50:32,943 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 22:50:32,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:50:32 BoogieIcfgContainer [2024-11-18 22:50:32,944 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 22:50:32,952 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 22:50:32,952 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 22:50:32,956 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 22:50:32,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:50:31" (1/3) ... [2024-11-18 22:50:32,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e655a4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:50:32, skipping insertion in model container [2024-11-18 22:50:32,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:50:32" (2/3) ... [2024-11-18 22:50:32,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e655a4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:50:32, skipping insertion in model container [2024-11-18 22:50:32,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:50:32" (3/3) ... [2024-11-18 22:50:32,959 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-97.i [2024-11-18 22:50:32,972 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 22:50:32,972 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 22:50:33,027 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 22:50:33,034 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;@7868fff6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 22:50:33,034 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 22:50:33,041 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-18 22:50:33,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-18 22:50:33,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:50:33,052 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:50:33,053 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:50:33,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:50:33,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1959647612, now seen corresponding path program 1 times [2024-11-18 22:50:33,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:50:33,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1179607699] [2024-11-18 22:50:33,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:50:33,068 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-18 22:50:33,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:50:33,071 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-18 22:50:33,072 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-18 22:50:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:50:33,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 22:50:33,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:50:33,345 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-18 22:50:33,346 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:50:33,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 22:50:33,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1179607699] [2024-11-18 22:50:33,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1179607699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:50:33,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:50:33,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 22:50:33,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396893527] [2024-11-18 22:50:33,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:50:33,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 22:50:33,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 22:50:33,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 22:50:33,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:50:33,383 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-18 22:50:33,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:50:33,415 INFO L93 Difference]: Finished difference Result 98 states and 161 transitions. [2024-11-18 22:50:33,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 22:50:33,420 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 101 [2024-11-18 22:50:33,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:50:33,428 INFO L225 Difference]: With dead ends: 98 [2024-11-18 22:50:33,429 INFO L226 Difference]: Without dead ends: 46 [2024-11-18 22:50:33,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 100 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-18 22:50:33,438 INFO L432 NwaCegarLoop]: 69 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, 69 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-18 22:50:33,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:50:33,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-18 22:50:33,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-18 22:50:33,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-18 22:50:33,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2024-11-18 22:50:33,510 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 101 [2024-11-18 22:50:33,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:50:33,512 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2024-11-18 22:50:33,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-18 22:50:33,512 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2024-11-18 22:50:33,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-18 22:50:33,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:50:33,517 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 22:50:33,527 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-18 22:50:33,718 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-18 22:50:33,719 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:50:33,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:50:33,720 INFO L85 PathProgramCache]: Analyzing trace with hash 12653632, now seen corresponding path program 1 times [2024-11-18 22:50:33,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:50:33,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1585789538] [2024-11-18 22:50:33,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:50:33,721 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-18 22:50:33,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:50:33,723 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-18 22:50:33,724 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-18 22:50:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:50:33,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-18 22:50:33,939 INFO L278 TraceCheckSpWp]: Computing forward predicates...