/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.counter_v.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 21:40:43,175 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 21:40:43,228 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2023-12-16 21:40:43,236 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 21:40:43,236 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 21:40:43,265 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 21:40:43,265 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 21:40:43,266 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 21:40:43,266 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 21:40:43,269 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 21:40:43,269 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 21:40:43,269 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 21:40:43,270 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 21:40:43,271 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 21:40:43,271 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 21:40:43,271 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 21:40:43,271 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 21:40:43,271 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 21:40:43,271 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 21:40:43,272 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 21:40:43,272 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 21:40:43,273 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 21:40:43,273 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 21:40:43,273 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 21:40:43,273 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 21:40:43,273 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 21:40:43,273 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 21:40:43,274 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 21:40:43,274 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 21:40:43,274 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 21:40:43,275 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 21:40:43,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 21:40:43,275 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 21:40:43,275 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 21:40:43,275 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 21:40:43,275 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 21:40:43,275 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 21:40:43,275 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 21:40:43,275 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 21:40:43,276 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 21:40:43,276 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 21:40:43,276 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 21:40:43,276 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 21:40:43,276 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 [2023-12-16 21:40:43,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 21:40:43,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 21:40:43,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 21:40:43,475 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 21:40:43,475 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 21:40:43,476 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.counter_v.c [2023-12-16 21:40:44,377 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 21:40:44,493 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 21:40:44,494 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.counter_v.c [2023-12-16 21:40:44,499 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb7ac908e/44ce3ae413d9479bacfe7f697bc2ad70/FLAG34536b905 [2023-12-16 21:40:44,508 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb7ac908e/44ce3ae413d9479bacfe7f697bc2ad70 [2023-12-16 21:40:44,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 21:40:44,511 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 21:40:44,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 21:40:44,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 21:40:44,515 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 21:40:44,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:40:44" (1/1) ... [2023-12-16 21:40:44,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12c07b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:40:44, skipping insertion in model container [2023-12-16 21:40:44,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:40:44" (1/1) ... [2023-12-16 21:40:44,536 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 21:40:44,642 WARN L239 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.counter_v.c[1249,1262] [2023-12-16 21:40:44,660 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 21:40:44,667 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 21:40:44,675 WARN L239 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.counter_v.c[1249,1262] [2023-12-16 21:40:44,686 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 21:40:44,695 INFO L206 MainTranslator]: Completed translation [2023-12-16 21:40:44,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:40:44 WrapperNode [2023-12-16 21:40:44,696 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 21:40:44,696 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 21:40:44,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 21:40:44,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 21:40:44,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:40:44" (1/1) ... [2023-12-16 21:40:44,706 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:40:44" (1/1) ... [2023-12-16 21:40:44,717 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2023-12-16 21:40:44,717 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 21:40:44,718 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 21:40:44,718 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 21:40:44,718 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 21:40:44,724 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:40:44" (1/1) ... [2023-12-16 21:40:44,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:40:44" (1/1) ... [2023-12-16 21:40:44,725 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:40:44" (1/1) ... [2023-12-16 21:40:44,733 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 21:40:44,733 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:40:44" (1/1) ... [2023-12-16 21:40:44,734 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:40:44" (1/1) ... [2023-12-16 21:40:44,737 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:40:44" (1/1) ... [2023-12-16 21:40:44,739 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:40:44" (1/1) ... [2023-12-16 21:40:44,740 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:40:44" (1/1) ... [2023-12-16 21:40:44,741 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:40:44" (1/1) ... [2023-12-16 21:40:44,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 21:40:44,743 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 21:40:44,743 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 21:40:44,743 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 21:40:44,744 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:40:44" (1/1) ... [2023-12-16 21:40:44,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 21:40:44,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 21:40:44,781 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) [2023-12-16 21:40:44,799 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 [2023-12-16 21:40:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 21:40:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 21:40:44,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 21:40:44,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 21:40:44,880 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 21:40:44,882 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 21:40:44,985 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 21:40:45,016 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 21:40:45,016 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 21:40:45,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:40:45 BoogieIcfgContainer [2023-12-16 21:40:45,017 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 21:40:45,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 21:40:45,018 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 21:40:45,020 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 21:40:45,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 09:40:44" (1/3) ... [2023-12-16 21:40:45,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a35e65c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 09:40:45, skipping insertion in model container [2023-12-16 21:40:45,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:40:44" (2/3) ... [2023-12-16 21:40:45,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a35e65c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 09:40:45, skipping insertion in model container [2023-12-16 21:40:45,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:40:45" (3/3) ... [2023-12-16 21:40:45,022 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.counter_v.c [2023-12-16 21:40:45,034 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 21:40:45,034 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 21:40:45,069 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 21:40:45,074 INFO L357 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, mHoare=true, 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;@2756af68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 21:40:45,074 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 21:40:45,077 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 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) [2023-12-16 21:40:45,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-16 21:40:45,081 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 21:40:45,083 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-16 21:40:45,084 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 21:40:45,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 21:40:45,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1827279, now seen corresponding path program 1 times [2023-12-16 21:40:45,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 21:40:45,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092785886] [2023-12-16 21:40:45,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 21:40:45,096 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 [2023-12-16 21:40:45,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 21:40:45,101 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) [2023-12-16 21:40:45,106 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 [2023-12-16 21:40:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 21:40:45,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-16 21:40:45,174 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 21:40:45,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 21:40:45,349 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 21:40:45,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 21:40:45,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092785886] [2023-12-16 21:40:45,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2092785886] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 21:40:45,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 21:40:45,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 21:40:45,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271100641] [2023-12-16 21:40:45,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 21:40:45,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 21:40:45,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 21:40:45,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 21:40:45,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 21:40:45,376 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 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) [2023-12-16 21:40:45,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 21:40:45,417 INFO L93 Difference]: Finished difference Result 16 states and 24 transitions. [2023-12-16 21:40:45,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 21:40:45,419 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 [2023-12-16 21:40:45,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 21:40:45,423 INFO L225 Difference]: With dead ends: 16 [2023-12-16 21:40:45,423 INFO L226 Difference]: Without dead ends: 9 [2023-12-16 21:40:45,425 INFO L412 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 [2023-12-16 21:40:45,428 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 3 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 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 [2023-12-16 21:40:45,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 21:40:45,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-12-16 21:40:45,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2023-12-16 21:40:45,448 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) [2023-12-16 21:40:45,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-12-16 21:40:45,449 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2023-12-16 21:40:45,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 21:40:45,449 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-12-16 21:40:45,449 INFO L496 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) [2023-12-16 21:40:45,449 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-12-16 21:40:45,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-16 21:40:45,450 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 21:40:45,450 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2023-12-16 21:40:45,452 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 (2)] Forceful destruction successful, exit code 0 [2023-12-16 21:40:45,652 WARN L477 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 [2023-12-16 21:40:45,653 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 21:40:45,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 21:40:45,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1393329571, now seen corresponding path program 1 times [2023-12-16 21:40:45,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 21:40:45,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1806271956] [2023-12-16 21:40:45,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 21:40:45,654 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 [2023-12-16 21:40:45,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 21:40:45,655 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) [2023-12-16 21:40:45,656 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 [2023-12-16 21:40:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 21:40:45,700 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-16 21:40:45,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 21:40:45,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 21:40:45,951 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 21:40:46,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 21:40:46,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 21:40:46,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1806271956] [2023-12-16 21:40:46,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1806271956] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 21:40:46,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 21:40:46,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-16 21:40:46,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474482950] [2023-12-16 21:40:46,385 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 21:40:46,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 21:40:46,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 21:40:46,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 21:40:46,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-16 21:40:46,387 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) [2023-12-16 21:40:46,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 21:40:46,553 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2023-12-16 21:40:46,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 21:40:46,553 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 [2023-12-16 21:40:46,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 21:40:46,554 INFO L225 Difference]: With dead ends: 17 [2023-12-16 21:40:46,554 INFO L226 Difference]: Without dead ends: 15 [2023-12-16 21:40:46,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2023-12-16 21:40:46,556 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 7 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 21:40:46,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 9 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 21:40:46,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-16 21:40:46,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2023-12-16 21:40:46,562 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) [2023-12-16 21:40:46,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2023-12-16 21:40:46,563 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2023-12-16 21:40:46,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 21:40:46,563 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2023-12-16 21:40:46,563 INFO L496 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) [2023-12-16 21:40:46,563 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2023-12-16 21:40:46,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-16 21:40:46,564 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 21:40:46,564 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2023-12-16 21:40:46,568 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 [2023-12-16 21:40:46,770 WARN L477 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 [2023-12-16 21:40:46,771 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 21:40:46,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 21:40:46,771 INFO L85 PathProgramCache]: Analyzing trace with hash -57678563, now seen corresponding path program 2 times [2023-12-16 21:40:46,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 21:40:46,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219011187] [2023-12-16 21:40:46,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 21:40:46,772 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 [2023-12-16 21:40:46,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 21:40:46,773 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) [2023-12-16 21:40:46,777 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 [2023-12-16 21:40:46,834 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 21:40:46,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 21:40:46,837 WARN L260 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 84 conjunts are in the unsatisfiable core [2023-12-16 21:40:46,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 21:40:47,449 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 21:40:47,449 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 21:40:54,119 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_8~0#1|)) (.cse4 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|)) (.cse31 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse2 (forall ((|v_ULTIMATE.start_main_~var_14_arg_0~0#1_15| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_14_arg_0~0#1_15|) (_ bv254 32)))))) (_ bv0 8)))) (.cse33 (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_14| (_ BitVec 8))) (= .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_14|))))))))))) (.cse13 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse32 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_12~0#1|)) (.cse16 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse13)))))) (.cse3 (forall ((|v_ULTIMATE.start_main_~var_14_arg_0~0#1_15| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_14_arg_0~0#1_15|) (_ bv255 32)))))) (_ bv0 8)))) (.cse30 (or .cse2 .cse33)) (.cse6 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_5~0#1|))) (let ((.cse12 (and (or (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_15| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_15|))))) .cse4)))))))) .cse7)) .cse2) (or .cse2 .cse33 (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_15| (_ BitVec 8))) (not (= .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_15|))))) .cse4))))))) .cse3 .cse30 (or (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_15| (_ BitVec 8))) (let ((.cse34 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_15|))))) .cse4))))) (or (= .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse34 .cse6))))))))))) (= .cse7 .cse34)))) .cse2))) (.cse15 (= .cse16 .cse7)) (.cse1 (not (= ((_ extract 7 0) (bvand .cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 (_ bv255 32)))))) (_ bv0 8))))) (let ((.cse14 (and .cse15 .cse1)) (.cse19 (or .cse12 (not .cse15))) (.cse8 (not (= ((_ extract 7 0) (bvand .cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 (_ bv254 32)))))) (_ bv0 8)))) (.cse11 (and .cse3 .cse30)) (.cse20 (= .cse7 .cse13))) (and (or (and (let ((.cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse13 .cse6)))))))))))) (let ((.cse0 (= .cse5 .cse7))) (or (and .cse0 .cse1) (and (or .cse0 (and (or (and .cse2 (or .cse3 (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse5))))) .cse6)))))))))) .cse7)))) .cse8) (let ((.cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse5 .cse6)))))))))))) (let ((.cse9 (= .cse7 .cse10))) (or (and .cse1 (or .cse9 .cse8)) (and (or .cse9 (and .cse2 (or .cse3 (not (= .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse6 .cse10))))))))))))))) (or .cse11 (not .cse9)))))))) (or .cse12 (not .cse0)))))) (or .cse14 (and (or .cse15 (and (or (and .cse2 (or .cse3 (not (= .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse16))))) .cse6))))))) .cse4))))))) .cse8) (let ((.cse18 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse16 .cse6)))))))))))) (let ((.cse17 (= .cse7 .cse18))) (or (and .cse1 (or .cse17 .cse8)) (and (or .cse11 (not .cse17)) (or (and .cse2 (or (not (= .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse18 .cse6)))))))))))) .cse3)) .cse17))))))) .cse19))) .cse20) (or (let ((.cse25 (or .cse11 (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_16|))))) .cse4))))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse29 .cse6))))))) .cse4))) .cse7)) (= .cse29 .cse7)))))) (.cse21 (or .cse3 (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_16|))))) .cse4))))) (or (not (= .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) .cse28))))))))))))))))) (= .cse28 .cse7)))))) (.cse23 (or .cse2 (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_16| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_16|))))) .cse4))) .cse7)))) (.cse22 (or .cse2 (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_16|))))) .cse4))))) (or (= .cse27 .cse7) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse27 .cse6))))))) .cse4))) .cse7)))))) (.cse24 (or (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_16|))))) .cse4))))) (or (= .cse26 .cse7) (not (= .cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse26 .cse6))))))) .cse4))) .cse6))))))) .cse4)))))))) .cse3))) (and (or (and .cse21 .cse22 .cse23 .cse24 (or (forall ((|v_ULTIMATE.start_main_~var_19_arg_1~0#1_16| (_ BitVec 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_1~0#1_16|))))) .cse4))) .cse7))) .cse12) .cse25) .cse1) (or .cse1 (and .cse22 .cse24 .cse25)) (or (and .cse21 .cse23) .cse8) (or .cse14 (and (or .cse2 .cse15 .cse8) .cse19)) (or (and .cse22 .cse24) .cse8))) (not .cse20)))))))) is different from false [2023-12-16 21:40:55,314 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-12-16 21:40:55,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 21:40:55,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1219011187] [2023-12-16 21:40:55,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1219011187] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 21:40:55,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 21:40:55,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2023-12-16 21:40:55,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163086071] [2023-12-16 21:40:55,315 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 21:40:55,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-16 21:40:55,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 21:40:55,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-16 21:40:55,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=205, Unknown=1, NotChecked=32, Total=342 [2023-12-16 21:40:55,317 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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) [2023-12-16 21:40:56,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 21:40:56,294 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2023-12-16 21:40:56,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-16 21:40:56,295 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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 [2023-12-16 21:40:56,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 21:40:56,295 INFO L225 Difference]: With dead ends: 26 [2023-12-16 21:40:56,295 INFO L226 Difference]: Without dead ends: 24 [2023-12-16 21:40:56,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=229, Invalid=424, Unknown=1, NotChecked=48, Total=702 [2023-12-16 21:40:56,305 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 25 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 21:40:56,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 20 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 43 Invalid, 0 Unknown, 19 Unchecked, 0.2s Time] [2023-12-16 21:40:56,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-16 21:40:56,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2023-12-16 21:40:56,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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) [2023-12-16 21:40:56,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2023-12-16 21:40:56,310 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 13 [2023-12-16 21:40:56,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 21:40:56,310 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2023-12-16 21:40:56,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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) [2023-12-16 21:40:56,311 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2023-12-16 21:40:56,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-16 21:40:56,311 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 21:40:56,311 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1] [2023-12-16 21:40:56,315 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 (4)] Forceful destruction successful, exit code 0 [2023-12-16 21:40:56,514 WARN L477 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 [2023-12-16 21:40:56,515 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 21:40:56,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 21:40:56,516 INFO L85 PathProgramCache]: Analyzing trace with hash 223328655, now seen corresponding path program 3 times [2023-12-16 21:40:56,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 21:40:56,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461678100] [2023-12-16 21:40:56,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 21:40:56,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 21:40:56,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 21:40:56,517 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) [2023-12-16 21:40:56,519 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 [2023-12-16 21:40:56,610 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-12-16 21:40:56,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 21:40:56,613 WARN L260 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 151 conjunts are in the unsatisfiable core [2023-12-16 21:40:56,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 21:40:57,522 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 21:40:57,522 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-12-16 21:41:56,525 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 21:41:56,538 WARN L340 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)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 21:41:57,036 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 21:41:57,039 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 [2023-12-16 21:41:57,237 WARN L477 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 [2023-12-16 21:41:57,238 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 23 with TraceHistMax 7,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. [2023-12-16 21:41:57,241 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-12-16 21:41:57,243 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 21:41:57,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 09:41:57 BoogieIcfgContainer [2023-12-16 21:41:57,244 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 21:41:57,245 INFO L158 Benchmark]: Toolchain (without parser) took 72733.66ms. Allocated memory was 230.7MB in the beginning and 692.1MB in the end (delta: 461.4MB). Free memory was 189.3MB in the beginning and 497.7MB in the end (delta: -308.4MB). Peak memory consumption was 407.2MB. Max. memory is 8.0GB. [2023-12-16 21:41:57,245 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 181.4MB. Free memory was 135.4MB in the beginning and 135.2MB in the end (delta: 176.3kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 21:41:57,245 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.16ms. Allocated memory is still 230.7MB. Free memory was 189.3MB in the beginning and 177.1MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 21:41:57,245 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.80ms. Allocated memory is still 230.7MB. Free memory was 177.1MB in the beginning and 175.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 21:41:57,245 INFO L158 Benchmark]: Boogie Preprocessor took 24.98ms. Allocated memory is still 230.7MB. Free memory was 175.2MB in the beginning and 173.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 21:41:57,246 INFO L158 Benchmark]: RCFGBuilder took 273.76ms. Allocated memory is still 230.7MB. Free memory was 173.1MB in the beginning and 159.9MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-16 21:41:57,246 INFO L158 Benchmark]: TraceAbstraction took 72226.10ms. Allocated memory was 230.7MB in the beginning and 692.1MB in the end (delta: 461.4MB). Free memory was 159.3MB in the beginning and 497.7MB in the end (delta: -338.4MB). Peak memory consumption was 377.8MB. Max. memory is 8.0GB. [2023-12-16 21:41:57,247 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.09ms. Allocated memory is still 181.4MB. Free memory was 135.4MB in the beginning and 135.2MB in the end (delta: 176.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 184.16ms. Allocated memory is still 230.7MB. Free memory was 189.3MB in the beginning and 177.1MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.80ms. Allocated memory is still 230.7MB. Free memory was 177.1MB in the beginning and 175.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.98ms. Allocated memory is still 230.7MB. Free memory was 175.2MB in the beginning and 173.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 273.76ms. Allocated memory is still 230.7MB. Free memory was 173.1MB in the beginning and 159.9MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 72226.10ms. Allocated memory was 230.7MB in the beginning and 692.1MB in the end (delta: 461.4MB). Free memory was 159.3MB in the beginning and 497.7MB in the end (delta: -338.4MB). Peak memory consumption was 377.8MB. Max. memory is 8.0GB. * 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 - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 21). Cancelled while NwaCegarLoop was analyzing trace of length 23 with TraceHistMax 7,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 72.2s, OverallIterations: 4, TraceHistogramMax: 7, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 19 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 78 IncrementalHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 6 mSDtfsCounter, 78 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred 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, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 39 ConstructedInterpolants, 15 QuantifiedInterpolants, 11624 SizeOfPredicates, 129 NumberOfNonLiveVariables, 221 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 0/34 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: Timeout Completed graceful shutdown