/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver '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' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.h_b06.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-05 09:36:04,087 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 09:36:04,174 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-05 09:36:04,179 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 09:36:04,180 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 09:36:04,202 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 09:36:04,203 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 09:36:04,203 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 09:36:04,204 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 09:36:04,204 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 09:36:04,205 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 09:36:04,205 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 09:36:04,206 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 09:36:04,206 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 09:36:04,206 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 09:36:04,207 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 09:36:04,207 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 09:36:04,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 09:36:04,208 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 09:36:04,208 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 09:36:04,208 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 09:36:04,209 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 09:36:04,209 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 09:36:04,210 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 09:36:04,210 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 09:36:04,210 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 09:36:04,211 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 09:36:04,211 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 09:36:04,211 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 09:36:04,212 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 09:36:04,212 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 09:36:04,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 09:36:04,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 09:36:04,213 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 09:36:04,213 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 09:36:04,213 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 09:36:04,214 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 09:36:04,214 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 09:36:04,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 09:36:04,214 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 09:36:04,214 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 09:36:04,215 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.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 09:36:04,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 09:36:04,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 09:36:04,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 09:36:04,521 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 09:36:04,521 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 09:36:04,523 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.h_b06.c [2024-11-05 09:36:06,125 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 09:36:06,338 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 09:36:06,338 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.h_b06.c [2024-11-05 09:36:06,348 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acf63ed50/3aa0dde473fd42c18f603f999b3971d3/FLAG549f02657 [2024-11-05 09:36:06,700 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acf63ed50/3aa0dde473fd42c18f603f999b3971d3 [2024-11-05 09:36:06,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 09:36:06,704 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 09:36:06,706 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 09:36:06,706 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 09:36:06,711 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 09:36:06,712 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 09:36:06" (1/1) ... [2024-11-05 09:36:06,713 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ed74522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:36:06, skipping insertion in model container [2024-11-05 09:36:06,713 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 09:36:06" (1/1) ... [2024-11-05 09:36:06,737 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 09:36:06,902 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.h_b06.c[1245,1258] [2024-11-05 09:36:06,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 09:36:06,968 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 09:36:06,982 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.h_b06.c[1245,1258] [2024-11-05 09:36:07,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 09:36:07,027 INFO L204 MainTranslator]: Completed translation [2024-11-05 09:36:07,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:36:07 WrapperNode [2024-11-05 09:36:07,028 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 09:36:07,029 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 09:36:07,029 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 09:36:07,030 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 09:36:07,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:36:07" (1/1) ... [2024-11-05 09:36:07,048 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:36:07" (1/1) ... [2024-11-05 09:36:07,076 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 155 [2024-11-05 09:36:07,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 09:36:07,077 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 09:36:07,077 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 09:36:07,077 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 09:36:07,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:36:07" (1/1) ... [2024-11-05 09:36:07,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:36:07" (1/1) ... [2024-11-05 09:36:07,092 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:36:07" (1/1) ... [2024-11-05 09:36:07,107 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-11-05 09:36:07,108 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:36:07" (1/1) ... [2024-11-05 09:36:07,108 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:36:07" (1/1) ... [2024-11-05 09:36:07,114 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:36:07" (1/1) ... [2024-11-05 09:36:07,117 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:36:07" (1/1) ... [2024-11-05 09:36:07,119 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:36:07" (1/1) ... [2024-11-05 09:36:07,121 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:36:07" (1/1) ... [2024-11-05 09:36:07,124 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 09:36:07,125 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 09:36:07,125 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 09:36:07,125 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 09:36:07,126 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:36:07" (1/1) ... [2024-11-05 09:36:07,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 09:36:07,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 09:36:07,168 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-05 09:36:07,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-05 09:36:07,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 09:36:07,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 09:36:07,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-05 09:36:07,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 09:36:07,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 09:36:07,282 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 09:36:07,284 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 09:36:07,551 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-11-05 09:36:07,552 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 09:36:07,571 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 09:36:07,571 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 09:36:07,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 09:36:07 BoogieIcfgContainer [2024-11-05 09:36:07,572 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 09:36:07,574 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 09:36:07,574 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 09:36:07,578 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 09:36:07,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 09:36:06" (1/3) ... [2024-11-05 09:36:07,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f41cfa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 09:36:07, skipping insertion in model container [2024-11-05 09:36:07,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:36:07" (2/3) ... [2024-11-05 09:36:07,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f41cfa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 09:36:07, skipping insertion in model container [2024-11-05 09:36:07,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 09:36:07" (3/3) ... [2024-11-05 09:36:07,582 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b06.c [2024-11-05 09:36:07,597 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 09:36:07,597 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 09:36:07,647 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 09:36:07,654 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;@4bdfe22c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 09:36:07,654 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 09:36:07,672 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 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-11-05 09:36:07,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-05 09:36:07,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 09:36:07,679 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-05 09:36:07,684 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 09:36:07,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 09:36:07,693 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-05 09:36:07,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 09:36:07,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [847991438] [2024-11-05 09:36:07,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 09:36:07,709 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 09:36:07,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 09:36:07,714 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 09:36:07,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-05 09:36:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 09:36:07,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-05 09:36:07,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 09:36:08,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 09:36:08,206 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 09:36:08,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 09:36:08,571 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 09:36:08,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [847991438] [2024-11-05 09:36:08,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [847991438] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 09:36:08,572 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 09:36:08,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-05 09:36:08,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422562326] [2024-11-05 09:36:08,578 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 09:36:08,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 09:36:08,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 09:36:08,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 09:36:08,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 09:36:08,616 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 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) Second operand has 6 states, 6 states have (on average 1.3333333333333333) 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-11-05 09:36:08,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 09:36:08,668 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2024-11-05 09:36:08,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 09:36:08,672 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) 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) Word has length 5 [2024-11-05 09:36:08,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 09:36:08,679 INFO L225 Difference]: With dead ends: 17 [2024-11-05 09:36:08,680 INFO L226 Difference]: Without dead ends: 9 [2024-11-05 09:36:08,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 09:36:08,689 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 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-11-05 09:36:08,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 09:36:08,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-05 09:36:08,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-05 09:36:08,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-11-05 09:36:08,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-05 09:36:08,721 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-05 09:36:08,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 09:36:08,722 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-05 09:36:08,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) 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-11-05 09:36:08,723 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-05 09:36:08,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-05 09:36:08,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 09:36:08,724 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-05 09:36:08,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-05 09:36:08,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 09:36:08,929 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 09:36:08,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 09:36:08,930 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-05 09:36:08,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 09:36:08,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1605712670] [2024-11-05 09:36:08,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 09:36:08,931 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 09:36:08,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 09:36:08,934 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 09:36:08,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-05 09:36:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 09:36:09,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-05 09:36:09,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 09:36:09,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 09:36:09,395 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 09:36:10,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 09:36:10,605 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 09:36:10,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1605712670] [2024-11-05 09:36:10,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1605712670] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 09:36:10,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 09:36:10,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 09:36:10,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359128025] [2024-11-05 09:36:10,606 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 09:36:10,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 09:36:10,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 09:36:10,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 09:36:10,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-05 09:36:10,608 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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-11-05 09:36:10,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 09:36:10,940 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-05 09:36:10,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 09:36:10,941 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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) Word has length 8 [2024-11-05 09:36:10,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 09:36:10,942 INFO L225 Difference]: With dead ends: 14 [2024-11-05 09:36:10,942 INFO L226 Difference]: Without dead ends: 12 [2024-11-05 09:36:10,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-05 09:36:10,944 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 09:36:10,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 09:36:10,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-05 09:36:10,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-05 09:36:10,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-11-05 09:36:10,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-05 09:36:10,951 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-05 09:36:10,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 09:36:10,952 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-05 09:36:10,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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-11-05 09:36:10,952 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-05 09:36:10,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-05 09:36:10,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 09:36:10,954 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-05 09:36:10,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-05 09:36:11,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 09:36:11,158 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 09:36:11,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 09:36:11,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-05 09:36:11,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 09:36:11,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [939606191] [2024-11-05 09:36:11,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 09:36:11,160 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 09:36:11,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 09:36:11,163 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 09:36:11,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-05 09:36:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 09:36:11,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-05 09:36:11,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 09:36:11,886 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 09:36:11,886 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 09:36:25,766 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse8 (forall ((|v_ULTIMATE.start_main_~var_24_arg_0~0#1_17| (_ BitVec 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_24_arg_0~0#1_17|) (_ bv254 32)))) .cse5)) (_ bv0 8)))) (.cse10 (forall ((|v_ULTIMATE.start_main_~var_24_arg_0~0#1_17| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_24_arg_0~0#1_17|) (_ bv255 32))))))))) (.cse9 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_39~0#1|))))) (let ((.cse0 (= |c_ULTIMATE.start_main_~state_31~0#1| (_ bv0 8))) (.cse4 (let ((.cse12 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse9))))) (.cse11 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_12~0#1|))))))))) (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_11~0#1| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_11~0#1|) .cse11))) |c_ULTIMATE.start_main_~var_17~0#1|)) .cse8) (or (forall ((|ULTIMATE.start_main_~mask_SORT_11~0#1| (_ BitVec 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_11~0#1|) .cse12))) |c_ULTIMATE.start_main_~var_17~0#1|))) .cse10) (or (forall ((|ULTIMATE.start_main_~mask_SORT_11~0#1| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_11~0#1|) .cse12))) |c_ULTIMATE.start_main_~var_17~0#1|)) .cse8) (or (forall ((|ULTIMATE.start_main_~mask_SORT_11~0#1| (_ BitVec 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_11~0#1|) .cse11))) |c_ULTIMATE.start_main_~var_17~0#1|))) .cse10)))) (.cse1 (and (or .cse8 (forall ((|ULTIMATE.start_main_~mask_SORT_11~0#1| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_11~0#1|)))) |c_ULTIMATE.start_main_~var_17~0#1|))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_11~0#1| (_ BitVec 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_11~0#1|)))) |c_ULTIMATE.start_main_~var_17~0#1|))) .cse10))) (.cse6 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_22~0#1|))))) (and (or .cse0 (let ((.cse2 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse6)))))))) (.cse3 (= ((_ extract 7 0) (bvand .cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_5~0#1|))))))))) (_ bv0 8)))) (and (or .cse1 (not .cse2)) (or .cse1 (not .cse3)) (or .cse2 .cse4) (or .cse4 .cse3)))) (or (not .cse0) (let ((.cse7 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse5 .cse6))))) (and (or .cse7 .cse4) (or .cse1 (not .cse7))))))))) is different from false [2024-11-05 09:36:30,368 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-05 09:36:30,369 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 09:36:30,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [939606191] [2024-11-05 09:36:30,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [939606191] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 09:36:30,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 09:36:30,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-05 09:36:30,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122656588] [2024-11-05 09:36:30,370 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 09:36:30,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-05 09:36:30,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 09:36:30,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-05 09:36:30,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=53, Unknown=2, NotChecked=14, Total=90 [2024-11-05 09:36:30,374 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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-11-05 09:36:44,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-05 09:36:49,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.63s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-05 09:36:49,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 09:36:49,716 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2024-11-05 09:36:49,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-05 09:36:49,717 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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 11 [2024-11-05 09:36:49,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 09:36:49,718 INFO L225 Difference]: With dead ends: 20 [2024-11-05 09:36:49,718 INFO L226 Difference]: Without dead ends: 18 [2024-11-05 09:36:49,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=59, Invalid=152, Unknown=3, NotChecked=26, Total=240 [2024-11-05 09:36:49,719 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2024-11-05 09:36:49,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 2 Unknown, 11 Unchecked, 10.0s Time] [2024-11-05 09:36:49,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-05 09:36:49,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-05 09:36:49,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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-11-05 09:36:49,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2024-11-05 09:36:49,726 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 11 [2024-11-05 09:36:49,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 09:36:49,727 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2024-11-05 09:36:49,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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-11-05 09:36:49,727 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2024-11-05 09:36:49,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-05 09:36:49,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 09:36:49,728 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2024-11-05 09:36:49,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-05 09:36:49,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 09:36:49,932 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 09:36:49,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 09:36:49,933 INFO L85 PathProgramCache]: Analyzing trace with hash -37306491, now seen corresponding path program 3 times [2024-11-05 09:36:49,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 09:36:49,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1284602645] [2024-11-05 09:36:49,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 09:36:49,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 09:36:49,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 09:36:49,937 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 09:36:49,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-05 09:36:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 09:36:50,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-05 09:36:50,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 09:36:56,379 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-05 09:36:56,379 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 09:37:12,483 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-05 09:37:12,483 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 09:37:12,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1284602645] [2024-11-05 09:37:12,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1284602645] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 09:37:12,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 09:37:12,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 09:37:12,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880732919] [2024-11-05 09:37:12,485 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 09:37:12,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 09:37:12,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 09:37:12,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 09:37:12,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=39, Unknown=1, NotChecked=0, Total=56 [2024-11-05 09:37:12,487 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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-11-05 09:37:13,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 09:37:13,988 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2024-11-05 09:37:13,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 09:37:13,988 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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 17 [2024-11-05 09:37:13,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 09:37:13,989 INFO L225 Difference]: With dead ends: 18 [2024-11-05 09:37:13,989 INFO L226 Difference]: Without dead ends: 0 [2024-11-05 09:37:13,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=28, Invalid=61, Unknown=1, NotChecked=0, Total=90 [2024-11-05 09:37:13,990 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-05 09:37:13,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-05 09:37:13,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-05 09:37:13,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-05 09:37:13,991 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-11-05 09:37:13,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-05 09:37:13,992 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2024-11-05 09:37:13,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 09:37:13,992 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-05 09:37:13,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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-11-05 09:37:13,992 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-05 09:37:13,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-05 09:37:13,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-05 09:37:14,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-05 09:37:14,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 09:37:14,198 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-11-05 09:37:14,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-05 09:37:17,470 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-05 09:37:17,479 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-05 09:37:17,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 09:37:17 BoogieIcfgContainer [2024-11-05 09:37:17,482 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-05 09:37:17,483 INFO L158 Benchmark]: Toolchain (without parser) took 70778.52ms. Allocated memory was 312.5MB in the beginning and 384.8MB in the end (delta: 72.4MB). Free memory was 262.5MB in the beginning and 181.9MB in the end (delta: 80.5MB). Peak memory consumption was 153.8MB. Max. memory is 8.0GB. [2024-11-05 09:37:17,483 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 204.5MB. Free memory was 155.8MB in the beginning and 155.6MB in the end (delta: 181.9kB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 09:37:17,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.62ms. Allocated memory is still 312.5MB. Free memory was 262.1MB in the beginning and 246.7MB in the end (delta: 15.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2024-11-05 09:37:17,484 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.47ms. Allocated memory is still 312.5MB. Free memory was 246.4MB in the beginning and 244.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 09:37:17,484 INFO L158 Benchmark]: Boogie Preprocessor took 46.78ms. Allocated memory is still 312.5MB. Free memory was 244.3MB in the beginning and 241.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 09:37:17,484 INFO L158 Benchmark]: RCFGBuilder took 446.86ms. Allocated memory is still 312.5MB. Free memory was 241.8MB in the beginning and 224.4MB in the end (delta: 17.5MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2024-11-05 09:37:17,485 INFO L158 Benchmark]: TraceAbstraction took 69908.18ms. Allocated memory was 312.5MB in the beginning and 384.8MB in the end (delta: 72.4MB). Free memory was 223.7MB in the beginning and 181.9MB in the end (delta: 41.7MB). Peak memory consumption was 115.0MB. Max. memory is 8.0GB. [2024-11-05 09:37:17,490 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.29ms. Allocated memory is still 204.5MB. Free memory was 155.8MB in the beginning and 155.6MB in the end (delta: 181.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 322.62ms. Allocated memory is still 312.5MB. Free memory was 262.1MB in the beginning and 246.7MB in the end (delta: 15.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.47ms. Allocated memory is still 312.5MB. Free memory was 246.4MB in the beginning and 244.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.78ms. Allocated memory is still 312.5MB. Free memory was 244.3MB in the beginning and 241.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 446.86ms. Allocated memory is still 312.5MB. Free memory was 241.8MB in the beginning and 224.4MB in the end (delta: 17.5MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 69908.18ms. Allocated memory was 312.5MB in the beginning and 384.8MB in the end (delta: 72.4MB). Free memory was 223.7MB in the beginning and 181.9MB in the end (delta: 41.7MB). Peak memory consumption was 115.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 66.6s, OverallIterations: 4, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 21.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 10.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 64 SdHoareTripleChecker+Invalid, 10.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 11 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 76 IncrementalHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 15 mSDtfsCounter, 76 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 30.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 43.8s InterpolantComputationTime, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 74 ConstructedInterpolants, 27 QuantifiedInterpolants, 5344 SizeOfPredicates, 40 NumberOfNonLiveVariables, 430 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 36/70 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: 61]: Loop Invariant Derived loop invariant: ((((((0 == state_13) || (1 == state_13)) && (2 == var_17)) && (1 == var_39)) && (1 == mask_SORT_1)) && (0 == var_12)) RESULT: Ultimate proved your program to be correct! [2024-11-05 09:37:17,702 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-05 09:37:17,797 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 137 Received shutdown request...