./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-21.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 7001a99b958cb5a783d624aa4b4b483c2055b6507029df9ffd20f7aa9d768319 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:28:42,618 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:28:42,672 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 05:28:42,677 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:28:42,677 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:28:42,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:28:42,705 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:28:42,705 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:28:42,706 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:28:42,707 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:28:42,707 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:28:42,708 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:28:42,708 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:28:42,710 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:28:42,710 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:28:42,710 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:28:42,710 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:28:42,711 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:28:42,711 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 05:28:42,711 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:28:42,711 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:28:42,712 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:28:42,713 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:28:42,713 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:28:42,713 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:28:42,713 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:28:42,713 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:28:42,714 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:28:42,714 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:28:42,716 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:28:42,716 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:28:42,716 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:28:42,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:28:42,716 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:28:42,717 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:28:42,717 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:28:42,717 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 05:28:42,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 05:28:42,717 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:28:42,717 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:28:42,718 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:28:42,719 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:28:42,719 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 -> 7001a99b958cb5a783d624aa4b4b483c2055b6507029df9ffd20f7aa9d768319 [2024-11-12 05:28:42,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:28:42,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:28:42,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:28:42,956 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:28:42,957 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:28:42,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-21.i [2024-11-12 05:28:44,345 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:28:44,525 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:28:44,526 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-21.i [2024-11-12 05:28:44,535 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ca3cafc3/7e9ab2e3c4464dccb8605d0fbde3efbf/FLAG0e9c8be1a [2024-11-12 05:28:44,559 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ca3cafc3/7e9ab2e3c4464dccb8605d0fbde3efbf [2024-11-12 05:28:44,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:28:44,565 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:28:44,571 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:28:44,572 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:28:44,579 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:28:44,580 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:28:44" (1/1) ... [2024-11-12 05:28:44,583 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c0de1b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:44, skipping insertion in model container [2024-11-12 05:28:44,583 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:28:44" (1/1) ... [2024-11-12 05:28:44,604 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:28:44,773 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-21.i[915,928] [2024-11-12 05:28:44,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:28:44,836 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:28:44,848 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-21.i[915,928] [2024-11-12 05:28:44,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:28:44,890 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:28:44,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:44 WrapperNode [2024-11-12 05:28:44,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:28:44,892 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:28:44,893 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:28:44,893 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:28:44,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:44" (1/1) ... [2024-11-12 05:28:44,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:44" (1/1) ... [2024-11-12 05:28:44,961 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 92 [2024-11-12 05:28:44,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:28:44,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:28:44,966 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:28:44,966 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:28:44,979 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:44" (1/1) ... [2024-11-12 05:28:44,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:44" (1/1) ... [2024-11-12 05:28:44,986 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:44" (1/1) ... [2024-11-12 05:28:45,009 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 05:28:45,014 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:44" (1/1) ... [2024-11-12 05:28:45,014 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:44" (1/1) ... [2024-11-12 05:28:45,026 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:44" (1/1) ... [2024-11-12 05:28:45,029 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:44" (1/1) ... [2024-11-12 05:28:45,036 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:44" (1/1) ... [2024-11-12 05:28:45,037 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:44" (1/1) ... [2024-11-12 05:28:45,047 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:28:45,048 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:28:45,048 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:28:45,048 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:28:45,049 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:44" (1/1) ... [2024-11-12 05:28:45,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:28:45,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:28:45,115 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:28:45,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:28:45,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:28:45,185 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:28:45,185 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:28:45,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 05:28:45,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:28:45,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:28:45,253 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:28:45,261 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:28:45,466 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-12 05:28:45,466 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:28:45,476 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:28:45,478 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:28:45,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:28:45 BoogieIcfgContainer [2024-11-12 05:28:45,478 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:28:45,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:28:45,480 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:28:45,483 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:28:45,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:28:44" (1/3) ... [2024-11-12 05:28:45,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e1f6e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:28:45, skipping insertion in model container [2024-11-12 05:28:45,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:44" (2/3) ... [2024-11-12 05:28:45,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e1f6e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:28:45, skipping insertion in model container [2024-11-12 05:28:45,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:28:45" (3/3) ... [2024-11-12 05:28:45,485 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-21.i [2024-11-12 05:28:45,527 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:28:45,528 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:28:45,620 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:28:45,626 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;@799f525c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:28:45,627 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:28:45,630 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 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-11-12 05:28:45,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-12 05:28:45,638 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:28:45,638 INFO L218 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] [2024-11-12 05:28:45,639 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:28:45,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:28:45,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1174544175, now seen corresponding path program 1 times [2024-11-12 05:28:45,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:28:45,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253303874] [2024-11-12 05:28:45,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:28:45,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:28:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:45,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:28:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:45,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:28:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:45,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:28:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:45,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:28:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:45,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:28:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:45,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 05:28:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:45,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 05:28:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:45,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 05:28:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:45,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 05:28:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:45,903 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 05:28:45,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:28:45,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253303874] [2024-11-12 05:28:45,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253303874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:28:45,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:28:45,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:28:45,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402057601] [2024-11-12 05:28:45,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:28:45,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:28:45,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:28:45,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:28:45,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:28:45,934 INFO L87 Difference]: Start difference. First operand has 41 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 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 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-11-12 05:28:45,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:28:45,950 INFO L93 Difference]: Finished difference Result 75 states and 119 transitions. [2024-11-12 05:28:45,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:28:45,954 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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 64 [2024-11-12 05:28:45,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:28:45,961 INFO L225 Difference]: With dead ends: 75 [2024-11-12 05:28:45,961 INFO L226 Difference]: Without dead ends: 37 [2024-11-12 05:28:45,964 INFO L434 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-11-12 05:28:45,968 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:28:45,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:28:46,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-12 05:28:46,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-12 05:28:46,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 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-11-12 05:28:46,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2024-11-12 05:28:46,073 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 64 [2024-11-12 05:28:46,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:28:46,074 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2024-11-12 05:28:46,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-11-12 05:28:46,074 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2024-11-12 05:28:46,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-12 05:28:46,082 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:28:46,082 INFO L218 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] [2024-11-12 05:28:46,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 05:28:46,083 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:28:46,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:28:46,083 INFO L85 PathProgramCache]: Analyzing trace with hash -562669323, now seen corresponding path program 1 times [2024-11-12 05:28:46,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:28:46,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475451682] [2024-11-12 05:28:46,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:28:46,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:28:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:46,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:28:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:46,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:28:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:46,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:28:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:46,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:28:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:46,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:28:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:46,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 05:28:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:46,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 05:28:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:46,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 05:28:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:46,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 05:28:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:46,278 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 05:28:46,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:28:46,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475451682] [2024-11-12 05:28:46,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475451682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:28:46,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:28:46,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:28:46,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152293026] [2024-11-12 05:28:46,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:28:46,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:28:46,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:28:46,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:28:46,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:28:46,282 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-11-12 05:28:46,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:28:46,297 INFO L93 Difference]: Finished difference Result 71 states and 99 transitions. [2024-11-12 05:28:46,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:28:46,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 64 [2024-11-12 05:28:46,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:28:46,299 INFO L225 Difference]: With dead ends: 71 [2024-11-12 05:28:46,299 INFO L226 Difference]: Without dead ends: 37 [2024-11-12 05:28:46,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-11-12 05:28:46,300 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:28:46,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:28:46,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-12 05:28:46,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-12 05:28:46,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 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-11-12 05:28:46,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2024-11-12 05:28:46,306 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 64 [2024-11-12 05:28:46,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:28:46,307 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-11-12 05:28:46,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-11-12 05:28:46,308 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-11-12 05:28:46,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-12 05:28:46,309 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:28:46,309 INFO L218 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] [2024-11-12 05:28:46,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 05:28:46,309 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:28:46,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:28:46,310 INFO L85 PathProgramCache]: Analyzing trace with hash -505411021, now seen corresponding path program 1 times [2024-11-12 05:28:46,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:28:46,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059166636] [2024-11-12 05:28:46,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:28:46,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:28:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:47,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:28:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:47,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:28:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:47,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:28:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:47,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:28:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:47,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:28:47,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:47,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 05:28:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:47,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 05:28:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:47,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 05:28:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:47,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 05:28:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:47,656 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 05:28:47,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:28:47,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059166636] [2024-11-12 05:28:47,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059166636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:28:47,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:28:47,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 05:28:47,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580109971] [2024-11-12 05:28:47,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:28:47,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 05:28:47,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:28:47,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 05:28:47,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 05:28:47,664 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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-11-12 05:28:48,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:28:48,374 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2024-11-12 05:28:48,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 05:28:48,374 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 64 [2024-11-12 05:28:48,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:28:48,376 INFO L225 Difference]: With dead ends: 77 [2024-11-12 05:28:48,376 INFO L226 Difference]: Without dead ends: 75 [2024-11-12 05:28:48,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-12 05:28:48,377 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 40 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 05:28:48,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 315 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 05:28:48,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-12 05:28:48,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2024-11-12 05:28:48,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.183673469387755) internal successors, (58), 50 states have internal predecessors, (58), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 05:28:48,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 90 transitions. [2024-11-12 05:28:48,408 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 90 transitions. Word has length 64 [2024-11-12 05:28:48,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:28:48,409 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 90 transitions. [2024-11-12 05:28:48,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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-11-12 05:28:48,412 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2024-11-12 05:28:48,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-12 05:28:48,414 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:28:48,414 INFO L218 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-11-12 05:28:48,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 05:28:48,414 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:28:48,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:28:48,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1278414269, now seen corresponding path program 1 times [2024-11-12 05:28:48,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:28:48,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376589743] [2024-11-12 05:28:48,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:28:48,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:28:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:49,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:28:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:49,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:28:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:49,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:28:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:49,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:28:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:49,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:28:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:49,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 05:28:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:49,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 05:28:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:49,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 05:28:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:49,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 05:28:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:49,547 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 05:28:49,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:28:49,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376589743] [2024-11-12 05:28:49,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376589743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:28:49,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:28:49,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 05:28:49,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138261474] [2024-11-12 05:28:49,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:28:49,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 05:28:49,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:28:49,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 05:28:49,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 05:28:49,549 INFO L87 Difference]: Start difference. First operand 69 states and 90 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-11-12 05:28:50,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:28:50,049 INFO L93 Difference]: Finished difference Result 88 states and 109 transitions. [2024-11-12 05:28:50,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 05:28:50,049 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 65 [2024-11-12 05:28:50,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:28:50,051 INFO L225 Difference]: With dead ends: 88 [2024-11-12 05:28:50,051 INFO L226 Difference]: Without dead ends: 86 [2024-11-12 05:28:50,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-12 05:28:50,052 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 63 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 05:28:50,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 297 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 05:28:50,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-12 05:28:50,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 66. [2024-11-12 05:28:50,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 46 states have (on average 1.173913043478261) internal successors, (54), 47 states have internal predecessors, (54), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-12 05:28:50,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 86 transitions. [2024-11-12 05:28:50,073 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 86 transitions. Word has length 65 [2024-11-12 05:28:50,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:28:50,074 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 86 transitions. [2024-11-12 05:28:50,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-11-12 05:28:50,081 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 86 transitions. [2024-11-12 05:28:50,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-12 05:28:50,082 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:28:50,082 INFO L218 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-11-12 05:28:50,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 05:28:50,082 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:28:50,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:28:50,084 INFO L85 PathProgramCache]: Analyzing trace with hash 434558742, now seen corresponding path program 1 times [2024-11-12 05:28:50,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:28:50,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202006257] [2024-11-12 05:28:50,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:28:50,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:28:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 05:28:50,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [970979059] [2024-11-12 05:28:50,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:28:50,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:28:50,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:28:50,144 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 05:28:50,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 05:28:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:28:50,210 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 05:28:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:28:50,309 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 05:28:50,309 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 05:28:50,310 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 05:28:50,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 05:28:50,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:28:50,523 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-12 05:28:50,589 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 05:28:50,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:28:50 BoogieIcfgContainer [2024-11-12 05:28:50,595 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 05:28:50,596 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 05:28:50,596 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 05:28:50,596 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 05:28:50,597 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:28:45" (3/4) ... [2024-11-12 05:28:50,599 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 05:28:50,603 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 05:28:50,604 INFO L158 Benchmark]: Toolchain (without parser) took 6038.75ms. Allocated memory was 165.7MB in the beginning and 283.1MB in the end (delta: 117.4MB). Free memory was 93.9MB in the beginning and 235.7MB in the end (delta: -141.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:28:50,607 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 165.7MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:28:50,608 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.17ms. Allocated memory is still 165.7MB. Free memory was 93.3MB in the beginning and 79.2MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 05:28:50,608 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.31ms. Allocated memory is still 165.7MB. Free memory was 79.2MB in the beginning and 77.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 05:28:50,608 INFO L158 Benchmark]: Boogie Preprocessor took 84.34ms. Allocated memory is still 165.7MB. Free memory was 77.1MB in the beginning and 74.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 05:28:50,608 INFO L158 Benchmark]: RCFGBuilder took 430.49ms. Allocated memory is still 165.7MB. Free memory was 74.0MB in the beginning and 58.8MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 05:28:50,609 INFO L158 Benchmark]: TraceAbstraction took 5114.92ms. Allocated memory was 165.7MB in the beginning and 283.1MB in the end (delta: 117.4MB). Free memory was 58.3MB in the beginning and 235.7MB in the end (delta: -177.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:28:50,609 INFO L158 Benchmark]: Witness Printer took 7.36ms. Allocated memory is still 283.1MB. Free memory is still 235.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:28:50,610 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.16ms. Allocated memory is still 165.7MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.17ms. Allocated memory is still 165.7MB. Free memory was 93.3MB in the beginning and 79.2MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.31ms. Allocated memory is still 165.7MB. Free memory was 79.2MB in the beginning and 77.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.34ms. Allocated memory is still 165.7MB. Free memory was 77.1MB in the beginning and 74.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 430.49ms. Allocated memory is still 165.7MB. Free memory was 74.0MB in the beginning and 58.8MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5114.92ms. Allocated memory was 165.7MB in the beginning and 283.1MB in the end (delta: 117.4MB). Free memory was 58.3MB in the beginning and 235.7MB in the end (delta: -177.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 7.36ms. Allocated memory is still 283.1MB. Free memory is still 235.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 85. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] unsigned char var_1_7 = 1; [L24] signed char var_1_8 = -32; [L25] signed char var_1_9 = -8; [L26] unsigned char var_1_10 = 2; [L27] double var_1_11 = 15.6; [L28] double var_1_12 = 15.4; [L29] double var_1_13 = 32.2; [L30] unsigned char var_1_14 = 5; [L31] unsigned short int last_1_var_1_1 = 32; [L32] signed char last_1_var_1_8 = -32; [L33] unsigned char last_1_var_1_10 = 2; VAL [isInitial=0, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=-8] [L89] isInitial = 1 [L90] FCALL initially() [L91] COND TRUE 1 [L92] CALL updateLastVariables() [L80] last_1_var_1_1 = var_1_1 [L81] last_1_var_1_8 = var_1_8 [L82] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=-8] [L92] RET updateLastVariables() [L93] CALL updateVariables() [L63] var_1_7 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_8=-32, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_8=-32, var_1_9=-8] [L64] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_8=-32, var_1_9=-8] [L65] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=-8] [L65] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=-8] [L66] var_1_9 = __VERIFIER_nondet_char() [L67] CALL assume_abort_if_not(var_1_9 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L67] RET assume_abort_if_not(var_1_9 >= -126) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L68] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L68] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_11=78/5, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L69] var_1_11 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L70] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_12=77/5, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L71] var_1_12 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L72] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_13=161/5, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L73] var_1_13 = __VERIFIER_nondet_double() [L74] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L74] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=5, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L75] var_1_14 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L76] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L77] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=0, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=0, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L77] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=0, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L93] RET updateVariables() [L94] CALL step() [L37] signed long int stepLocal_2 = (((last_1_var_1_8) < (last_1_var_1_8)) ? (last_1_var_1_8) : (last_1_var_1_8)); [L38] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, stepLocal_1=1, stepLocal_2=-32, var_1_10=2, var_1_14=0, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L39] COND TRUE ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) <= var_1_13 VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, stepLocal_1=1, stepLocal_2=-32, var_1_10=2, var_1_14=0, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L40] COND FALSE !(stepLocal_1 && (last_1_var_1_8 >= var_1_9)) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, stepLocal_2=-32, var_1_10=2, var_1_14=0, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L48] signed long int stepLocal_0 = ((((- last_1_var_1_10)) > (last_1_var_1_10)) ? ((- last_1_var_1_10)) : (last_1_var_1_10)); VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, stepLocal_0=2, stepLocal_2=-32, var_1_10=2, var_1_14=0, var_1_1=32, var_1_7=1, var_1_8=-32, var_1_9=0] [L49] COND FALSE !(last_1_var_1_10 < stepLocal_0) [L52] var_1_8 = var_1_9 VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, stepLocal_2=-32, var_1_10=2, var_1_14=0, var_1_1=32, var_1_7=1, var_1_8=0, var_1_9=0] [L54] COND FALSE !((var_1_10 + ((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10)))) < (var_1_10 * var_1_8)) [L59] var_1_1 = var_1_10 VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, stepLocal_2=-32, var_1_10=2, var_1_14=0, var_1_1=2, var_1_7=1, var_1_8=0, var_1_9=0] [L94] RET step() [L95] CALL, EXPR property() [L85-L86] return ((((var_1_10 + ((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10)))) < (var_1_10 * var_1_8)) ? (var_1_7 ? (var_1_1 == ((unsigned short int) var_1_10)) : 1) : (var_1_1 == ((unsigned short int) var_1_10))) && ((last_1_var_1_10 < (((((- last_1_var_1_10)) > (last_1_var_1_10)) ? ((- last_1_var_1_10)) : (last_1_var_1_10)))) ? (var_1_8 == ((signed char) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) : (var_1_8 == ((signed char) var_1_9)))) && ((((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) <= var_1_13) ? ((var_1_7 && (last_1_var_1_8 >= var_1_9)) ? ((last_1_var_1_1 <= ((((last_1_var_1_8) < (last_1_var_1_8)) ? (last_1_var_1_8) : (last_1_var_1_8)))) ? (var_1_10 == ((unsigned char) var_1_14)) : 1) : 1) : (var_1_10 == ((unsigned char) var_1_14))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=0, var_1_1=2, var_1_7=1, var_1_8=0, var_1_9=0] [L95] RET, EXPR property() [L95] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=0, var_1_1=2, var_1_7=1, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=2, last_1_var_1_1=32, last_1_var_1_8=-32, var_1_10=2, var_1_14=0, var_1_1=2, var_1_7=1, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 5, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 103 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 103 mSDsluCounter, 756 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 510 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 186 IncrementalHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 246 mSDtfsCounter, 186 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=3, InterpolantAutomatonStates: 20, 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, 4 MinimizatonAttempts, 26 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 387 NumberOfCodeBlocks, 387 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 253 ConstructedInterpolants, 0 QuantifiedInterpolants, 517 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 576/576 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 05:28:50,648 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-21.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 7001a99b958cb5a783d624aa4b4b483c2055b6507029df9ffd20f7aa9d768319 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:28:53,155 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:28:53,287 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 05:28:53,291 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:28:53,292 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:28:53,323 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:28:53,324 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:28:53,324 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:28:53,324 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:28:53,325 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:28:53,325 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:28:53,325 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:28:53,325 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:28:53,326 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:28:53,326 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:28:53,327 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:28:53,327 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:28:53,328 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:28:53,328 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:28:53,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:28:53,328 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:28:53,329 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:28:53,329 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:28:53,329 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 05:28:53,329 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 05:28:53,330 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:28:53,330 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 05:28:53,330 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:28:53,330 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:28:53,331 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:28:53,331 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:28:53,331 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:28:53,331 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:28:53,331 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:28:53,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:28:53,332 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:28:53,332 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:28:53,332 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:28:53,333 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 05:28:53,333 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 05:28:53,333 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:28:53,333 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:28:53,334 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:28:53,334 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:28:53,334 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 -> 7001a99b958cb5a783d624aa4b4b483c2055b6507029df9ffd20f7aa9d768319 [2024-11-12 05:28:53,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:28:53,635 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:28:53,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:28:53,641 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:28:53,642 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:28:53,643 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-21.i [2024-11-12 05:28:55,142 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:28:55,368 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:28:55,369 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-21.i [2024-11-12 05:28:55,377 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffbc65ffb/cce2c98fb33c49ec9cdb3906e9abd2d2/FLAG1ea00dbff [2024-11-12 05:28:55,389 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffbc65ffb/cce2c98fb33c49ec9cdb3906e9abd2d2 [2024-11-12 05:28:55,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:28:55,393 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:28:55,393 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:28:55,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:28:55,401 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:28:55,401 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:28:55" (1/1) ... [2024-11-12 05:28:55,402 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@588eec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:55, skipping insertion in model container [2024-11-12 05:28:55,402 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:28:55" (1/1) ... [2024-11-12 05:28:55,421 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:28:55,608 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-21.i[915,928] [2024-11-12 05:28:55,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:28:55,691 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:28:55,701 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-21.i[915,928] [2024-11-12 05:28:55,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:28:55,742 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:28:55,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:55 WrapperNode [2024-11-12 05:28:55,742 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:28:55,743 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:28:55,743 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:28:55,743 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:28:55,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:55" (1/1) ... [2024-11-12 05:28:55,764 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:55" (1/1) ... [2024-11-12 05:28:55,788 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2024-11-12 05:28:55,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:28:55,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:28:55,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:28:55,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:28:55,800 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:55" (1/1) ... [2024-11-12 05:28:55,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:55" (1/1) ... [2024-11-12 05:28:55,805 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:55" (1/1) ... [2024-11-12 05:28:55,820 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 05:28:55,821 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:55" (1/1) ... [2024-11-12 05:28:55,821 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:55" (1/1) ... [2024-11-12 05:28:55,830 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:55" (1/1) ... [2024-11-12 05:28:55,836 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:55" (1/1) ... [2024-11-12 05:28:55,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:55" (1/1) ... [2024-11-12 05:28:55,843 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:55" (1/1) ... [2024-11-12 05:28:55,845 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:28:55,846 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:28:55,849 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:28:55,849 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:28:55,850 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:55" (1/1) ... [2024-11-12 05:28:55,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:28:55,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:28:55,909 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:28:55,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:28:55,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:28:55,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 05:28:55,980 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:28:55,984 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:28:55,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:28:55,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:28:56,074 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:28:56,076 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:28:56,498 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-12 05:28:56,498 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:28:56,515 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:28:56,515 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:28:56,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:28:56 BoogieIcfgContainer [2024-11-12 05:28:56,527 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:28:56,529 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:28:56,529 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:28:56,533 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:28:56,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:28:55" (1/3) ... [2024-11-12 05:28:56,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b146ea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:28:56, skipping insertion in model container [2024-11-12 05:28:56,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:28:55" (2/3) ... [2024-11-12 05:28:56,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b146ea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:28:56, skipping insertion in model container [2024-11-12 05:28:56,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:28:56" (3/3) ... [2024-11-12 05:28:56,535 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-21.i [2024-11-12 05:28:56,548 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:28:56,549 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:28:56,596 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:28:56,601 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;@28b9dd2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:28:56,601 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:28:56,605 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 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-11-12 05:28:56,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-12 05:28:56,611 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:28:56,612 INFO L218 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] [2024-11-12 05:28:56,612 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:28:56,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:28:56,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1174544175, now seen corresponding path program 1 times [2024-11-12 05:28:56,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:28:56,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1339270204] [2024-11-12 05:28:56,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:28:56,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:28:56,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:28:56,630 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:28:56,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 05:28:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:56,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 05:28:56,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:28:56,767 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-12 05:28:56,767 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:28:56,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:28:56,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1339270204] [2024-11-12 05:28:56,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1339270204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:28:56,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:28:56,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:28:56,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568656655] [2024-11-12 05:28:56,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:28:56,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:28:56,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:28:56,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:28:56,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:28:56,792 INFO L87 Difference]: Start difference. First operand has 41 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 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 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 05:28:56,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:28:56,809 INFO L93 Difference]: Finished difference Result 75 states and 119 transitions. [2024-11-12 05:28:56,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:28:56,811 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2024-11-12 05:28:56,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:28:56,816 INFO L225 Difference]: With dead ends: 75 [2024-11-12 05:28:56,816 INFO L226 Difference]: Without dead ends: 37 [2024-11-12 05:28:56,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:28:56,821 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:28:56,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:28:56,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-12 05:28:56,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-12 05:28:56,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 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-11-12 05:28:56,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2024-11-12 05:28:56,849 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 64 [2024-11-12 05:28:56,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:28:56,849 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2024-11-12 05:28:56,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 05:28:56,849 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2024-11-12 05:28:56,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-12 05:28:56,851 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:28:56,851 INFO L218 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] [2024-11-12 05:28:56,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 05:28:57,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:28:57,053 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:28:57,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:28:57,054 INFO L85 PathProgramCache]: Analyzing trace with hash -562669323, now seen corresponding path program 1 times [2024-11-12 05:28:57,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:28:57,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118753756] [2024-11-12 05:28:57,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:28:57,055 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:28:57,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:28:57,057 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:28:57,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 05:28:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:57,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 05:28:57,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:28:57,404 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 05:28:57,405 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:28:57,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:28:57,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [118753756] [2024-11-12 05:28:57,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [118753756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:28:57,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:28:57,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 05:28:57,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804378506] [2024-11-12 05:28:57,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:28:57,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 05:28:57,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:28:57,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 05:28:57,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:28:57,411 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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-11-12 05:28:57,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:28:57,613 INFO L93 Difference]: Finished difference Result 116 states and 161 transitions. [2024-11-12 05:28:57,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 05:28:57,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 64 [2024-11-12 05:28:57,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:28:57,620 INFO L225 Difference]: With dead ends: 116 [2024-11-12 05:28:57,620 INFO L226 Difference]: Without dead ends: 82 [2024-11-12 05:28:57,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 05:28:57,621 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 45 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:28:57,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 167 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 05:28:57,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-12 05:28:57,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 71. [2024-11-12 05:28:57,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.26) internal successors, (63), 50 states have internal predecessors, (63), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 05:28:57,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2024-11-12 05:28:57,647 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 99 transitions. Word has length 64 [2024-11-12 05:28:57,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:28:57,648 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 99 transitions. [2024-11-12 05:28:57,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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-11-12 05:28:57,648 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 99 transitions. [2024-11-12 05:28:57,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-12 05:28:57,651 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:28:57,651 INFO L218 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] [2024-11-12 05:28:57,657 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 (3)] Ended with exit code 0 [2024-11-12 05:28:57,851 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-11-12 05:28:57,853 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:28:57,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:28:57,856 INFO L85 PathProgramCache]: Analyzing trace with hash -505411021, now seen corresponding path program 1 times [2024-11-12 05:28:57,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:28:57,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1188130011] [2024-11-12 05:28:57,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:28:57,857 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:28:57,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:28:57,860 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-11-12 05:28:57,861 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-11-12 05:28:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:28:58,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 05:28:58,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:29:30,302 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 05:29:30,303 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:29:30,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:29:30,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1188130011] [2024-11-12 05:29:30,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1188130011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:29:30,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:29:30,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 05:29:30,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517501652] [2024-11-12 05:29:30,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:29:30,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 05:29:30,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:29:30,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 05:29:30,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 05:29:30,320 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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-11-12 05:29:30,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:29:30,912 INFO L93 Difference]: Finished difference Result 124 states and 167 transitions. [2024-11-12 05:29:30,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 05:29:30,914 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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 64 [2024-11-12 05:29:30,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:29:30,916 INFO L225 Difference]: With dead ends: 124 [2024-11-12 05:29:30,916 INFO L226 Difference]: Without dead ends: 122 [2024-11-12 05:29:30,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-12 05:29:30,917 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 64 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 05:29:30,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 215 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 05:29:30,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-12 05:29:30,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 101. [2024-11-12 05:29:30,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 states have internal predecessors, (87), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 05:29:30,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 141 transitions. [2024-11-12 05:29:30,931 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 141 transitions. Word has length 64 [2024-11-12 05:29:30,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:29:30,931 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 141 transitions. [2024-11-12 05:29:30,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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-11-12 05:29:30,931 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 141 transitions. [2024-11-12 05:29:30,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-12 05:29:30,932 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:29:30,932 INFO L218 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-11-12 05:29:30,939 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-11-12 05:29:31,133 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-11-12 05:29:31,133 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:29:31,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:29:31,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1278414269, now seen corresponding path program 1 times [2024-11-12 05:29:31,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:29:31,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1483270652] [2024-11-12 05:29:31,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:29:31,136 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:29:31,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:29:31,142 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-11-12 05:29:31,143 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-11-12 05:29:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:31,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 05:29:31,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:29:44,450 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 05:29:44,450 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:29:44,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:29:44,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1483270652] [2024-11-12 05:29:44,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1483270652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:29:44,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:29:44,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 05:29:44,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430639508] [2024-11-12 05:29:44,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:29:44,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 05:29:44,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:29:44,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 05:29:44,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-12 05:29:44,452 INFO L87 Difference]: Start difference. First operand 101 states and 141 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 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-11-12 05:29:44,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:29:44,823 INFO L93 Difference]: Finished difference Result 129 states and 172 transitions. [2024-11-12 05:29:44,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 05:29:44,828 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 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 65 [2024-11-12 05:29:44,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:29:44,831 INFO L225 Difference]: With dead ends: 129 [2024-11-12 05:29:44,831 INFO L226 Difference]: Without dead ends: 127 [2024-11-12 05:29:44,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-12 05:29:44,832 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 62 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:29:44,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 225 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 05:29:44,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-12 05:29:44,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 102. [2024-11-12 05:29:44,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 71 states have internal predecessors, (89), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 05:29:44,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 143 transitions. [2024-11-12 05:29:44,859 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 143 transitions. Word has length 65 [2024-11-12 05:29:44,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:29:44,860 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 143 transitions. [2024-11-12 05:29:44,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 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-11-12 05:29:44,860 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 143 transitions. [2024-11-12 05:29:44,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-12 05:29:44,861 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:29:44,861 INFO L218 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-11-12 05:29:44,867 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-11-12 05:29:45,063 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 [2024-11-12 05:29:45,064 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:29:45,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:29:45,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1276567227, now seen corresponding path program 1 times [2024-11-12 05:29:45,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:29:45,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137815704] [2024-11-12 05:29:45,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:29:45,065 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:29:45,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:29:45,068 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:29:45,069 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 (6)] Waiting until timeout for monitored process [2024-11-12 05:29:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:29:45,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 05:29:45,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:30:13,090 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-12 05:30:13,090 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:30:13,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:30:13,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137815704] [2024-11-12 05:30:13,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137815704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:30:13,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:30:13,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 05:30:13,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388166508] [2024-11-12 05:30:13,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:30:13,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 05:30:13,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:30:13,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 05:30:13,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-12 05:30:13,093 INFO L87 Difference]: Start difference. First operand 102 states and 143 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 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-11-12 05:30:13,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:30:13,650 INFO L93 Difference]: Finished difference Result 127 states and 170 transitions. [2024-11-12 05:30:13,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 05:30:13,654 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 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 65 [2024-11-12 05:30:13,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:30:13,658 INFO L225 Difference]: With dead ends: 127 [2024-11-12 05:30:13,658 INFO L226 Difference]: Without dead ends: 125 [2024-11-12 05:30:13,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-12 05:30:13,660 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 54 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 05:30:13,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 232 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 05:30:13,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-12 05:30:13,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 102. [2024-11-12 05:30:13,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 71 states have internal predecessors, (89), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 05:30:13,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 143 transitions. [2024-11-12 05:30:13,689 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 143 transitions. Word has length 65 [2024-11-12 05:30:13,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:30:13,689 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 143 transitions. [2024-11-12 05:30:13,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 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-11-12 05:30:13,690 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 143 transitions. [2024-11-12 05:30:13,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-12 05:30:13,690 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:30:13,690 INFO L218 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-11-12 05:30:13,707 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 (6)] Ended with exit code 0 [2024-11-12 05:30:13,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:30:13,902 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:30:13,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:30:13,903 INFO L85 PathProgramCache]: Analyzing trace with hash 434558742, now seen corresponding path program 1 times [2024-11-12 05:30:13,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:30:13,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [55978249] [2024-11-12 05:30:13,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:30:13,903 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:30:13,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:30:13,905 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-11-12 05:30:13,910 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-11-12 05:30:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:30:13,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 05:30:14,006 INFO L279 TraceCheckSpWp]: Computing forward predicates...