./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5a58a565ed7a29809aaccd8966118196fec0a697f2fc6db04cc260beeab4df83 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:30:13,634 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:30:13,687 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:30:13,692 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:30:13,693 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:30:13,706 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:30:13,706 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:30:13,706 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:30:13,707 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:30:13,709 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:30:13,710 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:30:13,710 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:30:13,710 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:30:13,711 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:30:13,711 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:30:13,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:30:13,712 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:30:13,712 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:30:13,712 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:30:13,712 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:30:13,712 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:30:13,713 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:30:13,713 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:30:13,713 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:30:13,714 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:30:13,714 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:30:13,714 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:30:13,714 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:30:13,714 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:30:13,714 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:30:13,715 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:30:13,715 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:30:13,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:30:13,716 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:30:13,716 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:30:13,716 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:30:13,716 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:30:13,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:30:13,717 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:30:13,717 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:30:13,717 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:30:13,717 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:30:13,717 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5a58a565ed7a29809aaccd8966118196fec0a697f2fc6db04cc260beeab4df83 [2024-10-10 22:30:13,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:30:13,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:30:13,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:30:13,960 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:30:13,961 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:30:13,961 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2024-10-10 22:30:15,133 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:30:15,302 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:30:15,303 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2024-10-10 22:30:15,308 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fe9e79fd8/044ecb11e81d4f858997efdb417578fd/FLAG1f55dd803 [2024-10-10 22:30:15,724 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fe9e79fd8/044ecb11e81d4f858997efdb417578fd [2024-10-10 22:30:15,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:30:15,727 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:30:15,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:30:15,730 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:30:15,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:30:15,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:30:15" (1/1) ... [2024-10-10 22:30:15,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5826d1b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:15, skipping insertion in model container [2024-10-10 22:30:15,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:30:15" (1/1) ... [2024-10-10 22:30:15,750 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:30:15,871 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c[838,851] [2024-10-10 22:30:15,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:30:15,884 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:30:15,896 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c[838,851] [2024-10-10 22:30:15,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:30:15,909 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:30:15,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:15 WrapperNode [2024-10-10 22:30:15,909 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:30:15,910 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:30:15,910 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:30:15,911 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:30:15,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:15" (1/1) ... [2024-10-10 22:30:15,919 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:15" (1/1) ... [2024-10-10 22:30:15,931 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2024-10-10 22:30:15,932 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:30:15,933 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:30:15,933 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:30:15,933 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:30:15,940 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:15" (1/1) ... [2024-10-10 22:30:15,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:15" (1/1) ... [2024-10-10 22:30:15,941 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:15" (1/1) ... [2024-10-10 22:30:15,952 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 22:30:15,953 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:15" (1/1) ... [2024-10-10 22:30:15,953 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:15" (1/1) ... [2024-10-10 22:30:15,955 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:15" (1/1) ... [2024-10-10 22:30:15,957 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:15" (1/1) ... [2024-10-10 22:30:15,957 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:15" (1/1) ... [2024-10-10 22:30:15,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:15" (1/1) ... [2024-10-10 22:30:15,958 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:30:15,959 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:30:15,959 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:30:15,959 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:30:15,960 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:15" (1/1) ... [2024-10-10 22:30:15,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:30:15,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:15,984 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:30:15,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:30:16,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:30:16,025 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2024-10-10 22:30:16,025 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2024-10-10 22:30:16,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:30:16,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:30:16,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:30:16,077 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:30:16,078 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:30:16,157 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-10-10 22:30:16,158 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:30:16,174 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:30:16,175 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-10 22:30:16,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:30:16 BoogieIcfgContainer [2024-10-10 22:30:16,175 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:30:16,177 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:30:16,177 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:30:16,185 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:30:16,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:30:15" (1/3) ... [2024-10-10 22:30:16,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f35424b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:30:16, skipping insertion in model container [2024-10-10 22:30:16,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:15" (2/3) ... [2024-10-10 22:30:16,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f35424b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:30:16, skipping insertion in model container [2024-10-10 22:30:16,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:30:16" (3/3) ... [2024-10-10 22:30:16,188 INFO L112 eAbstractionObserver]: Analyzing ICFG recHanoi03-1.c [2024-10-10 22:30:16,200 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:30:16,200 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:30:16,253 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:30:16,258 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;@56efa87d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:30:16,258 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:30:16,261 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-10 22:30:16,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-10 22:30:16,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:16,267 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:16,267 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:16,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:16,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1798873477, now seen corresponding path program 1 times [2024-10-10 22:30:16,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:16,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518608869] [2024-10-10 22:30:16,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:16,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:16,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-10 22:30:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:16,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:30:16,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:16,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518608869] [2024-10-10 22:30:16,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518608869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:16,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:16,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-10 22:30:16,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640654493] [2024-10-10 22:30:16,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:16,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 22:30:16,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:16,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 22:30:16,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:30:16,582 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-10 22:30:16,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:16,625 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2024-10-10 22:30:16,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 22:30:16,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-10 22:30:16,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:16,632 INFO L225 Difference]: With dead ends: 28 [2024-10-10 22:30:16,633 INFO L226 Difference]: Without dead ends: 21 [2024-10-10 22:30:16,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:30:16,637 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:16,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:16,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-10 22:30:16,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-10 22:30:16,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-10 22:30:16,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-10-10 22:30:16,663 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 11 [2024-10-10 22:30:16,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:16,663 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-10-10 22:30:16,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-10 22:30:16,663 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-10-10 22:30:16,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-10 22:30:16,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:16,664 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:16,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:30:16,665 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:16,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:16,665 INFO L85 PathProgramCache]: Analyzing trace with hash 2130927456, now seen corresponding path program 1 times [2024-10-10 22:30:16,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:16,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826797435] [2024-10-10 22:30:16,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:16,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:16,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-10 22:30:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:16,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:30:16,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:16,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826797435] [2024-10-10 22:30:16,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826797435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:16,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:16,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:16,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608546597] [2024-10-10 22:30:16,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:16,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:16,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:16,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:16,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:16,714 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-10 22:30:16,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:16,726 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2024-10-10 22:30:16,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:16,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-10 22:30:16,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:16,727 INFO L225 Difference]: With dead ends: 28 [2024-10-10 22:30:16,728 INFO L226 Difference]: Without dead ends: 24 [2024-10-10 22:30:16,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:16,730 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:16,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 31 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:16,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-10 22:30:16,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2024-10-10 22:30:16,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-10 22:30:16,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-10-10 22:30:16,736 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2024-10-10 22:30:16,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:16,737 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-10-10 22:30:16,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-10 22:30:16,737 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2024-10-10 22:30:16,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-10 22:30:16,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:16,738 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:16,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:30:16,738 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:16,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:16,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1636021444, now seen corresponding path program 1 times [2024-10-10 22:30:16,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:16,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629143270] [2024-10-10 22:30:16,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:16,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-10 22:30:16,751 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-10 22:30:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-10 22:30:16,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-10 22:30:16,771 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-10 22:30:16,773 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 22:30:16,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:30:16,777 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-10 22:30:16,793 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 22:30:16,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 10:30:16 BoogieIcfgContainer [2024-10-10 22:30:16,797 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 22:30:16,798 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 22:30:16,798 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 22:30:16,798 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 22:30:16,798 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:30:16" (3/4) ... [2024-10-10 22:30:16,800 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-10 22:30:16,801 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 22:30:16,802 INFO L158 Benchmark]: Toolchain (without parser) took 1075.00ms. Allocated memory is still 174.1MB. Free memory was 144.4MB in the beginning and 105.6MB in the end (delta: 38.9MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. [2024-10-10 22:30:16,803 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 107.0MB. Free memory is still 78.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:30:16,803 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.46ms. Allocated memory is still 174.1MB. Free memory was 144.4MB in the beginning and 132.3MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 22:30:16,804 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.78ms. Allocated memory is still 174.1MB. Free memory was 132.3MB in the beginning and 131.5MB in the end (delta: 853.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:30:16,807 INFO L158 Benchmark]: Boogie Preprocessor took 26.09ms. Allocated memory is still 174.1MB. Free memory was 131.5MB in the beginning and 129.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-10 22:30:16,808 INFO L158 Benchmark]: RCFGBuilder took 216.23ms. Allocated memory is still 174.1MB. Free memory was 129.4MB in the beginning and 117.8MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 22:30:16,808 INFO L158 Benchmark]: TraceAbstraction took 620.46ms. Allocated memory is still 174.1MB. Free memory was 116.8MB in the beginning and 105.6MB in the end (delta: 11.2MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2024-10-10 22:30:16,808 INFO L158 Benchmark]: Witness Printer took 4.00ms. Allocated memory is still 174.1MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:30:16,809 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.12ms. Allocated memory is still 107.0MB. Free memory is still 78.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.46ms. Allocated memory is still 174.1MB. Free memory was 144.4MB in the beginning and 132.3MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.78ms. Allocated memory is still 174.1MB. Free memory was 132.3MB in the beginning and 131.5MB in the end (delta: 853.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.09ms. Allocated memory is still 174.1MB. Free memory was 131.5MB in the beginning and 129.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 216.23ms. Allocated memory is still 174.1MB. Free memory was 129.4MB in the beginning and 117.8MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 620.46ms. Allocated memory is still 174.1MB. Free memory was 116.8MB in the beginning and 105.6MB in the end (delta: 11.2MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * Witness Printer took 4.00ms. Allocated memory is still 174.1MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 36]: 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 shiftLeft at line 33. Possible FailurePath: [L27] int n = __VERIFIER_nondet_int(); [L28] COND FALSE !(n < 1) VAL [n=1] [L31] CALL, EXPR hanoi(n) VAL [\old(n)=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1] [L31] RET, EXPR hanoi(n) VAL [n=1] [L31] unsigned result = hanoi(n); [L33] result+1>0 && result+1 == 1<0 && result+1 == 1<0 && result+1 == 1< main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5a58a565ed7a29809aaccd8966118196fec0a697f2fc6db04cc260beeab4df83 [2024-10-10 22:30:18,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:30:18,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:30:18,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:30:18,939 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:30:18,939 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:30:18,940 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2024-10-10 22:30:20,160 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:30:20,301 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:30:20,301 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c [2024-10-10 22:30:20,311 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cb7eb20e9/d8925477e4b9472b8b76db487bb860cc/FLAGed346c763 [2024-10-10 22:30:20,324 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cb7eb20e9/d8925477e4b9472b8b76db487bb860cc [2024-10-10 22:30:20,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:30:20,327 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:30:20,330 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:30:20,330 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:30:20,334 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:30:20,335 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:30:20" (1/1) ... [2024-10-10 22:30:20,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e99512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:20, skipping insertion in model container [2024-10-10 22:30:20,336 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:30:20" (1/1) ... [2024-10-10 22:30:20,363 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:30:20,498 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c[838,851] [2024-10-10 22:30:20,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:30:20,513 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:30:20,525 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-regression/recHanoi03-1.c[838,851] [2024-10-10 22:30:20,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:30:20,539 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:30:20,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:20 WrapperNode [2024-10-10 22:30:20,539 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:30:20,540 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:30:20,540 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:30:20,540 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:30:20,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:20" (1/1) ... [2024-10-10 22:30:20,552 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:20" (1/1) ... [2024-10-10 22:30:20,563 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2024-10-10 22:30:20,564 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:30:20,564 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:30:20,565 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:30:20,565 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:30:20,572 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:20" (1/1) ... [2024-10-10 22:30:20,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:20" (1/1) ... [2024-10-10 22:30:20,574 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:20" (1/1) ... [2024-10-10 22:30:20,583 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 22:30:20,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:20" (1/1) ... [2024-10-10 22:30:20,583 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:20" (1/1) ... [2024-10-10 22:30:20,587 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:20" (1/1) ... [2024-10-10 22:30:20,589 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:20" (1/1) ... [2024-10-10 22:30:20,592 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:20" (1/1) ... [2024-10-10 22:30:20,593 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:20" (1/1) ... [2024-10-10 22:30:20,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:30:20,594 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:30:20,595 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:30:20,595 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:30:20,596 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:20" (1/1) ... [2024-10-10 22:30:20,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:30:20,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:20,623 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:30:20,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:30:20,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:30:20,661 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2024-10-10 22:30:20,661 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2024-10-10 22:30:20,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:30:20,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:30:20,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-10 22:30:20,710 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:30:20,712 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:30:20,809 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-10 22:30:20,810 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:30:20,840 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:30:20,840 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-10 22:30:20,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:30:20 BoogieIcfgContainer [2024-10-10 22:30:20,840 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:30:20,842 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:30:20,842 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:30:20,845 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:30:20,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:30:20" (1/3) ... [2024-10-10 22:30:20,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b1b3dcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:30:20, skipping insertion in model container [2024-10-10 22:30:20,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:20" (2/3) ... [2024-10-10 22:30:20,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b1b3dcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:30:20, skipping insertion in model container [2024-10-10 22:30:20,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:30:20" (3/3) ... [2024-10-10 22:30:20,848 INFO L112 eAbstractionObserver]: Analyzing ICFG recHanoi03-1.c [2024-10-10 22:30:20,859 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:30:20,860 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:30:20,909 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:30:20,916 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;@1b93010, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:30:20,916 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:30:20,919 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-10 22:30:20,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-10 22:30:20,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:20,925 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:20,925 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:20,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:20,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1546859687, now seen corresponding path program 1 times [2024-10-10 22:30:20,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:20,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273119475] [2024-10-10 22:30:20,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:20,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:20,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:20,943 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:20,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-10 22:30:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:20,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-10 22:30:20,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:21,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:30:21,155 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:21,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:21,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273119475] [2024-10-10 22:30:21,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273119475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:21,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:21,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-10 22:30:21,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909035218] [2024-10-10 22:30:21,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:21,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 22:30:21,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:21,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 22:30:21,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:30:21,179 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-10 22:30:21,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:21,263 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2024-10-10 22:30:21,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 22:30:21,265 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-10 22:30:21,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:21,271 INFO L225 Difference]: With dead ends: 23 [2024-10-10 22:30:21,271 INFO L226 Difference]: Without dead ends: 15 [2024-10-10 22:30:21,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:30:21,279 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 4 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:21,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 23 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:21,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-10 22:30:21,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-10 22:30:21,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:30:21,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-10-10 22:30:21,311 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2024-10-10 22:30:21,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:21,311 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-10-10 22:30:21,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-10 22:30:21,312 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-10-10 22:30:21,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-10 22:30:21,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:21,313 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:21,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-10 22:30:21,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:21,515 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:21,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:21,515 INFO L85 PathProgramCache]: Analyzing trace with hash -797183849, now seen corresponding path program 1 times [2024-10-10 22:30:21,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:21,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [258452789] [2024-10-10 22:30:21,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:21,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:21,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:21,517 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:21,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-10 22:30:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:21,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-10 22:30:21,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:21,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-10 22:30:21,691 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:22,055 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-10 22:30:22,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:22,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [258452789] [2024-10-10 22:30:22,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [258452789] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:22,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:30:22,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-10-10 22:30:22,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498456923] [2024-10-10 22:30:22,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:22,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-10 22:30:22,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:22,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-10 22:30:22,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-10-10 22:30:22,060 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-10 22:30:22,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:22,306 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2024-10-10 22:30:22,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-10 22:30:22,307 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 16 [2024-10-10 22:30:22,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:22,307 INFO L225 Difference]: With dead ends: 27 [2024-10-10 22:30:22,308 INFO L226 Difference]: Without dead ends: 21 [2024-10-10 22:30:22,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2024-10-10 22:30:22,309 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 8 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:22,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 47 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:22,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-10 22:30:22,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-10 22:30:22,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-10 22:30:22,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-10-10 22:30:22,313 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2024-10-10 22:30:22,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:22,314 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-10-10 22:30:22,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-10 22:30:22,314 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-10-10 22:30:22,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-10 22:30:22,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:22,315 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:22,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-10 22:30:22,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:22,516 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:22,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:22,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1671831511, now seen corresponding path program 2 times [2024-10-10 22:30:22,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:22,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607082249] [2024-10-10 22:30:22,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 22:30:22,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:22,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:22,519 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:22,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-10 22:30:22,540 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 22:30:22,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:30:22,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-10 22:30:22,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:22,742 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-10 22:30:22,742 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:23,562 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:30:23,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:23,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607082249] [2024-10-10 22:30:23,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1607082249] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:23,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:30:23,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2024-10-10 22:30:23,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167246640] [2024-10-10 22:30:23,563 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:23,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-10 22:30:23,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:23,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-10 22:30:23,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2024-10-10 22:30:23,566 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-10 22:30:23,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:23,959 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2024-10-10 22:30:23,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-10 22:30:23,959 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 28 [2024-10-10 22:30:23,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:23,960 INFO L225 Difference]: With dead ends: 33 [2024-10-10 22:30:23,960 INFO L226 Difference]: Without dead ends: 27 [2024-10-10 22:30:23,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=1089, Unknown=0, NotChecked=0, Total=1260 [2024-10-10 22:30:23,962 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 28 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:23,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 93 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:30:23,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-10 22:30:23,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-10 22:30:23,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-10 22:30:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-10-10 22:30:23,966 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 28 [2024-10-10 22:30:23,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:23,967 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-10-10 22:30:23,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-10 22:30:23,967 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2024-10-10 22:30:23,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-10 22:30:23,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:23,968 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:23,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-10 22:30:24,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:24,169 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:24,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:24,170 INFO L85 PathProgramCache]: Analyzing trace with hash -695406825, now seen corresponding path program 3 times [2024-10-10 22:30:24,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:24,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52467937] [2024-10-10 22:30:24,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-10 22:30:24,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:24,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:24,173 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:24,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-10 22:30:24,205 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-10 22:30:24,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:30:24,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-10 22:30:24,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:24,443 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-10 22:30:24,443 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:25,849 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-10 22:30:25,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:25,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52467937] [2024-10-10 22:30:25,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [52467937] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:25,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:30:25,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 36 [2024-10-10 22:30:25,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511842826] [2024-10-10 22:30:25,850 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:25,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-10 22:30:25,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:25,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-10 22:30:25,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1141, Unknown=0, NotChecked=0, Total=1260 [2024-10-10 22:30:25,851 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 36 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 24 states have internal predecessors, (45), 8 states have call successors, (8), 1 states have call predecessors, (8), 12 states have return successors, (12), 12 states have call predecessors, (12), 8 states have call successors, (12) [2024-10-10 22:30:26,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:26,523 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2024-10-10 22:30:26,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-10 22:30:26,525 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 24 states have internal predecessors, (45), 8 states have call successors, (8), 1 states have call predecessors, (8), 12 states have return successors, (12), 12 states have call predecessors, (12), 8 states have call successors, (12) Word has length 40 [2024-10-10 22:30:26,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:26,526 INFO L225 Difference]: With dead ends: 39 [2024-10-10 22:30:26,526 INFO L226 Difference]: Without dead ends: 33 [2024-10-10 22:30:26,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=277, Invalid=2173, Unknown=0, NotChecked=0, Total=2450 [2024-10-10 22:30:26,527 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:26,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 211 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:30:26,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-10 22:30:26,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-10 22:30:26,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-10 22:30:26,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2024-10-10 22:30:26,537 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 40 [2024-10-10 22:30:26,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:26,537 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2024-10-10 22:30:26,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 24 states have internal predecessors, (45), 8 states have call successors, (8), 1 states have call predecessors, (8), 12 states have return successors, (12), 12 states have call predecessors, (12), 8 states have call successors, (12) [2024-10-10 22:30:26,537 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2024-10-10 22:30:26,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-10 22:30:26,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:26,538 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:26,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-10 22:30:26,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:26,739 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:26,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:26,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1239392681, now seen corresponding path program 4 times [2024-10-10 22:30:26,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:26,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997987741] [2024-10-10 22:30:26,740 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-10 22:30:26,740 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:26,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:26,741 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:26,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-10 22:30:26,767 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-10 22:30:26,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:30:26,768 WARN L253 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-10 22:30:26,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:27,087 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-10-10 22:30:27,087 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:29,056 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-10 22:30:29,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:29,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997987741] [2024-10-10 22:30:29,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997987741] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:29,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:30:29,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27] total 46 [2024-10-10 22:30:29,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433683026] [2024-10-10 22:30:29,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:29,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-10-10 22:30:29,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:29,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-10-10 22:30:29,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1913, Unknown=0, NotChecked=0, Total=2070 [2024-10-10 22:30:29,059 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 46 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 30 states have internal predecessors, (57), 10 states have call successors, (10), 1 states have call predecessors, (10), 16 states have return successors, (16), 16 states have call predecessors, (16), 10 states have call successors, (16) [2024-10-10 22:30:29,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:29,908 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2024-10-10 22:30:29,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-10 22:30:29,909 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 30 states have internal predecessors, (57), 10 states have call successors, (10), 1 states have call predecessors, (10), 16 states have return successors, (16), 16 states have call predecessors, (16), 10 states have call successors, (16) Word has length 52 [2024-10-10 22:30:29,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:29,910 INFO L225 Difference]: With dead ends: 45 [2024-10-10 22:30:29,910 INFO L226 Difference]: Without dead ends: 39 [2024-10-10 22:30:29,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=399, Invalid=3633, Unknown=0, NotChecked=0, Total=4032 [2024-10-10 22:30:29,913 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 20 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:29,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 255 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:30:29,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-10 22:30:29,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-10 22:30:29,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 27 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 10 states have return successors, (11), 10 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-10 22:30:29,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2024-10-10 22:30:29,923 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 52 [2024-10-10 22:30:29,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:29,924 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2024-10-10 22:30:29,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 30 states have internal predecessors, (57), 10 states have call successors, (10), 1 states have call predecessors, (10), 16 states have return successors, (16), 16 states have call predecessors, (16), 10 states have call successors, (16) [2024-10-10 22:30:29,924 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2024-10-10 22:30:29,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-10 22:30:29,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:29,926 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:29,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-10 22:30:30,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:30,126 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:30,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:30,127 INFO L85 PathProgramCache]: Analyzing trace with hash -11506281, now seen corresponding path program 5 times [2024-10-10 22:30:30,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:30,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452324770] [2024-10-10 22:30:30,127 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-10 22:30:30,127 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:30,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:30,130 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:30,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-10 22:30:30,173 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2024-10-10 22:30:30,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:30:30,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-10 22:30:30,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:30,537 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-10-10 22:30:30,538 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:33,207 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-10 22:30:33,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:33,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452324770] [2024-10-10 22:30:33,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452324770] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:33,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:30:33,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 33] total 56 [2024-10-10 22:30:33,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584141689] [2024-10-10 22:30:33,207 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:33,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-10-10 22:30:33,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:33,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-10-10 22:30:33,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2885, Unknown=0, NotChecked=0, Total=3080 [2024-10-10 22:30:33,215 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 56 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 36 states have internal predecessors, (69), 12 states have call successors, (12), 1 states have call predecessors, (12), 20 states have return successors, (20), 20 states have call predecessors, (20), 12 states have call successors, (20) [2024-10-10 22:30:34,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:34,415 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2024-10-10 22:30:34,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-10 22:30:34,415 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 36 states have internal predecessors, (69), 12 states have call successors, (12), 1 states have call predecessors, (12), 20 states have return successors, (20), 20 states have call predecessors, (20), 12 states have call successors, (20) Word has length 64 [2024-10-10 22:30:34,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:34,416 INFO L225 Difference]: With dead ends: 51 [2024-10-10 22:30:34,416 INFO L226 Difference]: Without dead ends: 45 [2024-10-10 22:30:34,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=537, Invalid=5469, Unknown=0, NotChecked=0, Total=6006 [2024-10-10 22:30:34,418 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 206 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:34,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 337 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:30:34,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-10 22:30:34,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-10 22:30:34,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 31 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 12 states have return successors, (13), 12 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-10 22:30:34,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2024-10-10 22:30:34,424 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 64 [2024-10-10 22:30:34,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:34,425 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2024-10-10 22:30:34,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 36 states have internal predecessors, (69), 12 states have call successors, (12), 1 states have call predecessors, (12), 20 states have return successors, (20), 20 states have call predecessors, (20), 12 states have call successors, (20) [2024-10-10 22:30:34,425 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2024-10-10 22:30:34,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-10 22:30:34,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:34,427 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:34,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-10 22:30:34,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:34,629 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:34,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:34,629 INFO L85 PathProgramCache]: Analyzing trace with hash 520953047, now seen corresponding path program 6 times [2024-10-10 22:30:34,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:34,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913005165] [2024-10-10 22:30:34,629 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-10 22:30:34,630 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:34,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:34,631 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:34,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-10 22:30:34,678 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2024-10-10 22:30:34,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:30:34,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-10 22:30:34,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:35,105 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-10-10 22:30:35,105 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:38,727 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-10 22:30:38,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:38,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913005165] [2024-10-10 22:30:38,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [913005165] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:38,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:30:38,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 39] total 66 [2024-10-10 22:30:38,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515524741] [2024-10-10 22:30:38,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:38,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-10-10 22:30:38,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:38,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-10-10 22:30:38,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=4057, Unknown=0, NotChecked=0, Total=4290 [2024-10-10 22:30:38,734 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 66 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 42 states have internal predecessors, (81), 14 states have call successors, (14), 1 states have call predecessors, (14), 24 states have return successors, (24), 24 states have call predecessors, (24), 14 states have call successors, (24) [2024-10-10 22:30:40,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:40,391 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2024-10-10 22:30:40,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-10 22:30:40,391 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 42 states have internal predecessors, (81), 14 states have call successors, (14), 1 states have call predecessors, (14), 24 states have return successors, (24), 24 states have call predecessors, (24), 14 states have call successors, (24) Word has length 76 [2024-10-10 22:30:40,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:40,392 INFO L225 Difference]: With dead ends: 57 [2024-10-10 22:30:40,392 INFO L226 Difference]: Without dead ends: 51 [2024-10-10 22:30:40,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=691, Invalid=7681, Unknown=0, NotChecked=0, Total=8372 [2024-10-10 22:30:40,394 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 294 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:40,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 539 Invalid, 1321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:30:40,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-10 22:30:40,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-10 22:30:40,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 14 states have return successors, (15), 14 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-10 22:30:40,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2024-10-10 22:30:40,400 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 76 [2024-10-10 22:30:40,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:40,400 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2024-10-10 22:30:40,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 42 states have internal predecessors, (81), 14 states have call successors, (14), 1 states have call predecessors, (14), 24 states have return successors, (24), 24 states have call predecessors, (24), 14 states have call successors, (24) [2024-10-10 22:30:40,401 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2024-10-10 22:30:40,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-10 22:30:40,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:40,402 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:40,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-10 22:30:40,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:40,602 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:40,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:40,603 INFO L85 PathProgramCache]: Analyzing trace with hash -230265833, now seen corresponding path program 7 times [2024-10-10 22:30:40,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:40,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1008044877] [2024-10-10 22:30:40,603 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-10 22:30:40,603 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:40,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:40,606 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:40,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-10 22:30:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:40,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-10-10 22:30:40,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:41,171 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-10-10 22:30:41,171 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:45,792 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-10 22:30:45,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:45,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1008044877] [2024-10-10 22:30:45,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1008044877] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:45,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:30:45,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 45] total 76 [2024-10-10 22:30:45,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403274617] [2024-10-10 22:30:45,793 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:45,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2024-10-10 22:30:45,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:45,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2024-10-10 22:30:45,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=5429, Unknown=0, NotChecked=0, Total=5700 [2024-10-10 22:30:45,796 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 76 states, 75 states have (on average 1.24) internal successors, (93), 48 states have internal predecessors, (93), 16 states have call successors, (16), 1 states have call predecessors, (16), 28 states have return successors, (28), 28 states have call predecessors, (28), 16 states have call successors, (28) [2024-10-10 22:30:47,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:47,628 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2024-10-10 22:30:47,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-10 22:30:47,628 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 75 states have (on average 1.24) internal successors, (93), 48 states have internal predecessors, (93), 16 states have call successors, (16), 1 states have call predecessors, (16), 28 states have return successors, (28), 28 states have call predecessors, (28), 16 states have call successors, (28) Word has length 88 [2024-10-10 22:30:47,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:47,629 INFO L225 Difference]: With dead ends: 63 [2024-10-10 22:30:47,629 INFO L226 Difference]: Without dead ends: 57 [2024-10-10 22:30:47,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1455 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=861, Invalid=10269, Unknown=0, NotChecked=0, Total=11130 [2024-10-10 22:30:47,632 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 146 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 1460 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:47,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 701 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1460 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:30:47,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-10 22:30:47,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-10-10 22:30:47,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 39 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (17), 16 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-10 22:30:47,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2024-10-10 22:30:47,639 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 88 [2024-10-10 22:30:47,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:47,639 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2024-10-10 22:30:47,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 75 states have (on average 1.24) internal successors, (93), 48 states have internal predecessors, (93), 16 states have call successors, (16), 1 states have call predecessors, (16), 28 states have return successors, (28), 28 states have call predecessors, (28), 16 states have call successors, (28) [2024-10-10 22:30:47,640 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2024-10-10 22:30:47,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-10 22:30:47,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:47,641 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:47,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-10 22:30:47,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:47,841 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:47,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:47,842 INFO L85 PathProgramCache]: Analyzing trace with hash -974365865, now seen corresponding path program 8 times [2024-10-10 22:30:47,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:47,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802759394] [2024-10-10 22:30:47,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 22:30:47,842 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:47,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:47,844 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:47,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-10 22:30:47,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 22:30:47,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:30:47,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-10-10 22:30:47,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:48,499 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2024-10-10 22:30:48,499 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:54,394 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-10 22:30:54,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:54,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802759394] [2024-10-10 22:30:54,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1802759394] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:54,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:30:54,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 51] total 86 [2024-10-10 22:30:54,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048606249] [2024-10-10 22:30:54,395 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:54,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2024-10-10 22:30:54,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:54,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2024-10-10 22:30:54,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=7001, Unknown=0, NotChecked=0, Total=7310 [2024-10-10 22:30:54,400 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 86 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 54 states have internal predecessors, (105), 18 states have call successors, (18), 1 states have call predecessors, (18), 32 states have return successors, (32), 32 states have call predecessors, (32), 18 states have call successors, (32) [2024-10-10 22:30:56,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:56,829 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2024-10-10 22:30:56,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-10 22:30:56,830 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 54 states have internal predecessors, (105), 18 states have call successors, (18), 1 states have call predecessors, (18), 32 states have return successors, (32), 32 states have call predecessors, (32), 18 states have call successors, (32) Word has length 100 [2024-10-10 22:30:56,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:56,831 INFO L225 Difference]: With dead ends: 69 [2024-10-10 22:30:56,831 INFO L226 Difference]: Without dead ends: 63 [2024-10-10 22:30:56,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1870 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1047, Invalid=13233, Unknown=0, NotChecked=0, Total=14280 [2024-10-10 22:30:56,833 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 390 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 1675 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 1864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 1675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:56,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 796 Invalid, 1864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 1675 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 22:30:56,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-10 22:30:56,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-10 22:30:56,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 43 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 18 states have return successors, (19), 18 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-10 22:30:56,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2024-10-10 22:30:56,839 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 100 [2024-10-10 22:30:56,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:56,839 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2024-10-10 22:30:56,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 54 states have internal predecessors, (105), 18 states have call successors, (18), 1 states have call predecessors, (18), 32 states have return successors, (32), 32 states have call predecessors, (32), 18 states have call successors, (32) [2024-10-10 22:30:56,840 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2024-10-10 22:30:56,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-10 22:30:56,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:56,841 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:56,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-10 22:30:57,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:57,041 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:57,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:57,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1458498199, now seen corresponding path program 9 times [2024-10-10 22:30:57,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:57,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49838845] [2024-10-10 22:30:57,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-10 22:30:57,042 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:57,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:57,044 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:57,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-10 22:30:57,130 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2024-10-10 22:30:57,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:30:57,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-10-10 22:30:57,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:57,843 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-10-10 22:30:57,843 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:31:05,216 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-10-10 22:31:05,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:31:05,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [49838845] [2024-10-10 22:31:05,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [49838845] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:31:05,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:31:05,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 57] total 96 [2024-10-10 22:31:05,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993984208] [2024-10-10 22:31:05,217 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:31:05,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2024-10-10 22:31:05,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:31:05,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2024-10-10 22:31:05,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=8773, Unknown=0, NotChecked=0, Total=9120 [2024-10-10 22:31:05,219 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 96 states, 95 states have (on average 1.231578947368421) internal successors, (117), 60 states have internal predecessors, (117), 20 states have call successors, (20), 1 states have call predecessors, (20), 36 states have return successors, (36), 36 states have call predecessors, (36), 20 states have call successors, (36) [2024-10-10 22:31:08,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:08,010 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2024-10-10 22:31:08,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-10 22:31:08,011 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 1.231578947368421) internal successors, (117), 60 states have internal predecessors, (117), 20 states have call successors, (20), 1 states have call predecessors, (20), 36 states have return successors, (36), 36 states have call predecessors, (36), 20 states have call successors, (36) Word has length 112 [2024-10-10 22:31:08,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:08,012 INFO L225 Difference]: With dead ends: 75 [2024-10-10 22:31:08,012 INFO L226 Difference]: Without dead ends: 69 [2024-10-10 22:31:08,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2337 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1249, Invalid=16573, Unknown=0, NotChecked=0, Total=17822 [2024-10-10 22:31:08,013 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 220 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 2035 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 2131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:08,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 932 Invalid, 2131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2035 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 22:31:08,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-10 22:31:08,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-10 22:31:08,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 47 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 20 states have return successors, (21), 20 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-10 22:31:08,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2024-10-10 22:31:08,019 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 112 [2024-10-10 22:31:08,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:08,020 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2024-10-10 22:31:08,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 1.231578947368421) internal successors, (117), 60 states have internal predecessors, (117), 20 states have call successors, (20), 1 states have call predecessors, (20), 36 states have return successors, (36), 36 states have call predecessors, (36), 20 states have call successors, (36) [2024-10-10 22:31:08,020 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2024-10-10 22:31:08,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-10 22:31:08,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:08,021 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:08,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-10 22:31:08,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:31:08,222 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:08,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:08,222 INFO L85 PathProgramCache]: Analyzing trace with hash -767682089, now seen corresponding path program 10 times [2024-10-10 22:31:08,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:31:08,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228272555] [2024-10-10 22:31:08,222 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-10 22:31:08,222 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:31:08,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:31:08,223 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:31:08,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-10 22:31:08,293 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-10 22:31:08,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:31:08,297 WARN L253 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-10-10 22:31:08,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:31:09,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2024-10-10 22:31:09,208 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:31:18,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-10 22:31:18,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:31:18,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1228272555] [2024-10-10 22:31:18,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1228272555] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:31:18,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:31:18,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 63] total 106 [2024-10-10 22:31:18,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342657537] [2024-10-10 22:31:18,361 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:31:18,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2024-10-10 22:31:18,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:31:18,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2024-10-10 22:31:18,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=10745, Unknown=0, NotChecked=0, Total=11130 [2024-10-10 22:31:18,364 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 106 states, 105 states have (on average 1.2285714285714286) internal successors, (129), 66 states have internal predecessors, (129), 22 states have call successors, (22), 1 states have call predecessors, (22), 40 states have return successors, (40), 40 states have call predecessors, (40), 22 states have call successors, (40) [2024-10-10 22:31:21,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:21,788 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2024-10-10 22:31:21,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-10 22:31:21,789 INFO L78 Accepts]: Start accepts. Automaton has has 106 states, 105 states have (on average 1.2285714285714286) internal successors, (129), 66 states have internal predecessors, (129), 22 states have call successors, (22), 1 states have call predecessors, (22), 40 states have return successors, (40), 40 states have call predecessors, (40), 22 states have call successors, (40) Word has length 124 [2024-10-10 22:31:21,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:21,790 INFO L225 Difference]: With dead ends: 81 [2024-10-10 22:31:21,790 INFO L226 Difference]: Without dead ends: 75 [2024-10-10 22:31:21,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2856 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=1467, Invalid=20289, Unknown=0, NotChecked=0, Total=21756 [2024-10-10 22:31:21,791 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 124 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 2689 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 2732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:21,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1224 Invalid, 2732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2689 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 22:31:21,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-10 22:31:21,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-10 22:31:21,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.02) internal successors, (51), 51 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 22 states have return successors, (23), 22 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-10 22:31:21,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2024-10-10 22:31:21,800 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 124 [2024-10-10 22:31:21,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:21,801 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2024-10-10 22:31:21,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 106 states, 105 states have (on average 1.2285714285714286) internal successors, (129), 66 states have internal predecessors, (129), 22 states have call successors, (22), 1 states have call predecessors, (22), 40 states have return successors, (40), 40 states have call predecessors, (40), 22 states have call successors, (40) [2024-10-10 22:31:21,801 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2024-10-10 22:31:21,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-10 22:31:21,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:21,802 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:21,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-10 22:31:22,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:31:22,003 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:22,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:22,003 INFO L85 PathProgramCache]: Analyzing trace with hash -724965097, now seen corresponding path program 11 times [2024-10-10 22:31:22,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:31:22,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958465878] [2024-10-10 22:31:22,004 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-10 22:31:22,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:31:22,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:31:22,005 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:31:22,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-10 22:31:22,122 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2024-10-10 22:31:22,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:31:22,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-10-10 22:31:22,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:31:23,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2024-10-10 22:31:23,095 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:31:34,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 1113 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-10 22:31:34,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:31:34,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958465878] [2024-10-10 22:31:34,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958465878] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:31:34,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:31:34,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 69] total 116 [2024-10-10 22:31:34,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382510087] [2024-10-10 22:31:34,107 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:31:34,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 116 states [2024-10-10 22:31:34,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:31:34,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2024-10-10 22:31:34,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=12917, Unknown=0, NotChecked=0, Total=13340 [2024-10-10 22:31:34,109 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 116 states, 115 states have (on average 1.2260869565217392) internal successors, (141), 72 states have internal predecessors, (141), 24 states have call successors, (24), 1 states have call predecessors, (24), 44 states have return successors, (44), 44 states have call predecessors, (44), 24 states have call successors, (44) [2024-10-10 22:31:38,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:38,293 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2024-10-10 22:31:38,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-10-10 22:31:38,294 INFO L78 Accepts]: Start accepts. Automaton has has 116 states, 115 states have (on average 1.2260869565217392) internal successors, (141), 72 states have internal predecessors, (141), 24 states have call successors, (24), 1 states have call predecessors, (24), 44 states have return successors, (44), 44 states have call predecessors, (44), 24 states have call successors, (44) Word has length 136 [2024-10-10 22:31:38,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:38,295 INFO L225 Difference]: With dead ends: 87 [2024-10-10 22:31:38,295 INFO L226 Difference]: Without dead ends: 81 [2024-10-10 22:31:38,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3427 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=1701, Invalid=24381, Unknown=0, NotChecked=0, Total=26082 [2024-10-10 22:31:38,296 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 930 mSDsluCounter, 1580 mSDsCounter, 0 mSdLazyCounter, 3507 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 956 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 3969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 3507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:38,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [956 Valid, 1607 Invalid, 3969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 3507 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-10 22:31:38,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-10 22:31:38,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-10 22:31:38,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 55 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 24 states have return successors, (25), 24 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-10 22:31:38,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2024-10-10 22:31:38,305 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 136 [2024-10-10 22:31:38,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:38,306 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2024-10-10 22:31:38,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 116 states, 115 states have (on average 1.2260869565217392) internal successors, (141), 72 states have internal predecessors, (141), 24 states have call successors, (24), 1 states have call predecessors, (24), 44 states have return successors, (44), 44 states have call predecessors, (44), 24 states have call successors, (44) [2024-10-10 22:31:38,306 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2024-10-10 22:31:38,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-10 22:31:38,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:38,307 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:38,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-10 22:31:38,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:31:38,508 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:38,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:38,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1803704407, now seen corresponding path program 12 times [2024-10-10 22:31:38,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:31:38,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822323042] [2024-10-10 22:31:38,509 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-10 22:31:38,509 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:31:38,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:31:38,510 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:31:38,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-10 22:31:38,642 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2024-10-10 22:31:38,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:31:38,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-10-10 22:31:38,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:31:39,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-10-10 22:31:39,789 INFO L311 TraceCheckSpWp]: Computing backward predicates...