/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.h_RCU.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-05 09:34:53,340 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 09:34:53,418 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-05 09:34:53,424 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 09:34:53,425 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 09:34:53,449 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 09:34:53,450 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 09:34:53,450 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 09:34:53,451 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 09:34:53,452 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 09:34:53,452 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 09:34:53,452 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 09:34:53,453 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 09:34:53,453 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 09:34:53,453 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 09:34:53,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 09:34:53,456 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 09:34:53,458 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 09:34:53,458 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 09:34:53,458 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 09:34:53,459 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 09:34:53,459 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 09:34:53,459 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 09:34:53,460 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 09:34:53,460 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 09:34:53,460 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 09:34:53,460 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 09:34:53,461 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 09:34:53,461 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 09:34:53,461 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 09:34:53,461 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 09:34:53,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 09:34:53,462 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 09:34:53,464 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 09:34:53,464 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 09:34:53,464 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 09:34:53,465 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 09:34:53,465 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 09:34:53,465 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 09:34:53,465 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 09:34:53,465 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 09:34:53,466 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 09:34:53,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 09:34:53,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 09:34:53,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 09:34:53,709 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 09:34:53,710 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 09:34:53,711 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.h_RCU.c [2024-11-05 09:34:55,108 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 09:34:55,480 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 09:34:55,481 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.h_RCU.c [2024-11-05 09:34:55,511 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1932d9a13/01277755149040f6bfe37e6e3fe70e60/FLAGed3180660 [2024-11-05 09:34:55,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1932d9a13/01277755149040f6bfe37e6e3fe70e60 [2024-11-05 09:34:55,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 09:34:55,531 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 09:34:55,532 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 09:34:55,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 09:34:55,537 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 09:34:55,538 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 09:34:55" (1/1) ... [2024-11-05 09:34:55,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ca51055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:34:55, skipping insertion in model container [2024-11-05 09:34:55,539 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 09:34:55" (1/1) ... [2024-11-05 09:34:55,658 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 09:34:55,932 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.h_RCU.c[1245,1258] [2024-11-05 09:34:56,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 09:34:56,591 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 09:34:56,600 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.h_RCU.c[1245,1258] [2024-11-05 09:34:56,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 09:34:56,912 INFO L204 MainTranslator]: Completed translation [2024-11-05 09:34:56,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:34:56 WrapperNode [2024-11-05 09:34:56,914 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 09:34:56,915 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 09:34:56,916 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 09:34:56,916 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 09:34:56,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:34:56" (1/1) ... [2024-11-05 09:34:57,037 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:34:56" (1/1) ... [2024-11-05 09:34:57,329 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 8042 [2024-11-05 09:34:57,329 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 09:34:57,330 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 09:34:57,331 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 09:34:57,331 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 09:34:57,341 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:34:56" (1/1) ... [2024-11-05 09:34:57,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:34:56" (1/1) ... [2024-11-05 09:34:57,492 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:34:56" (1/1) ... [2024-11-05 09:34:57,562 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-05 09:34:57,563 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:34:56" (1/1) ... [2024-11-05 09:34:57,563 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:34:56" (1/1) ... [2024-11-05 09:34:57,656 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:34:56" (1/1) ... [2024-11-05 09:34:57,678 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:34:56" (1/1) ... [2024-11-05 09:34:57,706 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:34:56" (1/1) ... [2024-11-05 09:34:57,731 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:34:56" (1/1) ... [2024-11-05 09:34:57,784 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 09:34:57,785 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 09:34:57,785 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 09:34:57,786 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 09:34:57,786 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:34:56" (1/1) ... [2024-11-05 09:34:57,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 09:34:57,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 09:34:57,816 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-05 09:34:57,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-05 09:34:57,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 09:34:57,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 09:34:57,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-05 09:34:57,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 09:34:57,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 09:34:58,787 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 09:34:58,789 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 09:35:05,940 INFO L? ?]: Removed 330 outVars from TransFormulas that were not future-live. [2024-11-05 09:35:05,941 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 09:35:05,953 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 09:35:05,954 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 09:35:05,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 09:35:05 BoogieIcfgContainer [2024-11-05 09:35:05,955 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 09:35:05,957 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 09:35:05,957 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 09:35:05,960 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 09:35:05,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 09:34:55" (1/3) ... [2024-11-05 09:35:05,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79d230d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 09:35:05, skipping insertion in model container [2024-11-05 09:35:05,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:34:56" (2/3) ... [2024-11-05 09:35:05,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79d230d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 09:35:05, skipping insertion in model container [2024-11-05 09:35:05,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 09:35:05" (3/3) ... [2024-11-05 09:35:05,963 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_RCU.c [2024-11-05 09:35:05,977 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 09:35:05,977 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 09:35:06,031 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 09:35:06,038 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@20ef3226, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 09:35:06,038 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 09:35:06,041 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 09:35:06,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-05 09:35:06,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 09:35:06,048 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-05 09:35:06,048 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 09:35:06,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 09:35:06,053 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-05 09:35:06,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 09:35:06,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [640381814] [2024-11-05 09:35:06,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 09:35:06,063 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 09:35:06,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 09:35:06,066 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 09:35:06,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-05 09:35:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 09:35:07,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-05 09:35:07,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 09:35:07,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 09:35:07,704 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 09:35:07,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 09:35:07,846 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 09:35:07,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [640381814] [2024-11-05 09:35:07,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [640381814] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 09:35:07,848 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 09:35:07,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-05 09:35:07,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866043206] [2024-11-05 09:35:07,851 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 09:35:07,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 09:35:07,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 09:35:07,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 09:35:07,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 09:35:07,878 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 09:35:08,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 09:35:08,132 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-05 09:35:08,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 09:35:08,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-05 09:35:08,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 09:35:08,141 INFO L225 Difference]: With dead ends: 18 [2024-11-05 09:35:08,141 INFO L226 Difference]: Without dead ends: 10 [2024-11-05 09:35:08,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-05 09:35:08,146 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 09:35:08,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 14 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 09:35:08,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-05 09:35:08,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-05 09:35:08,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 09:35:08,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-05 09:35:08,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-05 09:35:08,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 09:35:08,174 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-05 09:35:08,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 09:35:08,174 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-05 09:35:08,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-05 09:35:08,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 09:35:08,175 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-05 09:35:08,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-05 09:35:08,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 09:35:08,380 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 09:35:08,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 09:35:08,381 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-05 09:35:08,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 09:35:08,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1023077178] [2024-11-05 09:35:08,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 09:35:08,382 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 09:35:08,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 09:35:08,383 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 09:35:08,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-05 09:35:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 09:35:10,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-05 09:35:10,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 09:35:10,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 09:35:10,722 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 09:35:19,086 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (forall ((|v_ULTIMATE.start_main_~var_34_arg_0~0#1_11| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_19_arg_0~0#1_11| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_29_arg_1~0#1_11| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_0~0#1_11|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_29_arg_1~0#1_11|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_34_arg_0~0#1_11|)))))))) (let ((.cse29 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_7~0#1|)) (.cse30 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_14~0#1|))) (let ((.cse7 (forall ((|ULTIMATE.start_main_~input_4~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_3~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_238~0#1| (_ BitVec 32))) (let ((.cse31 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_3~0#1|))) (or (not (bvuge ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_4~0#1|) .cse31))) |c_ULTIMATE.start_main_~var_17~0#1|)) (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) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 .cse31))) |ULTIMATE.start_main_~var_238~0#1|))))))))))) .cse31))) |c_ULTIMATE.start_main_~var_17~0#1|)))))) (.cse8 (= ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_97~0#1|) .cse29)) (.cse5 (= ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_182~0#1|) .cse29)) (.cse22 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_13~0#1|)))))))))) (.cse26 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 (_ bv1 32))))) (.cse3 (= ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_165~0#1|) .cse29)) (.cse25 ((_ zero_extend 24) ((_ extract 7 0) .cse30)))) (let ((.cse1 (= .cse29 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_115~0#1|))) (.cse2 (forall ((|ULTIMATE.start_main_~input_4~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_3~0#1| (_ BitVec 8))) (let ((.cse28 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_3~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse25 .cse28))) |c_ULTIMATE.start_main_~var_17~0#1|)) (bvuge ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_4~0#1|) .cse28))) |c_ULTIMATE.start_main_~var_17~0#1|))))) (.cse12 (not .cse3)) (.cse10 (or (forall ((|ULTIMATE.start_main_~input_4~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_3~0#1| (_ BitVec 8))) (let ((.cse27 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_3~0#1|))) (or (not (bvuge ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_4~0#1|) .cse27))) |c_ULTIMATE.start_main_~var_17~0#1|)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse27))) |c_ULTIMATE.start_main_~var_17~0#1|))))) .cse26)) (.cse13 (not .cse5)) (.cse6 (not .cse8)) (.cse15 (or .cse7 .cse26)) (.cse16 (not .cse26))) (and (or (not .cse1) (let ((.cse11 (or .cse7 .cse16))) (let ((.cse4 (or .cse13 (let ((.cse14 (and .cse15 .cse11))) (and (or .cse14 .cse6) (or .cse14 .cse8)))))) (and .cse2 (or .cse3 (and .cse4 (or .cse5 (and (or .cse6 .cse7) (or .cse8 .cse7))))) (or (and (or .cse5 (let ((.cse9 (and .cse10 .cse11))) (and (or .cse8 .cse9) (or .cse6 .cse9)))) .cse4) .cse12))))) (or .cse1 (let ((.cse17 (forall ((|ULTIMATE.start_main_~input_4~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_3~0#1| (_ BitVec 8))) (let ((.cse24 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_3~0#1|))) (or (not (bvuge ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_4~0#1|) .cse24))) |c_ULTIMATE.start_main_~var_17~0#1|)) (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) ((_ zero_extend 24) ((_ extract 7 0) .cse25)))))))) .cse24))) |c_ULTIMATE.start_main_~var_17~0#1|))))))) (let ((.cse20 (or .cse16 .cse17)) (.cse21 (forall ((|ULTIMATE.start_main_~input_4~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_3~0#1| (_ BitVec 8))) (let ((.cse23 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_3~0#1|))) (or (not (= |c_ULTIMATE.start_main_~var_17~0#1| ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse22)) .cse23))))) (not (bvuge ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_4~0#1|) .cse23))) |c_ULTIMATE.start_main_~var_17~0#1|))))))) (let ((.cse19 (or .cse13 (and (or .cse8 (and .cse15 .cse20)) (or .cse6 (and .cse15 (or .cse21 .cse16)))))) (.cse18 (or .cse6 .cse21))) (and .cse2 (or .cse3 (and (or (and (or .cse8 .cse17) .cse18) .cse5) .cse19)) (or .cse12 (and .cse19 (or (and (or (and .cse10 .cse20) .cse8) .cse18) .cse5)))))))))))))) is different from false [2024-11-05 09:35:23,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-05 09:35:23,076 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 09:35:23,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1023077178] [2024-11-05 09:35:23,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1023077178] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 09:35:23,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 09:35:23,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-05 09:35:23,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291593213] [2024-11-05 09:35:23,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 09:35:23,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 09:35:23,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 09:35:23,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 09:35:23,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2024-11-05 09:35:23,080 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 09:35:23,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 09:35:23,695 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-05 09:35:23,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 09:35:23,696 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-05 09:35:23,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 09:35:23,696 INFO L225 Difference]: With dead ends: 15 [2024-11-05 09:35:23,696 INFO L226 Difference]: Without dead ends: 13 [2024-11-05 09:35:23,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=31, Invalid=44, Unknown=1, NotChecked=14, Total=90 [2024-11-05 09:35:23,698 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-05 09:35:23,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 15 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 6 Unchecked, 0.3s Time] [2024-11-05 09:35:23,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-05 09:35:23,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-11-05 09:35:23,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 09:35:23,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-05 09:35:23,701 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-05 09:35:23,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 09:35:23,702 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-05 09:35:23,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-05 09:35:23,702 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-05 09:35:23,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-05 09:35:23,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 09:35:23,702 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-05 09:35:23,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-05 09:35:23,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 09:35:23,904 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 09:35:23,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 09:35:23,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-05 09:35:23,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 09:35:23,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [95830456] [2024-11-05 09:35:23,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 09:35:23,905 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 09:35:23,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 09:35:23,906 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 09:35:23,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-05 09:35:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 09:35:26,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-05 09:35:26,155 INFO L278 TraceCheckSpWp]: Computing forward predicates...