./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal57.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal57.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2328acd9311a64c53ad5874211f9b9da337dc2131958a2367da03f2374a4827a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 03:47:15,624 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 03:47:15,695 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-24 03:47:15,700 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 03:47:15,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 03:47:15,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 03:47:15,728 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 03:47:15,729 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 03:47:15,729 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 03:47:15,730 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 03:47:15,730 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 03:47:15,730 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 03:47:15,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 03:47:15,732 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 03:47:15,732 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 03:47:15,735 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 03:47:15,735 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 03:47:15,735 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 03:47:15,736 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 03:47:15,736 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 03:47:15,736 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 03:47:15,740 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 03:47:15,741 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 03:47:15,741 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 03:47:15,741 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 03:47:15,741 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 03:47:15,742 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 03:47:15,742 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 03:47:15,742 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 03:47:15,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 03:47:15,743 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 03:47:15,743 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 03:47:15,743 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 03:47:15,743 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 03:47:15,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 03:47:15,744 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 03:47:15,744 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 03:47:15,745 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 03:47:15,746 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 03:47:15,746 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2328acd9311a64c53ad5874211f9b9da337dc2131958a2367da03f2374a4827a [2024-10-24 03:47:15,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 03:47:15,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 03:47:15,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 03:47:16,000 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 03:47:16,000 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 03:47:16,001 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal57.c [2024-10-24 03:47:17,388 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 03:47:17,597 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 03:47:17,597 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal57.c [2024-10-24 03:47:17,608 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be1aa576d/c730085fe09a4a0faf268e96039e3efa/FLAG2996041c1 [2024-10-24 03:47:17,623 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be1aa576d/c730085fe09a4a0faf268e96039e3efa [2024-10-24 03:47:17,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 03:47:17,626 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 03:47:17,628 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 03:47:17,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 03:47:17,633 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 03:47:17,634 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:47:17" (1/1) ... [2024-10-24 03:47:17,635 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5897a1f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:47:17, skipping insertion in model container [2024-10-24 03:47:17,635 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:47:17" (1/1) ... [2024-10-24 03:47:17,675 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 03:47:17,870 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/hardware-verification-bv/btor2c-lazyMod.cal57.c[1245,1258] [2024-10-24 03:47:17,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 03:47:17,945 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 03:47:17,959 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/hardware-verification-bv/btor2c-lazyMod.cal57.c[1245,1258] [2024-10-24 03:47:17,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 03:47:18,014 INFO L204 MainTranslator]: Completed translation [2024-10-24 03:47:18,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:47:18 WrapperNode [2024-10-24 03:47:18,015 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 03:47:18,016 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 03:47:18,016 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 03:47:18,016 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 03:47:18,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:47:18" (1/1) ... [2024-10-24 03:47:18,036 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:47:18" (1/1) ... [2024-10-24 03:47:18,093 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 296 [2024-10-24 03:47:18,094 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 03:47:18,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 03:47:18,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 03:47:18,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 03:47:18,106 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:47:18" (1/1) ... [2024-10-24 03:47:18,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:47:18" (1/1) ... [2024-10-24 03:47:18,121 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:47:18" (1/1) ... [2024-10-24 03:47:18,146 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-24 03:47:18,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:47:18" (1/1) ... [2024-10-24 03:47:18,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:47:18" (1/1) ... [2024-10-24 03:47:18,163 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:47:18" (1/1) ... [2024-10-24 03:47:18,167 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:47:18" (1/1) ... [2024-10-24 03:47:18,171 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:47:18" (1/1) ... [2024-10-24 03:47:18,177 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:47:18" (1/1) ... [2024-10-24 03:47:18,187 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 03:47:18,188 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 03:47:18,189 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 03:47:18,189 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 03:47:18,193 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:47:18" (1/1) ... [2024-10-24 03:47:18,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 03:47:18,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:47:18,238 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 03:47:18,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 03:47:18,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 03:47:18,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 03:47:18,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 03:47:18,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 03:47:18,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 03:47:18,423 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 03:47:18,427 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 03:47:18,952 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2024-10-24 03:47:18,952 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 03:47:18,985 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 03:47:18,985 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 03:47:18,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:47:18 BoogieIcfgContainer [2024-10-24 03:47:18,986 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 03:47:18,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 03:47:18,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 03:47:18,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 03:47:18,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:47:17" (1/3) ... [2024-10-24 03:47:18,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693c762c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:47:18, skipping insertion in model container [2024-10-24 03:47:18,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:47:18" (2/3) ... [2024-10-24 03:47:18,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693c762c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:47:18, skipping insertion in model container [2024-10-24 03:47:18,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:47:18" (3/3) ... [2024-10-24 03:47:18,995 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal57.c [2024-10-24 03:47:19,013 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 03:47:19,013 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 03:47:19,066 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 03:47:19,073 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;@7e9cb33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 03:47:19,073 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 03:47:19,079 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 62 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:47:19,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-24 03:47:19,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:47:19,088 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:47:19,089 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:47:19,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:47:19,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1002870636, now seen corresponding path program 1 times [2024-10-24 03:47:19,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:47:19,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271415778] [2024-10-24 03:47:19,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:47:19,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:47:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:47:19,782 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-24 03:47:19,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:47:19,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271415778] [2024-10-24 03:47:19,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271415778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:47:19,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:47:19,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 03:47:19,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725878252] [2024-10-24 03:47:19,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:47:19,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 03:47:19,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:47:19,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 03:47:19,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 03:47:19,824 INFO L87 Difference]: Start difference. First operand has 63 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 62 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:47:19,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:47:19,881 INFO L93 Difference]: Finished difference Result 110 states and 162 transitions. [2024-10-24 03:47:19,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 03:47:19,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-24 03:47:19,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:47:19,893 INFO L225 Difference]: With dead ends: 110 [2024-10-24 03:47:19,894 INFO L226 Difference]: Without dead ends: 64 [2024-10-24 03:47:19,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 03:47:19,903 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 03:47:19,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 256 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 03:47:19,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-24 03:47:19,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-24 03:47:19,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 63 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:47:19,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 92 transitions. [2024-10-24 03:47:19,973 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 92 transitions. Word has length 26 [2024-10-24 03:47:19,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:47:19,974 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 92 transitions. [2024-10-24 03:47:19,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:47:19,974 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 92 transitions. [2024-10-24 03:47:19,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-24 03:47:19,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:47:19,977 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:47:19,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 03:47:19,978 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:47:19,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:47:19,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1025913940, now seen corresponding path program 1 times [2024-10-24 03:47:19,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:47:19,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868555149] [2024-10-24 03:47:19,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:47:19,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:47:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:47:20,196 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-24 03:47:20,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:47:20,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868555149] [2024-10-24 03:47:20,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868555149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:47:20,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:47:20,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 03:47:20,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267522652] [2024-10-24 03:47:20,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:47:20,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 03:47:20,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:47:20,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 03:47:20,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 03:47:20,203 INFO L87 Difference]: Start difference. First operand 64 states and 92 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:47:20,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:47:20,248 INFO L93 Difference]: Finished difference Result 113 states and 162 transitions. [2024-10-24 03:47:20,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 03:47:20,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-10-24 03:47:20,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:47:20,250 INFO L225 Difference]: With dead ends: 113 [2024-10-24 03:47:20,250 INFO L226 Difference]: Without dead ends: 66 [2024-10-24 03:47:20,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 03:47:20,253 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 03:47:20,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 03:47:20,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-24 03:47:20,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-24 03:47:20,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 65 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:47:20,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 94 transitions. [2024-10-24 03:47:20,263 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 94 transitions. Word has length 27 [2024-10-24 03:47:20,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:47:20,263 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 94 transitions. [2024-10-24 03:47:20,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:47:20,263 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 94 transitions. [2024-10-24 03:47:20,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-24 03:47:20,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:47:20,264 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:47:20,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 03:47:20,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:47:20,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:47:20,266 INFO L85 PathProgramCache]: Analyzing trace with hash 640595269, now seen corresponding path program 1 times [2024-10-24 03:47:20,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:47:20,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186443103] [2024-10-24 03:47:20,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:47:20,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:47:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:47:20,623 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-24 03:47:20,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:47:20,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186443103] [2024-10-24 03:47:20,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186443103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:47:20,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:47:20,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 03:47:20,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285066644] [2024-10-24 03:47:20,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:47:20,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 03:47:20,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:47:20,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 03:47:20,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 03:47:20,631 INFO L87 Difference]: Start difference. First operand 66 states and 94 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:47:20,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:47:20,768 INFO L93 Difference]: Finished difference Result 152 states and 214 transitions. [2024-10-24 03:47:20,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 03:47:20,771 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-24 03:47:20,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:47:20,772 INFO L225 Difference]: With dead ends: 152 [2024-10-24 03:47:20,772 INFO L226 Difference]: Without dead ends: 103 [2024-10-24 03:47:20,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-24 03:47:20,776 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 179 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 03:47:20,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 320 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 03:47:20,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-24 03:47:20,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 84. [2024-10-24 03:47:20,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.4457831325301205) internal successors, (120), 83 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:47:20,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2024-10-24 03:47:20,796 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 28 [2024-10-24 03:47:20,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:47:20,797 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2024-10-24 03:47:20,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:47:20,797 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2024-10-24 03:47:20,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-24 03:47:20,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:47:20,798 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:47:20,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 03:47:20,799 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:47:20,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:47:20,799 INFO L85 PathProgramCache]: Analyzing trace with hash -707496197, now seen corresponding path program 1 times [2024-10-24 03:47:20,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:47:20,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848881209] [2024-10-24 03:47:20,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:47:20,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:47:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:47:21,183 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-24 03:47:21,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:47:21,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848881209] [2024-10-24 03:47:21,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848881209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:47:21,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:47:21,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:47:21,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069452469] [2024-10-24 03:47:21,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:47:21,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 03:47:21,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:47:21,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 03:47:21,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 03:47:21,188 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:47:21,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:47:21,363 INFO L93 Difference]: Finished difference Result 156 states and 219 transitions. [2024-10-24 03:47:21,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 03:47:21,363 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-24 03:47:21,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:47:21,364 INFO L225 Difference]: With dead ends: 156 [2024-10-24 03:47:21,364 INFO L226 Difference]: Without dead ends: 107 [2024-10-24 03:47:21,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-10-24 03:47:21,366 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 189 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 03:47:21,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 455 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 03:47:21,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-24 03:47:21,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 88. [2024-10-24 03:47:21,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 87 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:47:21,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 126 transitions. [2024-10-24 03:47:21,379 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 126 transitions. Word has length 29 [2024-10-24 03:47:21,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:47:21,379 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 126 transitions. [2024-10-24 03:47:21,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:47:21,379 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 126 transitions. [2024-10-24 03:47:21,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-24 03:47:21,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:47:21,382 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:47:21,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 03:47:21,382 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:47:21,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:47:21,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1106999617, now seen corresponding path program 1 times [2024-10-24 03:47:21,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:47:21,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266914248] [2024-10-24 03:47:21,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:47:21,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:47:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:47:21,666 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-24 03:47:21,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:47:21,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266914248] [2024-10-24 03:47:21,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266914248] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:47:21,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:47:21,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:47:21,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105495348] [2024-10-24 03:47:21,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:47:21,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 03:47:21,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:47:21,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 03:47:21,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 03:47:21,669 INFO L87 Difference]: Start difference. First operand 88 states and 126 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:47:21,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:47:21,805 INFO L93 Difference]: Finished difference Result 155 states and 217 transitions. [2024-10-24 03:47:21,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 03:47:21,807 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-10-24 03:47:21,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:47:21,808 INFO L225 Difference]: With dead ends: 155 [2024-10-24 03:47:21,810 INFO L226 Difference]: Without dead ends: 105 [2024-10-24 03:47:21,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-10-24 03:47:21,811 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 182 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 03:47:21,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 468 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 03:47:21,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-24 03:47:21,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2024-10-24 03:47:21,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.441860465116279) internal successors, (124), 86 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:47:21,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2024-10-24 03:47:21,822 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 30 [2024-10-24 03:47:21,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:47:21,823 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2024-10-24 03:47:21,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:47:21,823 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2024-10-24 03:47:21,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-24 03:47:21,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:47:21,825 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:47:21,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 03:47:21,825 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:47:21,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:47:21,826 INFO L85 PathProgramCache]: Analyzing trace with hash -138199198, now seen corresponding path program 1 times [2024-10-24 03:47:21,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:47:21,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284277869] [2024-10-24 03:47:21,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:47:21,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:47:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:47:22,214 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-24 03:47:22,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:47:22,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284277869] [2024-10-24 03:47:22,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284277869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:47:22,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:47:22,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:47:22,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625141682] [2024-10-24 03:47:22,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:47:22,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 03:47:22,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:47:22,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 03:47:22,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 03:47:22,218 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:47:22,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:47:22,395 INFO L93 Difference]: Finished difference Result 154 states and 215 transitions. [2024-10-24 03:47:22,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 03:47:22,396 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-10-24 03:47:22,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:47:22,399 INFO L225 Difference]: With dead ends: 154 [2024-10-24 03:47:22,402 INFO L226 Difference]: Without dead ends: 105 [2024-10-24 03:47:22,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-10-24 03:47:22,403 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 176 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 03:47:22,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 450 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 03:47:22,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-24 03:47:22,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 91. [2024-10-24 03:47:22,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 90 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:47:22,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2024-10-24 03:47:22,417 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 30 [2024-10-24 03:47:22,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:47:22,417 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2024-10-24 03:47:22,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:47:22,417 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2024-10-24 03:47:22,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-24 03:47:22,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:47:22,418 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:47:22,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 03:47:22,422 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:47:22,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:47:22,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1575337402, now seen corresponding path program 1 times [2024-10-24 03:47:22,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:47:22,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394181789] [2024-10-24 03:47:22,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:47:22,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:47:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 03:47:22,461 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 03:47:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 03:47:22,520 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 03:47:22,521 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 03:47:22,522 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 03:47:22,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 03:47:22,527 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:47:22,575 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 03:47:22,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:47:22 BoogieIcfgContainer [2024-10-24 03:47:22,581 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 03:47:22,581 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 03:47:22,581 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 03:47:22,582 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 03:47:22,582 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:47:18" (3/4) ... [2024-10-24 03:47:22,586 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 03:47:22,587 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 03:47:22,590 INFO L158 Benchmark]: Toolchain (without parser) took 4961.81ms. Allocated memory was 184.5MB in the beginning and 249.6MB in the end (delta: 65.0MB). Free memory was 117.0MB in the beginning and 194.9MB in the end (delta: -78.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 03:47:22,590 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 184.5MB. Free memory is still 143.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 03:47:22,591 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.79ms. Allocated memory is still 184.5MB. Free memory was 116.7MB in the beginning and 100.6MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 03:47:22,591 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.10ms. Allocated memory is still 184.5MB. Free memory was 100.6MB in the beginning and 93.9MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 03:47:22,592 INFO L158 Benchmark]: Boogie Preprocessor took 92.89ms. Allocated memory is still 184.5MB. Free memory was 93.9MB in the beginning and 89.2MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 03:47:22,594 INFO L158 Benchmark]: RCFGBuilder took 797.56ms. Allocated memory is still 184.5MB. Free memory was 89.2MB in the beginning and 119.2MB in the end (delta: -30.0MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2024-10-24 03:47:22,594 INFO L158 Benchmark]: TraceAbstraction took 3592.53ms. Allocated memory was 184.5MB in the beginning and 249.6MB in the end (delta: 65.0MB). Free memory was 118.0MB in the beginning and 194.9MB in the end (delta: -76.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 03:47:22,594 INFO L158 Benchmark]: Witness Printer took 6.37ms. Allocated memory is still 249.6MB. Free memory is still 194.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 03:47:22,596 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.19ms. Allocated memory is still 184.5MB. Free memory is still 143.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.79ms. Allocated memory is still 184.5MB. Free memory was 116.7MB in the beginning and 100.6MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.10ms. Allocated memory is still 184.5MB. Free memory was 100.6MB in the beginning and 93.9MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.89ms. Allocated memory is still 184.5MB. Free memory was 93.9MB in the beginning and 89.2MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 797.56ms. Allocated memory is still 184.5MB. Free memory was 89.2MB in the beginning and 119.2MB in the end (delta: -30.0MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3592.53ms. Allocated memory was 184.5MB in the beginning and 249.6MB in the end (delta: 65.0MB). Free memory was 118.0MB in the beginning and 194.9MB in the end (delta: -76.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.37ms. Allocated memory is still 249.6MB. Free memory is still 194.9MB. 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: 21]: 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 bitwiseOr at line 96, overapproximation of bitwiseAnd at line 101. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 3); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (3 - 1); [L32] const SORT_1 var_11 = 0; [L33] const SORT_5 var_15 = 0; [L34] const SORT_5 var_21 = 1; [L35] const SORT_1 var_31 = 1; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L39] SORT_1 input_4; [L40] SORT_5 input_6; [L41] SORT_5 input_7; [L42] SORT_1 input_8; [L43] SORT_5 input_9; [L44] SORT_5 input_10; [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=7, var_11=0, var_15=0, var_21=1, var_31=1] [L46] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=7, var_11=0, var_15=0, var_21=1, var_31=1] [L47] SORT_5 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=7, var_11=0, var_15=0, var_21=1, var_31=1] [L48] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=7, var_11=0, var_15=0, var_21=1, var_31=1] [L49] SORT_5 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L51] SORT_1 init_13_arg_1 = var_11; [L52] state_12 = init_13_arg_1 [L53] SORT_5 init_17_arg_1 = var_15; [L54] state_16 = init_17_arg_1 [L55] SORT_1 init_19_arg_1 = var_11; [L56] state_18 = init_19_arg_1 [L57] SORT_5 init_24_arg_1 = var_15; [L58] state_23 = init_24_arg_1 VAL [mask_SORT_1=1, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_23=0, var_11=0, var_15=0, var_21=1, var_31=1] [L61] input_2 = __VERIFIER_nondet_uchar() [L62] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_23=0, var_11=0, var_15=0, var_21=1, var_31=1] [L62] input_2 = input_2 & mask_SORT_1 [L63] input_3 = __VERIFIER_nondet_uchar() [L64] EXPR input_3 & mask_SORT_1 VAL [input_2=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_23=0, var_11=0, var_15=0, var_21=1, var_31=1] [L64] input_3 = input_3 & mask_SORT_1 [L65] input_4 = __VERIFIER_nondet_uchar() [L66] input_6 = __VERIFIER_nondet_uchar() [L67] input_7 = __VERIFIER_nondet_uchar() [L68] input_8 = __VERIFIER_nondet_uchar() [L69] input_9 = __VERIFIER_nondet_uchar() [L70] input_10 = __VERIFIER_nondet_uchar() [L73] SORT_1 var_14_arg_0 = state_12; [L74] SORT_1 var_14 = ~var_14_arg_0; [L75] SORT_1 var_20_arg_0 = state_18; [L76] SORT_5 var_20_arg_1 = state_16; [L77] SORT_5 var_20_arg_2 = input_7; [L78] SORT_5 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, state_18=0, state_23=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=1, var_31=1] [L79] EXPR var_20 & mask_SORT_5 VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, state_18=0, state_23=0, var_11=0, var_14=-1, var_15=0, var_21=1, var_31=1] [L79] var_20 = var_20 & mask_SORT_5 [L80] SORT_5 var_22_arg_0 = var_20; [L81] SORT_5 var_22_arg_1 = var_21; [L82] SORT_1 var_22 = var_22_arg_0 == var_22_arg_1; [L83] SORT_1 var_25_arg_0 = state_18; [L84] SORT_5 var_25_arg_1 = state_23; [L85] SORT_5 var_25_arg_2 = input_7; [L86] SORT_5 var_25 = var_25_arg_0 ? var_25_arg_1 : var_25_arg_2; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=1, var_22=0, var_25=0, var_31=1] [L87] EXPR var_25 & mask_SORT_5 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=1, var_22=0, var_31=1] [L87] var_25 = var_25 & mask_SORT_5 [L88] SORT_5 var_26_arg_0 = var_25; [L89] SORT_5 var_26_arg_1 = var_21; [L90] SORT_1 var_26 = var_26_arg_0 == var_26_arg_1; [L91] SORT_1 var_27_arg_0 = var_22; [L92] SORT_1 var_27_arg_1 = var_26; [L93] SORT_1 var_27 = var_27_arg_0 == var_27_arg_1; [L94] SORT_1 var_28_arg_0 = var_14; [L95] SORT_1 var_28_arg_1 = var_27; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=1, var_25=0, var_28_arg_0=-1, var_28_arg_1=1, var_31=1] [L96] EXPR var_28_arg_0 | var_28_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=1, var_25=0, var_31=1] [L96] SORT_1 var_28 = var_28_arg_0 | var_28_arg_1; [L97] SORT_1 var_32_arg_0 = var_28; [L98] SORT_1 var_32 = ~var_32_arg_0; [L99] SORT_1 var_33_arg_0 = var_31; [L100] SORT_1 var_33_arg_1 = var_32; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=1, var_25=0, var_31=1, var_33_arg_0=1, var_33_arg_1=-1] [L101] EXPR var_33_arg_0 & var_33_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=1, var_25=0, var_31=1] [L101] SORT_1 var_33 = var_33_arg_0 & var_33_arg_1; [L102] EXPR var_33 & mask_SORT_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=1, var_25=0, var_31=1] [L102] var_33 = var_33 & mask_SORT_1 [L103] SORT_1 bad_34_arg_0 = var_33; [L104] CALL __VERIFIER_assert(!(bad_34_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 726 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 726 mSDsluCounter, 2202 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1722 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 312 IncrementalHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 480 mSDtfsCounter, 312 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=6, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 70 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 201 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 164 ConstructedInterpolants, 0 QuantifiedInterpolants, 643 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 03:47:22,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal57.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2328acd9311a64c53ad5874211f9b9da337dc2131958a2367da03f2374a4827a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 03:47:24,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 03:47:25,009 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-24 03:47:25,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 03:47:25,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 03:47:25,057 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 03:47:25,058 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 03:47:25,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 03:47:25,059 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 03:47:25,060 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 03:47:25,060 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 03:47:25,060 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 03:47:25,061 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 03:47:25,065 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 03:47:25,065 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 03:47:25,065 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 03:47:25,066 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 03:47:25,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 03:47:25,066 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 03:47:25,066 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 03:47:25,067 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 03:47:25,067 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 03:47:25,067 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 03:47:25,069 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 03:47:25,070 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 03:47:25,070 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 03:47:25,070 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 03:47:25,070 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 03:47:25,071 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 03:47:25,071 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 03:47:25,071 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 03:47:25,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 03:47:25,072 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 03:47:25,072 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 03:47:25,072 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 03:47:25,072 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 03:47:25,072 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 03:47:25,073 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 03:47:25,073 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 03:47:25,073 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 03:47:25,073 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 03:47:25,074 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 03:47:25,074 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2328acd9311a64c53ad5874211f9b9da337dc2131958a2367da03f2374a4827a [2024-10-24 03:47:25,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 03:47:25,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 03:47:25,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 03:47:25,431 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 03:47:25,432 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 03:47:25,433 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal57.c [2024-10-24 03:47:27,037 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 03:47:27,256 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 03:47:27,257 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal57.c [2024-10-24 03:47:27,267 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6215eb39/f86fb4f564f14fd5af738bd9b617c473/FLAGe3294b584 [2024-10-24 03:47:27,282 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6215eb39/f86fb4f564f14fd5af738bd9b617c473 [2024-10-24 03:47:27,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 03:47:27,286 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 03:47:27,287 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 03:47:27,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 03:47:27,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 03:47:27,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:47:27" (1/1) ... [2024-10-24 03:47:27,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a3c451a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:47:27, skipping insertion in model container [2024-10-24 03:47:27,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:47:27" (1/1) ... [2024-10-24 03:47:27,330 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 03:47:27,515 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/hardware-verification-bv/btor2c-lazyMod.cal57.c[1245,1258] [2024-10-24 03:47:27,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 03:47:27,612 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 03:47:27,626 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/hardware-verification-bv/btor2c-lazyMod.cal57.c[1245,1258] [2024-10-24 03:47:27,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 03:47:27,707 INFO L204 MainTranslator]: Completed translation [2024-10-24 03:47:27,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:47:27 WrapperNode [2024-10-24 03:47:27,708 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 03:47:27,709 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 03:47:27,709 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 03:47:27,710 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 03:47:27,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:47:27" (1/1) ... [2024-10-24 03:47:27,728 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:47:27" (1/1) ... [2024-10-24 03:47:27,761 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 184 [2024-10-24 03:47:27,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 03:47:27,763 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 03:47:27,763 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 03:47:27,763 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 03:47:27,774 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:47:27" (1/1) ... [2024-10-24 03:47:27,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:47:27" (1/1) ... [2024-10-24 03:47:27,785 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:47:27" (1/1) ... [2024-10-24 03:47:27,811 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-24 03:47:27,811 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:47:27" (1/1) ... [2024-10-24 03:47:27,812 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:47:27" (1/1) ... [2024-10-24 03:47:27,823 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:47:27" (1/1) ... [2024-10-24 03:47:27,829 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:47:27" (1/1) ... [2024-10-24 03:47:27,832 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:47:27" (1/1) ... [2024-10-24 03:47:27,834 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:47:27" (1/1) ... [2024-10-24 03:47:27,841 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 03:47:27,846 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 03:47:27,846 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 03:47:27,846 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 03:47:27,847 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:47:27" (1/1) ... [2024-10-24 03:47:27,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 03:47:27,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:47:27,885 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 03:47:27,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 03:47:27,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 03:47:27,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 03:47:27,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 03:47:27,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 03:47:27,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 03:47:28,064 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 03:47:28,069 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 03:47:28,387 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-10-24 03:47:28,391 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 03:47:28,437 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 03:47:28,437 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 03:47:28,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:47:28 BoogieIcfgContainer [2024-10-24 03:47:28,438 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 03:47:28,441 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 03:47:28,442 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 03:47:28,445 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 03:47:28,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:47:27" (1/3) ... [2024-10-24 03:47:28,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6567e342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:47:28, skipping insertion in model container [2024-10-24 03:47:28,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:47:27" (2/3) ... [2024-10-24 03:47:28,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6567e342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:47:28, skipping insertion in model container [2024-10-24 03:47:28,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:47:28" (3/3) ... [2024-10-24 03:47:28,449 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal57.c [2024-10-24 03:47:28,468 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 03:47:28,469 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 03:47:28,533 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 03:47:28,542 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;@17ac203a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 03:47:28,542 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 03:47:28,546 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:47:28,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-24 03:47:28,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:47:28,555 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-24 03:47:28,557 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:47:28,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:47:28,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-24 03:47:28,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 03:47:28,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154562555] [2024-10-24 03:47:28,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:47:28,578 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-24 03:47:28,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 03:47:28,582 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 03:47:28,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 03:47:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:47:28,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 03:47:28,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:47:28,863 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-24 03:47:28,863 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 03:47:28,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 03:47:28,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154562555] [2024-10-24 03:47:28,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154562555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:47:28,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:47:28,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 03:47:28,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998273071] [2024-10-24 03:47:28,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:47:28,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 03:47:28,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 03:47:28,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 03:47:28,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 03:47:28,902 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:47:28,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:47:28,963 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-24 03:47:28,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 03:47:28,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-24 03:47:28,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:47:28,974 INFO L225 Difference]: With dead ends: 15 [2024-10-24 03:47:28,974 INFO L226 Difference]: Without dead ends: 9 [2024-10-24 03:47:28,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 03:47:28,983 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 03:47:28,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 03:47:29,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-24 03:47:29,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-24 03:47:29,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:47:29,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-24 03:47:29,016 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-24 03:47:29,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:47:29,016 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-24 03:47:29,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:47:29,018 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-24 03:47:29,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 03:47:29,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:47:29,018 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-24 03:47:29,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 03:47:29,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 03:47:29,220 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:47:29,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:47:29,221 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-24 03:47:29,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 03:47:29,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240966106] [2024-10-24 03:47:29,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:47:29,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-24 03:47:29,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 03:47:29,226 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 03:47:29,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 03:47:29,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:47:29,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-24 03:47:29,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:47:29,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:47:29,706 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 03:47:31,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:47:31,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 03:47:31,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240966106] [2024-10-24 03:47:31,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1240966106] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 03:47:31,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 03:47:31,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-24 03:47:31,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649720431] [2024-10-24 03:47:31,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 03:47:31,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 03:47:31,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 03:47:31,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 03:47:31,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 03:47:31,065 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:47:31,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:47:31,164 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-10-24 03:47:31,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 03:47:31,165 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-24 03:47:31,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:47:31,166 INFO L225 Difference]: With dead ends: 13 [2024-10-24 03:47:31,166 INFO L226 Difference]: Without dead ends: 11 [2024-10-24 03:47:31,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-24 03:47:31,167 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 03:47:31,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 03:47:31,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-10-24 03:47:31,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-10-24 03:47:31,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:47:31,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-24 03:47:31,172 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-24 03:47:31,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:47:31,172 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-24 03:47:31,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:47:31,173 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-24 03:47:31,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 03:47:31,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:47:31,174 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-24 03:47:31,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 03:47:31,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 03:47:31,377 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:47:31,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:47:31,378 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-24 03:47:31,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 03:47:31,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1021205237] [2024-10-24 03:47:31,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 03:47:31,379 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-24 03:47:31,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 03:47:31,382 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 03:47:31,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 03:47:31,530 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 03:47:31,530 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 03:47:31,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-24 03:47:31,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:47:32,574 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:47:32,574 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 03:48:01,924 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:48:01,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 03:48:01,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1021205237] [2024-10-24 03:48:01,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1021205237] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 03:48:01,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 03:48:01,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-10-24 03:48:01,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187353255] [2024-10-24 03:48:01,931 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 03:48:01,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 03:48:01,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 03:48:01,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 03:48:01,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-10-24 03:48:01,937 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:48:02,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:48:02,221 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2024-10-24 03:48:02,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 03:48:02,221 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-24 03:48:02,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:48:02,222 INFO L225 Difference]: With dead ends: 16 [2024-10-24 03:48:02,222 INFO L226 Difference]: Without dead ends: 14 [2024-10-24 03:48:02,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-10-24 03:48:02,224 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 03:48:02,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 03:48:02,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-10-24 03:48:02,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-24 03:48:02,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:48:02,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-10-24 03:48:02,229 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2024-10-24 03:48:02,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:48:02,229 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-10-24 03:48:02,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:48:02,229 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-10-24 03:48:02,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-24 03:48:02,230 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:48:02,230 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2024-10-24 03:48:02,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 03:48:02,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 03:48:02,435 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:48:02,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:48:02,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1748931734, now seen corresponding path program 3 times [2024-10-24 03:48:02,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 03:48:02,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766687023] [2024-10-24 03:48:02,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 03:48:02,436 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-24 03:48:02,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 03:48:02,438 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 03:48:02,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 03:48:02,584 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-24 03:48:02,584 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 03:48:02,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-10-24 03:48:02,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:48:03,769 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 03:48:03,770 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 03:48:21,080 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 03:48:21,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 03:48:21,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766687023] [2024-10-24 03:48:21,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [766687023] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 03:48:21,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 03:48:21,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-10-24 03:48:21,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883928519] [2024-10-24 03:48:21,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 03:48:21,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 03:48:21,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 03:48:21,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 03:48:21,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-10-24 03:48:21,083 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:48:21,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:48:21,850 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-10-24 03:48:21,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 03:48:21,850 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-24 03:48:21,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:48:21,851 INFO L225 Difference]: With dead ends: 14 [2024-10-24 03:48:21,851 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 03:48:21,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2024-10-24 03:48:21,852 INFO L432 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 03:48:21,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 03:48:21,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 03:48:21,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 03:48:21,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:48:21,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 03:48:21,853 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2024-10-24 03:48:21,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:48:21,853 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 03:48:21,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:48:21,854 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 03:48:21,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 03:48:21,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 03:48:21,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-24 03:48:22,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 03:48:22,061 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-10-24 03:48:22,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 03:48:22,246 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 03:48:22,253 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-24 03:48:22,254 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-24 03:48:22,254 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-24 03:48:22,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:48:22 BoogieIcfgContainer [2024-10-24 03:48:22,260 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 03:48:22,261 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 03:48:22,261 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 03:48:22,261 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 03:48:22,262 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:47:28" (3/4) ... [2024-10-24 03:48:22,263 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 03:48:22,271 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-24 03:48:22,272 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-24 03:48:22,272 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-24 03:48:22,272 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 03:48:22,273 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 03:48:22,377 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 03:48:22,377 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 03:48:22,378 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 03:48:22,378 INFO L158 Benchmark]: Toolchain (without parser) took 55092.09ms. Allocated memory was 56.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 24.4MB in the beginning and 553.3MB in the end (delta: -528.9MB). Peak memory consumption was 606.9MB. Max. memory is 16.1GB. [2024-10-24 03:48:22,379 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 41.9MB. Free memory was 23.5MB in the beginning and 23.5MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 03:48:22,379 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.01ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 24.2MB in the beginning and 50.5MB in the end (delta: -26.3MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. [2024-10-24 03:48:22,379 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.09ms. Allocated memory is still 71.3MB. Free memory was 50.5MB in the beginning and 48.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 03:48:22,380 INFO L158 Benchmark]: Boogie Preprocessor took 82.00ms. Allocated memory is still 71.3MB. Free memory was 48.2MB in the beginning and 45.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 03:48:22,380 INFO L158 Benchmark]: RCFGBuilder took 592.28ms. Allocated memory is still 71.3MB. Free memory was 45.2MB in the beginning and 40.7MB in the end (delta: 4.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 03:48:22,380 INFO L158 Benchmark]: TraceAbstraction took 53819.07ms. Allocated memory was 71.3MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 40.0MB in the beginning and 559.6MB in the end (delta: -519.6MB). Peak memory consumption was 601.0MB. Max. memory is 16.1GB. [2024-10-24 03:48:22,381 INFO L158 Benchmark]: Witness Printer took 116.87ms. Allocated memory is still 1.2GB. Free memory was 559.6MB in the beginning and 553.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 03:48:22,382 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.19ms. Allocated memory is still 41.9MB. Free memory was 23.5MB in the beginning and 23.5MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 421.01ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 24.2MB in the beginning and 50.5MB in the end (delta: -26.3MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.09ms. Allocated memory is still 71.3MB. Free memory was 50.5MB in the beginning and 48.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.00ms. Allocated memory is still 71.3MB. Free memory was 48.2MB in the beginning and 45.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 592.28ms. Allocated memory is still 71.3MB. Free memory was 45.2MB in the beginning and 40.7MB in the end (delta: 4.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 53819.07ms. Allocated memory was 71.3MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 40.0MB in the beginning and 559.6MB in the end (delta: -519.6MB). Peak memory consumption was 601.0MB. Max. memory is 16.1GB. * Witness Printer took 116.87ms. Allocated memory is still 1.2GB. Free memory was 559.6MB in the beginning and 553.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 53.5s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 124 IncrementalHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 6 mSDtfsCounter, 124 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=3, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 50.8s InterpolantComputationTime, 34 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 57 ConstructedInterpolants, 27 QuantifiedInterpolants, 71612 SizeOfPredicates, 38 NumberOfNonLiveVariables, 441 ConjunctsInSsa, 153 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 12/48 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: ((((((((((0 == var_15) && (0 == var_11)) && (7 == mask_SORT_5)) && (1 == mask_SORT_1)) && (1 == state_12)) && (1 == state_18)) && (1 == var_31)) && (1 == var_21)) || ((((((((0 == state_18) && (0 == var_15)) && (0 == state_12)) && (0 == var_11)) && (7 == mask_SORT_5)) && (1 == mask_SORT_1)) && (1 == var_31)) && (1 == var_21))) || ((((((((0 == state_18) && (0 == var_15)) && (0 == var_11)) && (7 == mask_SORT_5)) && (1 == mask_SORT_1)) && (1 == state_12)) && (1 == var_31)) && (1 == var_21))) RESULT: Ultimate proved your program to be correct! [2024-10-24 03:48:22,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE