/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.gear.2.prop1-func-interl.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 21:51:24,622 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 21:51:24,691 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:51:24,695 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 21:51:24,695 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 21:51:24,715 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 21:51:24,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 21:51:24,716 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 21:51:24,716 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 21:51:24,719 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 21:51:24,719 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 21:51:24,719 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 21:51:24,720 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 21:51:24,721 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 21:51:24,721 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 21:51:24,721 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 21:51:24,722 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 21:51:24,722 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 21:51:24,722 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 21:51:24,722 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 21:51:24,722 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 21:51:24,722 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 21:51:24,723 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 21:51:24,723 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 21:51:24,723 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 21:51:24,723 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 21:51:24,723 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 21:51:24,724 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 21:51:24,724 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 21:51:24,724 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 21:51:24,725 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 21:51:24,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 21:51:24,725 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 21:51:24,725 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 21:51:24,725 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 21:51:24,725 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 21:51:24,725 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 21:51:24,726 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 21:51:24,726 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 21:51:24,726 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 21:51:24,726 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 21:51:24,726 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 21:51:24,726 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 21:51:24,726 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:51:24,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 21:51:24,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 21:51:24,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 21:51:24,933 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 21:51:24,934 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 21:51:24,934 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.gear.2.prop1-func-interl.c [2023-12-16 21:51:25,868 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 21:51:26,121 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 21:51:26,121 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.gear.2.prop1-func-interl.c [2023-12-16 21:51:26,138 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17c04040d/0e1f59d0531841b09644067b900aee49/FLAGcedfde82f [2023-12-16 21:51:26,149 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17c04040d/0e1f59d0531841b09644067b900aee49 [2023-12-16 21:51:26,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 21:51:26,151 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 21:51:26,152 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 21:51:26,153 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 21:51:26,156 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 21:51:26,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:51:26" (1/1) ... [2023-12-16 21:51:26,157 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52ab7269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:51:26, skipping insertion in model container [2023-12-16 21:51:26,157 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:51:26" (1/1) ... [2023-12-16 21:51:26,226 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 21:51:26,345 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.gear.2.prop1-func-interl.c[1171,1184] [2023-12-16 21:51:26,652 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 21:51:26,662 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 21:51:26,669 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.gear.2.prop1-func-interl.c[1171,1184] [2023-12-16 21:51:26,769 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 21:51:26,778 INFO L206 MainTranslator]: Completed translation [2023-12-16 21:51:26,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:51:26 WrapperNode [2023-12-16 21:51:26,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 21:51:26,779 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 21:51:26,779 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 21:51:26,780 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 21:51:26,784 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:51:26" (1/1) ... [2023-12-16 21:51:26,826 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:51:26" (1/1) ... [2023-12-16 21:51:26,913 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3648 [2023-12-16 21:51:26,914 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 21:51:26,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 21:51:26,915 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 21:51:26,915 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 21:51:26,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:51:26" (1/1) ... [2023-12-16 21:51:26,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:51:26" (1/1) ... [2023-12-16 21:51:26,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:51:26" (1/1) ... [2023-12-16 21:51:27,035 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:51:27,035 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:51:26" (1/1) ... [2023-12-16 21:51:27,035 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:51:26" (1/1) ... [2023-12-16 21:51:27,071 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:51:26" (1/1) ... [2023-12-16 21:51:27,076 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:51:26" (1/1) ... [2023-12-16 21:51:27,084 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:51:26" (1/1) ... [2023-12-16 21:51:27,095 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:51:26" (1/1) ... [2023-12-16 21:51:27,118 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 21:51:27,118 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 21:51:27,118 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 21:51:27,118 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 21:51:27,119 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:51:26" (1/1) ... [2023-12-16 21:51:27,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 21:51:27,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 21:51:27,151 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:51:27,159 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:51:27,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 21:51:27,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 21:51:27,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 21:51:27,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 21:51:27,627 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 21:51:27,628 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 21:51:31,587 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 21:51:31,715 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 21:51:31,715 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 21:51:31,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:51:31 BoogieIcfgContainer [2023-12-16 21:51:31,715 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 21:51:31,717 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 21:51:31,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 21:51:31,719 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 21:51:31,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 09:51:26" (1/3) ... [2023-12-16 21:51:31,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@419efb90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 09:51:31, skipping insertion in model container [2023-12-16 21:51:31,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:51:26" (2/3) ... [2023-12-16 21:51:31,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@419efb90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 09:51:31, skipping insertion in model container [2023-12-16 21:51:31,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:51:31" (3/3) ... [2023-12-16 21:51:31,721 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.gear.2.prop1-func-interl.c [2023-12-16 21:51:31,732 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 21:51:31,733 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 21:51:31,759 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 21:51:31,763 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;@6b1c8eb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 21:51:31,763 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 21:51:31,766 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:51:31,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-16 21:51:31,769 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 21:51:31,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-16 21:51:31,770 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 21:51:31,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 21:51:31,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1827279, now seen corresponding path program 1 times [2023-12-16 21:51:31,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 21:51:31,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2085582903] [2023-12-16 21:51:31,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 21:51:31,781 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:51:31,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 21:51:31,783 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:51:31,789 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:51:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 21:51:32,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-16 21:51:32,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 21:51:32,557 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:51:32,558 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 21:51:32,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 21:51:32,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2085582903] [2023-12-16 21:51:32,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2085582903] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 21:51:32,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 21:51:32,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 21:51:32,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325211804] [2023-12-16 21:51:32,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 21:51:32,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 21:51:32,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 21:51:32,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 21:51:32,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 21:51:32,580 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:51:33,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 21:51:33,160 INFO L93 Difference]: Finished difference Result 16 states and 24 transitions. [2023-12-16 21:51:33,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 21:51:33,162 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:51:33,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 21:51:33,166 INFO L225 Difference]: With dead ends: 16 [2023-12-16 21:51:33,166 INFO L226 Difference]: Without dead ends: 9 [2023-12-16 21:51:33,168 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:51:33,170 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 3 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2023-12-16 21:51:33,171 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.5s Time] [2023-12-16 21:51:33,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-12-16 21:51:33,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2023-12-16 21:51:33,189 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:51:33,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-12-16 21:51:33,190 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2023-12-16 21:51:33,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 21:51:33,190 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-12-16 21:51:33,190 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:51:33,190 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-12-16 21:51:33,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-16 21:51:33,191 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 21:51:33,191 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2023-12-16 21:51:33,196 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:51:33,395 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:51:33,395 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 21:51:33,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 21:51:33,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1393329571, now seen corresponding path program 1 times [2023-12-16 21:51:33,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 21:51:33,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1738535134] [2023-12-16 21:51:33,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 21:51:33,400 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:51:33,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 21:51:33,401 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:51:33,420 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:51:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 21:51:37,072 INFO L262 TraceCheckSpWp]: Trace formula consists of 3123 conjuncts, 65 conjunts are in the unsatisfiable core [2023-12-16 21:51:37,090 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 21:51:38,260 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:51:38,260 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 21:51:52,506 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:51:52,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 21:51:52,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1738535134] [2023-12-16 21:51:52,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1738535134] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 21:51:52,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 21:51:52,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-16 21:51:52,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413962689] [2023-12-16 21:51:52,507 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 21:51:52,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 21:51:52,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 21:51:52,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 21:51:52,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=62, Unknown=2, NotChecked=0, Total=90 [2023-12-16 21:51:52,509 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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:52:01,838 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~var_126~0#1| (_ bv30 32)) (= |c_ULTIMATE.start_main_~msb_SORT_6~0#1| (_ bv2147483648 32)) (= (_ bv1 8) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|) (= (_ bv16 32) |c_ULTIMATE.start_main_~var_129~0#1|) (or (forall ((|v_ULTIMATE.start_main_~var_717_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_719_arg_0~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_1008_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_772_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_1146_arg_1~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_720_arg_0~0#1_13| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_870_arg_1~0#1_14| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_1147_arg_1~0#1_14| (_ BitVec 8))) (= ((_ extract 7 0) (let ((.cse0 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_1008_arg_1~0#1_13|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_772_arg_1~0#1_13|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_68~0#1|) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_717_arg_1~0#1_13|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_242~0#1|)))) .cse0)))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_719_arg_0~0#1_13|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_114~0#1|) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_720_arg_0~0#1_13|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_241~0#1|)))))))))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_870_arg_1~0#1_14|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_1146_arg_1~0#1_13|)))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_1147_arg_1~0#1_14|))))))))))))))))))) .cse0))) (_ bv0 8))) (let ((.cse5 (bvnot |c_ULTIMATE.start_main_~mask_SORT_6~0#1|)) (.cse4 (bvnot (bvlshr |c_ULTIMATE.start_main_~mask_SORT_6~0#1| |c_ULTIMATE.start_main_~var_129~0#1|))) (.cse13 (= (_ bv0 8) |c_ULTIMATE.start_main_~input_241~0#1|))) (let ((.cse7 (= (_ bv0 8) |c_ULTIMATE.start_main_~input_242~0#1|)) (.cse2 (not .cse13)) (.cse1 (or (and (forall ((|v_ULTIMATE.start_main_~var_309_arg_1~0#1_13| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_128_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse11 (bvor ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_128_arg_1~0#1_13|) (bvshl ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_309_arg_1~0#1_13|))) (_ bv16 32))))) (or (= (bvand .cse11 |c_ULTIMATE.start_main_~msb_SORT_6~0#1|) (_ bv0 32)) (not (= (bvand (bvor (bvashr (bvor .cse11 .cse5) |c_ULTIMATE.start_main_~var_129~0#1|) .cse4) |c_ULTIMATE.start_main_~mask_SORT_6~0#1|) |c_ULTIMATE.start_main_~var_126~0#1|))))) (forall ((|v_ULTIMATE.start_main_~var_309_arg_1~0#1_13| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_128_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse12 (bvor ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_128_arg_1~0#1_13|) (bvshl ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_309_arg_1~0#1_13|))) (_ bv16 32))))) (or (not (= (bvand .cse12 |c_ULTIMATE.start_main_~msb_SORT_6~0#1|) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~var_126~0#1| (bvand |c_ULTIMATE.start_main_~mask_SORT_6~0#1| (bvashr (bvand .cse12 |c_ULTIMATE.start_main_~mask_SORT_6~0#1|) |c_ULTIMATE.start_main_~var_129~0#1|)))))))) .cse13))) (and (or (and .cse1 (or .cse2 (and (forall ((|v_ULTIMATE.start_main_~var_308_arg_1~0#1_13| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_128_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse3 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_308_arg_1~0#1_13|))))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_128_arg_1~0#1_13|)))) (or (= (bvand |c_ULTIMATE.start_main_~msb_SORT_6~0#1| .cse3) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~var_126~0#1| (bvand (bvor .cse4 (bvashr (bvor .cse5 .cse3) |c_ULTIMATE.start_main_~var_129~0#1|)) |c_ULTIMATE.start_main_~mask_SORT_6~0#1|)))))) (forall ((|v_ULTIMATE.start_main_~var_308_arg_1~0#1_13| (_ BitVec 16)) (|v_ULTIMATE.start_main_~var_128_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse6 (bvor (bvshl ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_308_arg_1~0#1_13|))))) (_ bv16 32)) ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_128_arg_1~0#1_13|)))) (or (not (= |c_ULTIMATE.start_main_~var_126~0#1| (bvand (bvashr (bvand |c_ULTIMATE.start_main_~mask_SORT_6~0#1| .cse6) |c_ULTIMATE.start_main_~var_129~0#1|) |c_ULTIMATE.start_main_~mask_SORT_6~0#1|))) (not (= (bvand |c_ULTIMATE.start_main_~msb_SORT_6~0#1| .cse6) (_ bv0 32))))))))) .cse7) (or (not .cse7) (and (or .cse2 (let ((.cse9 (bvshl ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |c_ULTIMATE.start_main_~state_19~0#1|))))) (_ bv16 32)))) (and (forall ((|v_ULTIMATE.start_main_~var_128_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse8 (bvor ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_128_arg_1~0#1_13|) .cse9))) (or (not (= |c_ULTIMATE.start_main_~var_126~0#1| (bvand (bvor (bvashr (bvor .cse5 .cse8) |c_ULTIMATE.start_main_~var_129~0#1|) .cse4) |c_ULTIMATE.start_main_~mask_SORT_6~0#1|))) (= (bvand |c_ULTIMATE.start_main_~msb_SORT_6~0#1| .cse8) (_ bv0 32))))) (forall ((|v_ULTIMATE.start_main_~var_128_arg_1~0#1_13| (_ BitVec 16))) (let ((.cse10 (bvor ((_ zero_extend 16) |v_ULTIMATE.start_main_~var_128_arg_1~0#1_13|) .cse9))) (or (not (= (bvand |c_ULTIMATE.start_main_~msb_SORT_6~0#1| .cse10) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~var_126~0#1| (bvand (bvashr (bvand .cse10 |c_ULTIMATE.start_main_~mask_SORT_6~0#1|) |c_ULTIMATE.start_main_~var_129~0#1|) |c_ULTIMATE.start_main_~mask_SORT_6~0#1|))))))))) .cse1)))))) (let ((.cse15 (exists ((|ULTIMATE.start_main_~var_309_arg_1~0#1| (_ BitVec 16))) (= |c_ULTIMATE.start_main_~state_19~0#1| ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~var_309_arg_1~0#1|)))))) (or (and (exists ((|ULTIMATE.start_main_~var_719_arg_0~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_1146_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_772_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_870_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_1008_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_1147_arg_1~0#1| (_ BitVec 8))) (= |c_ULTIMATE.start_main_~state_124~0#1| ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_1146_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_1008_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_870_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_772_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_719_arg_0~0#1|) (_ bv1 32)))) (_ bv1 32)))))))))))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_1147_arg_1~0#1|))))))) (_ bv1 32))))) (= (_ bv0 16) |c_ULTIMATE.start_main_~state_19~0#1|)) (and (exists ((|ULTIMATE.start_main_~var_719_arg_0~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_1146_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_772_arg_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet94#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~var_870_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_1008_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_1147_arg_1~0#1| (_ BitVec 8))) (let ((.cse14 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet94#1_15|) (_ bv1 32))))) (and (= |c_ULTIMATE.start_main_~state_124~0#1| ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_1146_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_870_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_772_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_719_arg_0~0#1|) (_ bv1 32)))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse14)))) (_ bv1 32)))) (_ bv0 32))))))))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_1008_arg_1~0#1|))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_1147_arg_1~0#1|)))))))))) (not (= .cse14 (_ bv0 8)))))) .cse15) (and .cse15 (exists ((|ULTIMATE.start_main_~var_719_arg_0~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet95#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~var_1146_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_772_arg_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet94#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~var_870_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_1008_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_1147_arg_1~0#1| (_ BitVec 8))) (let ((.cse16 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet95#1_15|) (_ bv1 32)))) (.cse17 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet94#1_15|) (_ bv1 32))))) (and (not (= .cse16 (_ bv0 8))) (= |c_ULTIMATE.start_main_~state_124~0#1| ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_1147_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_1146_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_870_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse16)))))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_719_arg_0~0#1|)))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse17)))) (_ bv1 32)))) (_ bv0 32))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_772_arg_1~0#1|))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_1008_arg_1~0#1|))))))))))))) (_ bv1 32)))) (not (= .cse17 (_ bv0 8))))))) (and (exists ((|ULTIMATE.start_main_~var_308_arg_1~0#1| (_ BitVec 16))) (= |c_ULTIMATE.start_main_~state_19~0#1| ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) ((_ zero_extend 16) |ULTIMATE.start_main_~var_308_arg_1~0#1|)))))) (exists ((|ULTIMATE.start_main_~var_719_arg_0~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet95#1_15| (_ BitVec 8)) (|ULTIMATE.start_main_~var_1146_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_772_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_870_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_1008_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_1147_arg_1~0#1| (_ BitVec 8))) (let ((.cse18 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet95#1_15|) (_ bv1 32))))) (and (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_1008_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_870_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~var_772_arg_1~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) .cse18)))))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_719_arg_0~0#1|)))) (_ bv1 32))))))))))))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_1146_arg_1~0#1|)))) ((_ zero_extend 24) |ULTIMATE.start_main_~var_1147_arg_1~0#1|))))))) (_ bv1 32))) |c_ULTIMATE.start_main_~state_124~0#1|) (not (= .cse18 (_ bv0 8))))))))) (= (_ bv0 32) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~mask_SORT_6~0#1|))) is different from false [2023-12-16 21:52:02,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 21:52:03,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 21:52:03,235 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2023-12-16 21:52:03,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 21:52:03,235 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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:52:03,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 21:52:03,235 INFO L225 Difference]: With dead ends: 14 [2023-12-16 21:52:03,235 INFO L226 Difference]: Without dead ends: 12 [2023-12-16 21:52:03,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=4, NotChecked=20, Total=156 [2023-12-16 21:52:03,237 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-16 21:52:03,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 14 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 7 Unchecked, 2.1s Time] [2023-12-16 21:52:03,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-12-16 21:52:03,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2023-12-16 21:52:03,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 21:52:03,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2023-12-16 21:52:03,241 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2023-12-16 21:52:03,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 21:52:03,241 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2023-12-16 21:52:03,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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:52:03,241 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2023-12-16 21:52:03,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 21:52:03,241 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 21:52:03,242 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2023-12-16 21:52:03,260 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 [2023-12-16 21:52:03,454 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:52:03,455 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 21:52:03,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 21:52:03,455 INFO L85 PathProgramCache]: Analyzing trace with hash -2112524529, now seen corresponding path program 2 times [2023-12-16 21:52:03,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 21:52:03,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [302158481] [2023-12-16 21:52:03,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 21:52:03,460 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:52:03,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 21:52:03,462 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:52:03,463 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:52:09,877 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 21:52:09,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 21:52:09,980 INFO L262 TraceCheckSpWp]: Trace formula consists of 6018 conjuncts, 132 conjunts are in the unsatisfiable core [2023-12-16 21:52:10,002 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 21:52:15,916 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 21:52:15,917 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-12-16 21:52:36,089 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 (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 21:52:36,090 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:52:36,339 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 21:52:36,381 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 [2023-12-16 21:52:36,579 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:52:36,580 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 11 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 12 known predicates. [2023-12-16 21:52:36,583 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1] [2023-12-16 21:52:36,585 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 21:52:36,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 09:52:36 BoogieIcfgContainer [2023-12-16 21:52:36,586 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 21:52:36,587 INFO L158 Benchmark]: Toolchain (without parser) took 70435.15ms. Allocated memory was 269.5MB in the beginning and 662.7MB in the end (delta: 393.2MB). Free memory was 208.3MB in the beginning and 563.9MB in the end (delta: -355.5MB). Peak memory consumption was 431.0MB. Max. memory is 8.0GB. [2023-12-16 21:52:36,587 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 213.9MB. Free memory was 157.8MB in the beginning and 157.7MB in the end (delta: 138.7kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 21:52:36,587 INFO L158 Benchmark]: CACSL2BoogieTranslator took 626.47ms. Allocated memory is still 269.5MB. Free memory was 208.3MB in the beginning and 172.5MB in the end (delta: 35.8MB). Peak memory consumption was 68.3MB. Max. memory is 8.0GB. [2023-12-16 21:52:36,587 INFO L158 Benchmark]: Boogie Procedure Inliner took 134.59ms. Allocated memory is still 269.5MB. Free memory was 172.5MB in the beginning and 146.4MB in the end (delta: 26.1MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-12-16 21:52:36,588 INFO L158 Benchmark]: Boogie Preprocessor took 203.00ms. Allocated memory is still 269.5MB. Free memory was 146.4MB in the beginning and 189.2MB in the end (delta: -42.8MB). Peak memory consumption was 39.5MB. Max. memory is 8.0GB. [2023-12-16 21:52:36,588 INFO L158 Benchmark]: RCFGBuilder took 4597.29ms. Allocated memory was 269.5MB in the beginning and 519.0MB in the end (delta: 249.6MB). Free memory was 189.2MB in the beginning and 421.2MB in the end (delta: -231.9MB). Peak memory consumption was 314.4MB. Max. memory is 8.0GB. [2023-12-16 21:52:36,588 INFO L158 Benchmark]: TraceAbstraction took 64869.50ms. Allocated memory was 519.0MB in the beginning and 662.7MB in the end (delta: 143.7MB). Free memory was 420.6MB in the beginning and 563.9MB in the end (delta: -143.2MB). Peak memory consumption was 393.1MB. Max. memory is 8.0GB. [2023-12-16 21:52:36,590 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 213.9MB. Free memory was 157.8MB in the beginning and 157.7MB in the end (delta: 138.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 626.47ms. Allocated memory is still 269.5MB. Free memory was 208.3MB in the beginning and 172.5MB in the end (delta: 35.8MB). Peak memory consumption was 68.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 134.59ms. Allocated memory is still 269.5MB. Free memory was 172.5MB in the beginning and 146.4MB in the end (delta: 26.1MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 203.00ms. Allocated memory is still 269.5MB. Free memory was 146.4MB in the beginning and 189.2MB in the end (delta: -42.8MB). Peak memory consumption was 39.5MB. Max. memory is 8.0GB. * RCFGBuilder took 4597.29ms. Allocated memory was 269.5MB in the beginning and 519.0MB in the end (delta: 249.6MB). Free memory was 189.2MB in the beginning and 421.2MB in the end (delta: -231.9MB). Peak memory consumption was 314.4MB. Max. memory is 8.0GB. * TraceAbstraction took 64869.50ms. Allocated memory was 519.0MB in the beginning and 662.7MB in the end (delta: 143.7MB). Free memory was 420.6MB in the beginning and 563.9MB in the end (delta: -143.2MB). Peak memory consumption was 393.1MB. 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 11 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 12 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 64.8s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 7 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41 IncrementalHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 4 mSDtfsCounter, 41 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 22.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=2, InterpolantAutomatonStates: 11, 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, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 15.7s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 15 ConstructedInterpolants, 7 QuantifiedInterpolants, 2224 SizeOfPredicates, 91 NumberOfNonLiveVariables, 3351 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/4 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