./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-37.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-37.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 e6a9f19f8bc91cee98eed829e929613a36691a9c36f04847231bf1631581216f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:18:15,020 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:18:15,118 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:18:15,125 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:18:15,125 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:18:15,154 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:18:15,156 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:18:15,157 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:18:15,157 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:18:15,158 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:18:15,158 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:18:15,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:18:15,160 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:18:15,160 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:18:15,162 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:18:15,163 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:18:15,163 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:18:15,164 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:18:15,164 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:18:15,164 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:18:15,164 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:18:15,169 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:18:15,169 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:18:15,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:18:15,170 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:18:15,170 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:18:15,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:18:15,171 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:18:15,171 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:18:15,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:18:15,172 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:18:15,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:18:15,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:18:15,172 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:18:15,173 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:18:15,173 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:18:15,173 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:18:15,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:18:15,174 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:18:15,174 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:18:15,174 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:18:15,175 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:18:15,175 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 -> e6a9f19f8bc91cee98eed829e929613a36691a9c36f04847231bf1631581216f [2024-10-13 04:18:15,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:18:15,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:18:15,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:18:15,530 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:18:15,530 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:18:15,531 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-37.i [2024-10-13 04:18:16,954 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:18:17,166 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:18:17,167 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-37.i [2024-10-13 04:18:17,176 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dd55eec0/2232a6afeb2943fab0af4d1e2e5fd48a/FLAG56ba0e9b9 [2024-10-13 04:18:17,195 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dd55eec0/2232a6afeb2943fab0af4d1e2e5fd48a [2024-10-13 04:18:17,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:18:17,199 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:18:17,202 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:18:17,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:18:17,228 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:18:17,229 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:18:17" (1/1) ... [2024-10-13 04:18:17,230 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79bb7afa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:17, skipping insertion in model container [2024-10-13 04:18:17,230 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:18:17" (1/1) ... [2024-10-13 04:18:17,259 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:18:17,419 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-37.i[915,928] [2024-10-13 04:18:17,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:18:17,481 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:18:17,492 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-37.i[915,928] [2024-10-13 04:18:17,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:18:17,531 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:18:17,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:17 WrapperNode [2024-10-13 04:18:17,535 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:18:17,536 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:18:17,536 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:18:17,536 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:18:17,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:17" (1/1) ... [2024-10-13 04:18:17,558 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:17" (1/1) ... [2024-10-13 04:18:17,602 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2024-10-13 04:18:17,602 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:18:17,603 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:18:17,603 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:18:17,603 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:18:17,614 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:17" (1/1) ... [2024-10-13 04:18:17,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:17" (1/1) ... [2024-10-13 04:18:17,620 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:17" (1/1) ... [2024-10-13 04:18:17,649 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 04:18:17,650 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:17" (1/1) ... [2024-10-13 04:18:17,650 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:17" (1/1) ... [2024-10-13 04:18:17,664 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:17" (1/1) ... [2024-10-13 04:18:17,669 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:17" (1/1) ... [2024-10-13 04:18:17,675 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:17" (1/1) ... [2024-10-13 04:18:17,677 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:17" (1/1) ... [2024-10-13 04:18:17,682 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:18:17,683 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:18:17,683 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:18:17,683 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:18:17,684 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:17" (1/1) ... [2024-10-13 04:18:17,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:18:17,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:18:17,727 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 04:18:17,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 04:18:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:18:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:18:17,771 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:18:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:18:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:18:17,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:18:17,832 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:18:17,834 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:18:18,159 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-13 04:18:18,163 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:18:18,214 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:18:18,214 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:18:18,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:18:18 BoogieIcfgContainer [2024-10-13 04:18:18,215 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:18:18,217 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:18:18,217 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:18:18,220 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:18:18,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:18:17" (1/3) ... [2024-10-13 04:18:18,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51191196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:18:18, skipping insertion in model container [2024-10-13 04:18:18,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:17" (2/3) ... [2024-10-13 04:18:18,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51191196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:18:18, skipping insertion in model container [2024-10-13 04:18:18,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:18:18" (3/3) ... [2024-10-13 04:18:18,222 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-37.i [2024-10-13 04:18:18,241 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:18:18,241 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:18:18,304 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:18:18,310 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;@79b11dfa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:18:18,310 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:18:18,313 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 32 states have internal predecessors, (47), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 04:18:18,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-13 04:18:18,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:18:18,321 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:18:18,321 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:18:18,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:18:18,326 INFO L85 PathProgramCache]: Analyzing trace with hash -986809123, now seen corresponding path program 1 times [2024-10-13 04:18:18,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:18:18,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434887797] [2024-10-13 04:18:18,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:18:18,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:18:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:18,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:18:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:18,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:18:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:18,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:18:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:18,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:18:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:18,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:18:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:18,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:18:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:18,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:18:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:18,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:18:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:18,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:18:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:18,662 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 04:18:18,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:18:18,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434887797] [2024-10-13 04:18:18,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434887797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:18:18,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:18:18,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:18:18,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106535680] [2024-10-13 04:18:18,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:18:18,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:18:18,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:18:18,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:18:18,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:18:18,701 INFO L87 Difference]: Start difference. First operand has 43 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 32 states have internal predecessors, (47), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-13 04:18:18,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:18:18,738 INFO L93 Difference]: Finished difference Result 83 states and 137 transitions. [2024-10-13 04:18:18,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:18:18,741 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 63 [2024-10-13 04:18:18,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:18:18,751 INFO L225 Difference]: With dead ends: 83 [2024-10-13 04:18:18,751 INFO L226 Difference]: Without dead ends: 41 [2024-10-13 04:18:18,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:18:18,758 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:18:18,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:18:18,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-13 04:18:18,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-13 04:18:18,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 04:18:18,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2024-10-13 04:18:18,801 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 60 transitions. Word has length 63 [2024-10-13 04:18:18,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:18:18,802 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 60 transitions. [2024-10-13 04:18:18,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-13 04:18:18,803 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2024-10-13 04:18:18,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-13 04:18:18,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:18:18,807 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:18:18,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:18:18,808 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:18:18,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:18:18,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1630847327, now seen corresponding path program 1 times [2024-10-13 04:18:18,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:18:18,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758726255] [2024-10-13 04:18:18,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:18:18,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:18:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:19,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:18:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:19,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:18:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:19,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:18:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:19,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:18:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:19,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:18:19,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:19,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:18:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:19,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:18:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:19,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:18:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:19,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:18:19,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:19,184 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 04:18:19,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:18:19,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758726255] [2024-10-13 04:18:19,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758726255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:18:19,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:18:19,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 04:18:19,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172616068] [2024-10-13 04:18:19,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:18:19,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 04:18:19,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:18:19,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 04:18:19,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:18:19,193 INFO L87 Difference]: Start difference. First operand 41 states and 60 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 04:18:19,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:18:19,238 INFO L93 Difference]: Finished difference Result 81 states and 119 transitions. [2024-10-13 04:18:19,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 04:18:19,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 63 [2024-10-13 04:18:19,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:18:19,241 INFO L225 Difference]: With dead ends: 81 [2024-10-13 04:18:19,241 INFO L226 Difference]: Without dead ends: 41 [2024-10-13 04:18:19,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:18:19,244 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 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-10-13 04:18:19,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:18:19,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-13 04:18:19,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-13 04:18:19,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 04:18:19,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2024-10-13 04:18:19,258 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 59 transitions. Word has length 63 [2024-10-13 04:18:19,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:18:19,261 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 59 transitions. [2024-10-13 04:18:19,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 04:18:19,262 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 59 transitions. [2024-10-13 04:18:19,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-13 04:18:19,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:18:19,265 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:18:19,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 04:18:19,266 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:18:19,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:18:19,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1688105629, now seen corresponding path program 1 times [2024-10-13 04:18:19,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:18:19,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328764967] [2024-10-13 04:18:19,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:18:19,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:18:19,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:19,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:18:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:19,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:18:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:19,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:18:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:19,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:18:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:19,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:18:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:19,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:18:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:19,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:18:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:19,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:18:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:19,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:18:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:19,638 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-13 04:18:19,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:18:19,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328764967] [2024-10-13 04:18:19,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328764967] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 04:18:19,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241910260] [2024-10-13 04:18:19,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:18:19,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:18:19,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:18:19,650 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 04:18:19,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 04:18:19,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:19,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 04:18:19,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:18:19,992 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 04:18:19,992 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:18:20,199 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-13 04:18:20,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241910260] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 04:18:20,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 04:18:20,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-13 04:18:20,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937841241] [2024-10-13 04:18:20,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 04:18:20,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 04:18:20,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:18:20,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 04:18:20,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 04:18:20,203 INFO L87 Difference]: Start difference. First operand 41 states and 59 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2024-10-13 04:18:20,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:18:20,379 INFO L93 Difference]: Finished difference Result 87 states and 122 transitions. [2024-10-13 04:18:20,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 04:18:20,380 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) Word has length 63 [2024-10-13 04:18:20,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:18:20,382 INFO L225 Difference]: With dead ends: 87 [2024-10-13 04:18:20,382 INFO L226 Difference]: Without dead ends: 47 [2024-10-13 04:18:20,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-13 04:18:20,384 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 30 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:18:20,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 77 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:18:20,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-13 04:18:20,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2024-10-13 04:18:20,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 04:18:20,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2024-10-13 04:18:20,400 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 63 [2024-10-13 04:18:20,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:18:20,400 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2024-10-13 04:18:20,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2024-10-13 04:18:20,402 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2024-10-13 04:18:20,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-13 04:18:20,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:18:20,405 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:18:20,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 04:18:20,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:18:20,606 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:18:20,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:18:20,607 INFO L85 PathProgramCache]: Analyzing trace with hash -775207943, now seen corresponding path program 1 times [2024-10-13 04:18:20,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:18:20,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019266105] [2024-10-13 04:18:20,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:18:20,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:18:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:20,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:18:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:21,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:18:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:21,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:18:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:21,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:18:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:21,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:18:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:21,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:18:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:21,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:18:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:21,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:18:21,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:21,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:18:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:21,083 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-13 04:18:21,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:18:21,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019266105] [2024-10-13 04:18:21,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019266105] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 04:18:21,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144828411] [2024-10-13 04:18:21,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:18:21,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:18:21,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:18:21,087 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 04:18:21,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 04:18:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:21,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 04:18:21,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:18:21,332 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 04:18:21,332 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:18:21,507 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-13 04:18:21,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144828411] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 04:18:21,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 04:18:21,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2024-10-13 04:18:21,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100904170] [2024-10-13 04:18:21,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 04:18:21,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 04:18:21,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:18:21,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 04:18:21,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-10-13 04:18:21,511 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 14 states have internal predecessors, (50), 5 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 3 states have call predecessors, (27), 5 states have call successors, (27) [2024-10-13 04:18:22,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:18:22,031 INFO L93 Difference]: Finished difference Result 154 states and 205 transitions. [2024-10-13 04:18:22,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 04:18:22,035 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 14 states have internal predecessors, (50), 5 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 3 states have call predecessors, (27), 5 states have call successors, (27) Word has length 65 [2024-10-13 04:18:22,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:18:22,037 INFO L225 Difference]: With dead ends: 154 [2024-10-13 04:18:22,037 INFO L226 Difference]: Without dead ends: 110 [2024-10-13 04:18:22,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=561, Unknown=0, NotChecked=0, Total=756 [2024-10-13 04:18:22,039 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 226 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 04:18:22,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 177 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 04:18:22,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-13 04:18:22,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 46. [2024-10-13 04:18:22,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 04:18:22,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2024-10-13 04:18:22,062 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 65 [2024-10-13 04:18:22,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:18:22,062 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2024-10-13 04:18:22,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 14 states have internal predecessors, (50), 5 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 3 states have call predecessors, (27), 5 states have call successors, (27) [2024-10-13 04:18:22,063 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2024-10-13 04:18:22,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-13 04:18:22,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:18:22,064 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:18:22,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 04:18:22,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-13 04:18:22,265 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:18:22,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:18:22,266 INFO L85 PathProgramCache]: Analyzing trace with hash -106842640, now seen corresponding path program 1 times [2024-10-13 04:18:22,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:18:22,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267842122] [2024-10-13 04:18:22,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:18:22,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:18:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 04:18:22,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [336759718] [2024-10-13 04:18:22,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:18:22,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:18:22,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:18:22,322 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 04:18:22,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 04:18:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:22,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 04:18:22,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:18:22,754 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 04:18:22,755 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:18:22,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:18:22,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267842122] [2024-10-13 04:18:22,756 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 04:18:22,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336759718] [2024-10-13 04:18:22,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336759718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:18:22,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:18:22,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 04:18:22,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249976557] [2024-10-13 04:18:22,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:18:22,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:18:22,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:18:22,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:18:22,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:18:22,759 INFO L87 Difference]: Start difference. First operand 46 states and 61 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 04:18:22,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:18:22,870 INFO L93 Difference]: Finished difference Result 136 states and 181 transitions. [2024-10-13 04:18:22,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 04:18:22,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 66 [2024-10-13 04:18:22,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:18:22,872 INFO L225 Difference]: With dead ends: 136 [2024-10-13 04:18:22,872 INFO L226 Difference]: Without dead ends: 91 [2024-10-13 04:18:22,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 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-10-13 04:18:22,874 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 41 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:18:22,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 130 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:18:22,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-13 04:18:22,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2024-10-13 04:18:22,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 61 states have internal predecessors, (74), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 04:18:22,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 110 transitions. [2024-10-13 04:18:22,897 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 110 transitions. Word has length 66 [2024-10-13 04:18:22,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:18:22,897 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 110 transitions. [2024-10-13 04:18:22,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 04:18:22,898 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 110 transitions. [2024-10-13 04:18:22,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-13 04:18:22,899 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:18:22,899 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:18:22,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 04:18:23,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:18:23,100 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:18:23,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:18:23,101 INFO L85 PathProgramCache]: Analyzing trace with hash -37783117, now seen corresponding path program 1 times [2024-10-13 04:18:23,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:18:23,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145969176] [2024-10-13 04:18:23,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:18:23,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:18:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 04:18:23,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [549929434] [2024-10-13 04:18:23,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:18:23,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:18:23,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:18:23,148 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 04:18:23,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 04:18:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:18:23,243 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 04:18:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:18:23,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 04:18:23,337 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 04:18:23,338 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 04:18:23,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 04:18:23,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:18:23,555 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-13 04:18:23,630 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 04:18:23,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:18:23 BoogieIcfgContainer [2024-10-13 04:18:23,633 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 04:18:23,635 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 04:18:23,636 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 04:18:23,636 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 04:18:23,636 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:18:18" (3/4) ... [2024-10-13 04:18:23,638 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 04:18:23,640 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 04:18:23,640 INFO L158 Benchmark]: Toolchain (without parser) took 6441.10ms. Allocated memory was 125.8MB in the beginning and 230.7MB in the end (delta: 104.9MB). Free memory was 53.8MB in the beginning and 129.6MB in the end (delta: -75.7MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2024-10-13 04:18:23,640 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory is still 99.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:18:23,641 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.25ms. Allocated memory was 125.8MB in the beginning and 190.8MB in the end (delta: 65.0MB). Free memory was 53.7MB in the beginning and 152.1MB in the end (delta: -98.5MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2024-10-13 04:18:23,641 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.66ms. Allocated memory is still 190.8MB. Free memory was 152.1MB in the beginning and 148.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 04:18:23,641 INFO L158 Benchmark]: Boogie Preprocessor took 78.91ms. Allocated memory is still 190.8MB. Free memory was 148.9MB in the beginning and 143.8MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 04:18:23,642 INFO L158 Benchmark]: RCFGBuilder took 532.39ms. Allocated memory is still 190.8MB. Free memory was 143.8MB in the beginning and 120.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-13 04:18:23,642 INFO L158 Benchmark]: TraceAbstraction took 5415.72ms. Allocated memory was 190.8MB in the beginning and 230.7MB in the end (delta: 39.8MB). Free memory was 119.5MB in the beginning and 130.6MB in the end (delta: -11.1MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2024-10-13 04:18:23,642 INFO L158 Benchmark]: Witness Printer took 4.22ms. Allocated memory is still 230.7MB. Free memory is still 129.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:18:23,644 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory is still 99.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.25ms. Allocated memory was 125.8MB in the beginning and 190.8MB in the end (delta: 65.0MB). Free memory was 53.7MB in the beginning and 152.1MB in the end (delta: -98.5MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.66ms. Allocated memory is still 190.8MB. Free memory was 152.1MB in the beginning and 148.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.91ms. Allocated memory is still 190.8MB. Free memory was 148.9MB in the beginning and 143.8MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 532.39ms. Allocated memory is still 190.8MB. Free memory was 143.8MB in the beginning and 120.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5415.72ms. Allocated memory was 190.8MB in the beginning and 230.7MB in the end (delta: 39.8MB). Free memory was 119.5MB in the beginning and 130.6MB in the end (delta: -11.1MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. * Witness Printer took 4.22ms. Allocated memory is still 230.7MB. Free memory is still 129.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of bitwiseOr at line 81. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 8; [L23] unsigned short int var_1_2 = 59049; [L24] unsigned char var_1_6 = 4; [L25] unsigned char var_1_7 = 1; [L26] unsigned char var_1_8 = 64; [L27] unsigned long int var_1_9 = 64; [L28] unsigned long int var_1_10 = 1776833134; [L29] signed long int var_1_11 = -16; [L30] double var_1_12 = 0.25; [L31] double var_1_13 = 5.5; [L32] unsigned char last_1_var_1_8 = 64; [L33] signed long int last_1_var_1_11 = -16; [L85] isInitial = 1 [L86] FCALL initially() [L87] COND TRUE 1 [L88] CALL updateLastVariables() [L77] last_1_var_1_8 = var_1_8 [L78] last_1_var_1_11 = var_1_11 [L88] RET updateLastVariables() [L89] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_ushort() [L62] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L62] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L63] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L63] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=4, var_1_7=1, var_1_8=64, var_1_9=64] [L64] var_1_6 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_7=1, var_1_8=64, var_1_9=64] [L65] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_7=1, var_1_8=64, var_1_9=64] [L66] CALL assume_abort_if_not(var_1_6 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=256, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=256, var_1_7=1, var_1_8=64, var_1_9=64] [L66] RET assume_abort_if_not(var_1_6 <= 254) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=256, var_1_7=1, var_1_8=64, var_1_9=64] [L67] var_1_7 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=256, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=256, var_1_8=64, var_1_9=64] [L68] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=256, var_1_8=64, var_1_9=64] [L69] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=256, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=256, var_1_7=1, var_1_8=64, var_1_9=64] [L69] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=1776833134, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=256, var_1_7=1, var_1_8=64, var_1_9=64] [L70] var_1_10 = __VERIFIER_nondet_ulong() [L71] CALL assume_abort_if_not(var_1_10 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=256, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=256, var_1_7=1, var_1_8=64, var_1_9=64] [L71] RET assume_abort_if_not(var_1_10 >= 1073741824) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=256, var_1_7=1, var_1_8=64, var_1_9=64] [L72] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=256, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=256, var_1_7=1, var_1_8=64, var_1_9=64] [L72] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=-16, var_1_12=1/4, var_1_13=11/2, var_1_1=8, var_1_2=32767, var_1_6=256, var_1_7=1, var_1_8=64, var_1_9=64] [L73] var_1_13 = __VERIFIER_nondet_double() [L74] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=-16, var_1_12=1/4, var_1_1=8, var_1_2=32767, var_1_6=256, var_1_7=1, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=-16, var_1_12=1/4, var_1_1=8, var_1_2=32767, var_1_6=256, var_1_7=1, var_1_8=64, var_1_9=64] [L74] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=-16, var_1_12=1/4, var_1_1=8, var_1_2=32767, var_1_6=256, var_1_7=1, var_1_8=64, var_1_9=64] [L89] RET updateVariables() [L90] CALL step() [L37] EXPR (var_1_2 - last_1_var_1_8) ^ (last_1_var_1_8 * last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=-16, var_1_12=1/4, var_1_1=8, var_1_2=32767, var_1_6=256, var_1_7=1, var_1_8=64, var_1_9=64] [L37] COND TRUE ((var_1_2 - last_1_var_1_8) ^ (last_1_var_1_8 * last_1_var_1_11)) <= -64 [L38] var_1_1 = ((((1) < (((((16) > (var_1_6)) ? (16) : (var_1_6))))) ? (1) : (((((16) > (var_1_6)) ? (16) : (var_1_6)))))) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=-16, var_1_12=1/4, var_1_1=1, var_1_2=32767, var_1_6=256, var_1_7=1, var_1_8=64, var_1_9=64] [L44] var_1_11 = var_1_1 VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=1, var_1_12=1/4, var_1_1=1, var_1_2=32767, var_1_6=256, var_1_7=1, var_1_8=64, var_1_9=64] [L45] COND TRUE var_1_1 >= ((((var_1_11 / var_1_2) < 0 ) ? -(var_1_11 / var_1_2) : (var_1_11 / var_1_2))) [L46] var_1_8 = var_1_6 VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=1, var_1_12=1/4, var_1_1=1, var_1_2=32767, var_1_6=256, var_1_7=1, var_1_8=256, var_1_9=64] [L52] unsigned char stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, stepLocal_0=1, var_1_10=-3221225472, var_1_11=1, var_1_12=1/4, var_1_1=1, var_1_2=32767, var_1_6=256, var_1_7=1, var_1_8=256, var_1_9=64] [L53] COND FALSE !(var_1_1 > stepLocal_0) [L56] var_1_9 = ((1228227409u + var_1_10) - var_1_11) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=1, var_1_12=1/4, var_1_1=1, var_1_2=32767, var_1_6=256, var_1_7=1, var_1_8=256, var_1_9=-1992998064] [L58] var_1_12 = var_1_13 [L90] RET step() [L91] CALL, EXPR property() [L81] EXPR (var_1_2 - last_1_var_1_8) ^ (last_1_var_1_8 * last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=1, var_1_12=2, var_1_13=2, var_1_1=1, var_1_2=32767, var_1_6=256, var_1_7=1, var_1_8=256, var_1_9=-1992998064] [L81-L82] return (((((((var_1_2 - last_1_var_1_8) ^ (last_1_var_1_8 * last_1_var_1_11)) <= -64) ? (var_1_1 == ((unsigned char) ((((1) < (((((16) > (var_1_6)) ? (16) : (var_1_6))))) ? (1) : (((((16) > (var_1_6)) ? (16) : (var_1_6)))))))) : (var_1_7 ? (var_1_1 == ((unsigned char) var_1_6)) : 1)) && ((var_1_1 >= ((((var_1_11 / var_1_2) < 0 ) ? -(var_1_11 / var_1_2) : (var_1_11 / var_1_2)))) ? (var_1_8 == ((unsigned char) var_1_6)) : (var_1_7 ? (var_1_8 == ((unsigned char) var_1_6)) : 1))) && ((var_1_1 > var_1_1) ? (var_1_9 == ((unsigned long int) var_1_2)) : (var_1_9 == ((unsigned long int) ((1228227409u + var_1_10) - var_1_11))))) && (var_1_11 == ((signed long int) var_1_1))) && (var_1_12 == ((double) var_1_13)) ; [L91] RET, EXPR property() [L91] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=1, var_1_12=2, var_1_13=2, var_1_1=1, var_1_2=32767, var_1_6=256, var_1_7=1, var_1_8=256, var_1_9=-1992998064] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=-16, last_1_var_1_8=64, var_1_10=-3221225472, var_1_11=1, var_1_12=2, var_1_13=2, var_1_1=1, var_1_2=32767, var_1_6=256, var_1_7=1, var_1_8=256, var_1_9=-1992998064] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 6, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 297 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 297 mSDsluCounter, 541 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 319 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 395 IncrementalHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 222 mSDtfsCounter, 395 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 436 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=5, InterpolantAutomatonStates: 37, 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, 5 MinimizatonAttempts, 73 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 652 NumberOfCodeBlocks, 652 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 567 ConstructedInterpolants, 0 QuantifiedInterpolants, 1862 SizeOfPredicates, 8 NumberOfNonLiveVariables, 506 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 1152/1296 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 04:18:23,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-37.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 e6a9f19f8bc91cee98eed829e929613a36691a9c36f04847231bf1631581216f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:18:25,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:18:25,946 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 04:18:25,954 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:18:25,955 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:18:25,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:18:25,992 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:18:25,992 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:18:25,993 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:18:25,994 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:18:25,994 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:18:25,995 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:18:25,995 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:18:25,996 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:18:25,996 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:18:25,997 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:18:25,997 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:18:25,997 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:18:25,998 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:18:25,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:18:25,998 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:18:25,999 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:18:25,999 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:18:26,000 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 04:18:26,000 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 04:18:26,000 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:18:26,001 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 04:18:26,001 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:18:26,001 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:18:26,002 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:18:26,002 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:18:26,003 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:18:26,003 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:18:26,003 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:18:26,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:18:26,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:18:26,004 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:18:26,004 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:18:26,005 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 04:18:26,005 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 04:18:26,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:18:26,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:18:26,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:18:26,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:18:26,007 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 04:18:26,008 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 -> e6a9f19f8bc91cee98eed829e929613a36691a9c36f04847231bf1631581216f [2024-10-13 04:18:26,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:18:26,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:18:26,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:18:26,396 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:18:26,397 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:18:26,399 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-37.i [2024-10-13 04:18:27,854 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:18:28,070 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:18:28,071 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-37.i [2024-10-13 04:18:28,080 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da8ec2a97/2f98e4f315b74d10a9f86d0b5e0c8584/FLAG93d5ff168 [2024-10-13 04:18:28,092 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da8ec2a97/2f98e4f315b74d10a9f86d0b5e0c8584 [2024-10-13 04:18:28,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:18:28,096 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:18:28,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:18:28,099 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:18:28,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:18:28,105 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:18:28" (1/1) ... [2024-10-13 04:18:28,105 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@235e46a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:28, skipping insertion in model container [2024-10-13 04:18:28,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:18:28" (1/1) ... [2024-10-13 04:18:28,129 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:18:28,325 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-37.i[915,928] [2024-10-13 04:18:28,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:18:28,394 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:18:28,408 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-37.i[915,928] [2024-10-13 04:18:28,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:18:28,457 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:18:28,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:28 WrapperNode [2024-10-13 04:18:28,458 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:18:28,459 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:18:28,460 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:18:28,460 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:18:28,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:28" (1/1) ... [2024-10-13 04:18:28,482 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:28" (1/1) ... [2024-10-13 04:18:28,510 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2024-10-13 04:18:28,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:18:28,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:18:28,515 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:18:28,515 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:18:28,525 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:28" (1/1) ... [2024-10-13 04:18:28,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:28" (1/1) ... [2024-10-13 04:18:28,528 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:28" (1/1) ... [2024-10-13 04:18:28,544 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 04:18:28,547 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:28" (1/1) ... [2024-10-13 04:18:28,551 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:28" (1/1) ... [2024-10-13 04:18:28,558 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:28" (1/1) ... [2024-10-13 04:18:28,565 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:28" (1/1) ... [2024-10-13 04:18:28,569 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:28" (1/1) ... [2024-10-13 04:18:28,574 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:28" (1/1) ... [2024-10-13 04:18:28,577 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:18:28,581 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:18:28,582 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:18:28,582 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:18:28,583 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:28" (1/1) ... [2024-10-13 04:18:28,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:18:28,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:18:28,615 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 04:18:28,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 04:18:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:18:28,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 04:18:28,668 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:18:28,668 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:18:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:18:28,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:18:28,737 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:18:28,739 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:18:29,030 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-13 04:18:29,030 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:18:29,130 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:18:29,132 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:18:29,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:18:29 BoogieIcfgContainer [2024-10-13 04:18:29,132 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:18:29,134 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:18:29,135 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:18:29,138 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:18:29,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:18:28" (1/3) ... [2024-10-13 04:18:29,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3711fbb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:18:29, skipping insertion in model container [2024-10-13 04:18:29,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:18:28" (2/3) ... [2024-10-13 04:18:29,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3711fbb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:18:29, skipping insertion in model container [2024-10-13 04:18:29,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:18:29" (3/3) ... [2024-10-13 04:18:29,142 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-37.i [2024-10-13 04:18:29,158 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:18:29,159 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:18:29,229 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:18:29,237 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;@e975516, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:18:29,238 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:18:29,244 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 04:18:29,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-13 04:18:29,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:18:29,255 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:18:29,256 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:18:29,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:18:29,262 INFO L85 PathProgramCache]: Analyzing trace with hash 48895346, now seen corresponding path program 1 times [2024-10-13 04:18:29,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:18:29,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [732701052] [2024-10-13 04:18:29,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:18:29,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:18:29,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:18:29,282 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:18:29,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 04:18:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:29,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 04:18:29,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:18:29,481 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-10-13 04:18:29,481 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:18:29,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:18:29,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [732701052] [2024-10-13 04:18:29,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [732701052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:18:29,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:18:29,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:18:29,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430932496] [2024-10-13 04:18:29,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:18:29,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:18:29,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:18:29,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:18:29,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:18:29,510 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-13 04:18:29,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:18:29,566 INFO L93 Difference]: Finished difference Result 65 states and 107 transitions. [2024-10-13 04:18:29,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:18:29,577 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 60 [2024-10-13 04:18:29,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:18:29,583 INFO L225 Difference]: With dead ends: 65 [2024-10-13 04:18:29,583 INFO L226 Difference]: Without dead ends: 32 [2024-10-13 04:18:29,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:18:29,590 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:18:29,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:18:29,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-13 04:18:29,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-13 04:18:29,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 04:18:29,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2024-10-13 04:18:29,640 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 45 transitions. Word has length 60 [2024-10-13 04:18:29,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:18:29,641 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 45 transitions. [2024-10-13 04:18:29,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-13 04:18:29,641 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2024-10-13 04:18:29,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-13 04:18:29,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:18:29,644 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:18:29,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 04:18:29,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:18:29,846 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:18:29,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:18:29,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1773400112, now seen corresponding path program 1 times [2024-10-13 04:18:29,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:18:29,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357129574] [2024-10-13 04:18:29,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:18:29,848 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:18:29,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:18:29,850 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:18:29,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 04:18:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:30,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 04:18:30,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:18:30,083 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 04:18:30,084 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:18:30,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:18:30,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357129574] [2024-10-13 04:18:30,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [357129574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:18:30,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:18:30,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 04:18:30,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663212026] [2024-10-13 04:18:30,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:18:30,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 04:18:30,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:18:30,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 04:18:30,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:18:30,092 INFO L87 Difference]: Start difference. First operand 32 states and 45 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 04:18:30,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:18:30,188 INFO L93 Difference]: Finished difference Result 63 states and 89 transitions. [2024-10-13 04:18:30,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 04:18:30,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 60 [2024-10-13 04:18:30,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:18:30,194 INFO L225 Difference]: With dead ends: 63 [2024-10-13 04:18:30,194 INFO L226 Difference]: Without dead ends: 32 [2024-10-13 04:18:30,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:18:30,196 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:18:30,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:18:30,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-13 04:18:30,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-13 04:18:30,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 04:18:30,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2024-10-13 04:18:30,206 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 60 [2024-10-13 04:18:30,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:18:30,207 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 44 transitions. [2024-10-13 04:18:30,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 04:18:30,208 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2024-10-13 04:18:30,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-13 04:18:30,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:18:30,210 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:18:30,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 04:18:30,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:18:30,414 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:18:30,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:18:30,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1773459694, now seen corresponding path program 1 times [2024-10-13 04:18:30,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:18:30,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568419591] [2024-10-13 04:18:30,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:18:30,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:18:30,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:18:30,419 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:18:30,421 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 (4)] Waiting until timeout for monitored process [2024-10-13 04:18:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:30,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 04:18:30,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:18:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-13 04:18:53,945 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:18:53,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:18:53,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568419591] [2024-10-13 04:18:53,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1568419591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:18:53,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:18:53,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 04:18:53,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108150759] [2024-10-13 04:18:53,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:18:53,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 04:18:53,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:18:53,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 04:18:53,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-13 04:18:53,948 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 04:18:55,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:18:55,098 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2024-10-13 04:18:55,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 04:18:55,100 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 60 [2024-10-13 04:18:55,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:18:55,101 INFO L225 Difference]: With dead ends: 77 [2024-10-13 04:18:55,101 INFO L226 Difference]: Without dead ends: 46 [2024-10-13 04:18:55,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2024-10-13 04:18:55,103 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 56 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 04:18:55,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 95 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 04:18:55,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-13 04:18:55,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2024-10-13 04:18:55,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 04:18:55,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2024-10-13 04:18:55,117 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 60 [2024-10-13 04:18:55,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:18:55,117 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-10-13 04:18:55,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 04:18:55,118 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2024-10-13 04:18:55,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-13 04:18:55,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:18:55,119 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:18:55,125 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 (4)] Ended with exit code 0 [2024-10-13 04:18:55,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:18:55,321 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:18:55,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:18:55,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1484958010, now seen corresponding path program 1 times [2024-10-13 04:18:55,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:18:55,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1432327844] [2024-10-13 04:18:55,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:18:55,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:18:55,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:18:55,324 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:18:55,325 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 (5)] Waiting until timeout for monitored process [2024-10-13 04:18:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:55,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 04:18:55,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:18:55,726 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 04:18:55,726 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:18:55,990 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:18:55,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1432327844] [2024-10-13 04:18:55,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1432327844] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 04:18:55,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1840396279] [2024-10-13 04:18:55,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:18:55,991 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 04:18:55,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 04:18:55,994 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 04:18:55,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-13 04:18:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:18:56,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 04:18:56,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:19:13,629 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-13 04:19:13,630 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:19:13,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1840396279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:19:13,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 04:19:13,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 14 [2024-10-13 04:19:13,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565368039] [2024-10-13 04:19:13,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:19:13,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 04:19:13,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:19:13,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 04:19:13,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-13 04:19:13,633 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 04:19:20,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:19:20,894 INFO L93 Difference]: Finished difference Result 146 states and 182 transitions. [2024-10-13 04:19:20,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 04:19:20,899 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 61 [2024-10-13 04:19:20,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:19:20,902 INFO L225 Difference]: With dead ends: 146 [2024-10-13 04:19:20,902 INFO L226 Difference]: Without dead ends: 105 [2024-10-13 04:19:20,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2024-10-13 04:19:20,904 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 77 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:19:20,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 240 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-13 04:19:20,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-13 04:19:20,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 70. [2024-10-13 04:19:20,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 04:19:20,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2024-10-13 04:19:20,922 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 61 [2024-10-13 04:19:20,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:19:20,922 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2024-10-13 04:19:20,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 04:19:20,923 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2024-10-13 04:19:20,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-13 04:19:20,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:19:20,924 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:19:20,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-13 04:19:21,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-10-13 04:19:21,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-13 04:19:21,325 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:19:21,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:19:21,326 INFO L85 PathProgramCache]: Analyzing trace with hash 2000662660, now seen corresponding path program 1 times [2024-10-13 04:19:21,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:19:21,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066150556] [2024-10-13 04:19:21,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:19:21,327 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:19:21,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:19:21,329 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:19:21,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 04:19:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:19:21,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 04:19:21,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:19:21,747 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 04:19:21,747 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:19:22,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:19:22,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066150556] [2024-10-13 04:19:22,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1066150556] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 04:19:22,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [983243684] [2024-10-13 04:19:22,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:19:22,047 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 04:19:22,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 04:19:22,048 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 04:19:22,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-10-13 04:19:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:19:22,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 04:19:22,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:19:37,850 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-13 04:19:37,850 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:19:37,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [983243684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:19:37,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 04:19:37,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 17 [2024-10-13 04:19:37,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650134938] [2024-10-13 04:19:37,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:19:37,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 04:19:37,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:19:37,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 04:19:37,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2024-10-13 04:19:37,852 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 04:19:43,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:19:43,545 INFO L93 Difference]: Finished difference Result 121 states and 155 transitions. [2024-10-13 04:19:43,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 04:19:43,546 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 61 [2024-10-13 04:19:43,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:19:43,547 INFO L225 Difference]: With dead ends: 121 [2024-10-13 04:19:43,547 INFO L226 Difference]: Without dead ends: 80 [2024-10-13 04:19:43,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=205, Invalid=665, Unknown=0, NotChecked=0, Total=870 [2024-10-13 04:19:43,548 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 27 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-13 04:19:43,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 191 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-13 04:19:43,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-13 04:19:43,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2024-10-13 04:19:43,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 04:19:43,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2024-10-13 04:19:43,563 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 61 [2024-10-13 04:19:43,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:19:43,564 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2024-10-13 04:19:43,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 04:19:43,564 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2024-10-13 04:19:43,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 04:19:43,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:19:43,565 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:19:43,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-13 04:19:43,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-10-13 04:19:43,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-13 04:19:43,967 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:19:43,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:19:43,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1429746488, now seen corresponding path program 1 times [2024-10-13 04:19:43,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:19:43,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118929639] [2024-10-13 04:19:43,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:19:43,968 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:19:43,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:19:43,969 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:19:43,971 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 (9)] Waiting until timeout for monitored process [2024-10-13 04:19:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:19:44,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 04:19:44,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:19:44,373 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 04:19:44,373 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:19:44,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:19:44,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118929639] [2024-10-13 04:19:44,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1118929639] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 04:19:44,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1749784613] [2024-10-13 04:19:44,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:19:44,657 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 04:19:44,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 04:19:44,659 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 04:19:44,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process