/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-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-03 09:01:54,142 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-03 09:01:54,213 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-03 09:01:54,220 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-03 09:01:54,220 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-03 09:01:54,250 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-03 09:01:54,251 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-03 09:01:54,251 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-03 09:01:54,252 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-03 09:01:54,253 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-03 09:01:54,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-03 09:01:54,254 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-03 09:01:54,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-03 09:01:54,256 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-03 09:01:54,256 INFO L153 SettingsManager]: * Use SBE=true [2024-11-03 09:01:54,256 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-03 09:01:54,256 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-03 09:01:54,257 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-03 09:01:54,257 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-03 09:01:54,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-03 09:01:54,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-03 09:01:54,261 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-03 09:01:54,261 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-03 09:01:54,261 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-03 09:01:54,262 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-03 09:01:54,262 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-03 09:01:54,262 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-03 09:01:54,262 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-03 09:01:54,262 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-03 09:01:54,263 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-03 09:01:54,263 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-03 09:01:54,263 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-03 09:01:54,263 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-03 09:01:54,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-03 09:01:54,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 09:01:54,264 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-03 09:01:54,265 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-03 09:01:54,265 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-03 09:01:54,265 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-03 09:01:54,265 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-03 09:01:54,266 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-03 09:01:54,266 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-03 09:01:54,266 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-03 09:01:54,266 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-03 09:01:54,266 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-03 09:01:54,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-03 09:01:54,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-03 09:01:54,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-03 09:01:54,544 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-03 09:01:54,544 INFO L274 PluginConnector]: CDTParser initialized [2024-11-03 09:01:54,546 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2024-11-03 09:01:55,984 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-03 09:01:56,152 INFO L384 CDTParser]: Found 1 translation units. [2024-11-03 09:01:56,153 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2024-11-03 09:01:56,161 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15b1b2897/870248384449430397c2ed37c086434b/FLAG24b7fd068 [2024-11-03 09:01:56,178 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15b1b2897/870248384449430397c2ed37c086434b [2024-11-03 09:01:56,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-03 09:01:56,182 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-03 09:01:56,185 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-03 09:01:56,185 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-03 09:01:56,191 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-03 09:01:56,191 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 09:01:56" (1/1) ... [2024-11-03 09:01:56,192 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eb399f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:01:56, skipping insertion in model container [2024-11-03 09:01:56,192 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 09:01:56" (1/1) ... [2024-11-03 09:01:56,214 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-03 09:01:56,391 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c[387,400] [2024-11-03 09:01:56,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 09:01:56,424 INFO L200 MainTranslator]: Completed pre-run [2024-11-03 09:01:56,436 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c[387,400] [2024-11-03 09:01:56,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 09:01:56,463 INFO L204 MainTranslator]: Completed translation [2024-11-03 09:01:56,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:01:56 WrapperNode [2024-11-03 09:01:56,465 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-03 09:01:56,466 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-03 09:01:56,466 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-03 09:01:56,466 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-03 09:01:56,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:01:56" (1/1) ... [2024-11-03 09:01:56,479 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:01:56" (1/1) ... [2024-11-03 09:01:56,498 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 57 [2024-11-03 09:01:56,499 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-03 09:01:56,500 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-03 09:01:56,500 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-03 09:01:56,500 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-03 09:01:56,510 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:01:56" (1/1) ... [2024-11-03 09:01:56,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:01:56" (1/1) ... [2024-11-03 09:01:56,514 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:01:56" (1/1) ... [2024-11-03 09:01:56,527 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-11-03 09:01:56,527 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:01:56" (1/1) ... [2024-11-03 09:01:56,527 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:01:56" (1/1) ... [2024-11-03 09:01:56,534 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:01:56" (1/1) ... [2024-11-03 09:01:56,543 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:01:56" (1/1) ... [2024-11-03 09:01:56,545 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:01:56" (1/1) ... [2024-11-03 09:01:56,546 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:01:56" (1/1) ... [2024-11-03 09:01:56,548 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-03 09:01:56,549 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-03 09:01:56,549 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-03 09:01:56,549 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-03 09:01:56,550 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:01:56" (1/1) ... [2024-11-03 09:01:56,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 09:01:56,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-03 09:01:56,578 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-03 09:01:56,580 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-03 09:01:56,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-03 09:01:56,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-03 09:01:56,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-03 09:01:56,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-03 09:01:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-03 09:01:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-03 09:01:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-03 09:01:56,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-03 09:01:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-03 09:01:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-03 09:01:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-03 09:01:56,662 INFO L238 CfgBuilder]: Building ICFG [2024-11-03 09:01:56,664 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-03 09:01:56,808 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-03 09:01:56,808 INFO L287 CfgBuilder]: Performing block encoding [2024-11-03 09:01:56,820 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-03 09:01:56,821 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-03 09:01:56,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 09:01:56 BoogieIcfgContainer [2024-11-03 09:01:56,822 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-03 09:01:56,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-03 09:01:56,826 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-03 09:01:56,829 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-03 09:01:56,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 09:01:56" (1/3) ... [2024-11-03 09:01:56,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b28562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 09:01:56, skipping insertion in model container [2024-11-03 09:01:56,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:01:56" (2/3) ... [2024-11-03 09:01:56,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b28562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 09:01:56, skipping insertion in model container [2024-11-03 09:01:56,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 09:01:56" (3/3) ... [2024-11-03 09:01:56,834 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_sendmail_tTflag_arr_one_loop.c [2024-11-03 09:01:56,850 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-03 09:01:56,850 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-03 09:01:56,909 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-03 09:01:56,915 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;@721787e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-03 09:01:56,915 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-03 09:01:56,920 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 09:01:56,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-03 09:01:56,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:56,929 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:01:56,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:56,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:56,935 INFO L85 PathProgramCache]: Analyzing trace with hash 212076531, now seen corresponding path program 1 times [2024-11-03 09:01:56,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:56,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [151769930] [2024-11-03 09:01:56,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:56,948 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-03 09:01:56,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:56,951 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-03 09:01:56,955 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-03 09:01:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:57,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:01:57,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:57,104 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-03 09:01:57,104 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:57,115 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-03 09:01:57,115 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:57,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [151769930] [2024-11-03 09:01:57,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [151769930] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:01:57,116 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:01:57,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-03 09:01:57,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691936066] [2024-11-03 09:01:57,118 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:01:57,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 09:01:57,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:57,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 09:01:57,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 09:01:57,148 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) [2024-11-03 09:01:57,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:57,203 INFO L93 Difference]: Finished difference Result 31 states and 45 transitions. [2024-11-03 09:01:57,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 09:01:57,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Word has length 8 [2024-11-03 09:01:57,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:57,211 INFO L225 Difference]: With dead ends: 31 [2024-11-03 09:01:57,211 INFO L226 Difference]: Without dead ends: 17 [2024-11-03 09:01:57,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 09:01:57,217 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:57,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 25 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 09:01:57,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-03 09:01:57,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2024-11-03 09:01:57,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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-03 09:01:57,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-11-03 09:01:57,250 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 8 [2024-11-03 09:01:57,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:57,250 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-11-03 09:01:57,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) [2024-11-03 09:01:57,251 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2024-11-03 09:01:57,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-03 09:01:57,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:57,251 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:01:57,256 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 [2024-11-03 09:01:57,454 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-03 09:01:57,454 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:57,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:57,455 INFO L85 PathProgramCache]: Analyzing trace with hash 780776823, now seen corresponding path program 1 times [2024-11-03 09:01:57,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:57,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1531327929] [2024-11-03 09:01:57,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:57,456 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-03 09:01:57,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:57,459 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-03 09:01:57,461 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-03 09:01:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:57,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-03 09:01:57,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:57,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:01:57,589 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:57,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:01:57,654 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:57,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1531327929] [2024-11-03 09:01:57,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1531327929] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:01:57,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:01:57,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-03 09:01:57,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465842221] [2024-11-03 09:01:57,655 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:01:57,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-03 09:01:57,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:57,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-03 09:01:57,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-03 09:01:57,658 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 09:01:57,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:57,776 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-11-03 09:01:57,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-03 09:01:57,778 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-03 09:01:57,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:57,779 INFO L225 Difference]: With dead ends: 31 [2024-11-03 09:01:57,779 INFO L226 Difference]: Without dead ends: 25 [2024-11-03 09:01:57,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-03 09:01:57,781 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 9 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:57,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 22 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 09:01:57,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-03 09:01:57,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2024-11-03 09:01:57,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 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-03 09:01:57,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-11-03 09:01:57,792 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 12 [2024-11-03 09:01:57,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:57,792 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-11-03 09:01:57,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 09:01:57,793 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-11-03 09:01:57,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-03 09:01:57,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:57,794 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:01:57,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-03 09:01:57,995 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-03 09:01:57,996 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:57,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:57,997 INFO L85 PathProgramCache]: Analyzing trace with hash -2109281665, now seen corresponding path program 2 times [2024-11-03 09:01:57,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:57,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1961164003] [2024-11-03 09:01:57,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:57,998 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-03 09:01:57,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:58,001 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-03 09:01:58,003 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-03 09:01:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:58,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-03 09:01:58,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:58,200 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:01:58,200 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:58,391 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:01:58,391 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:58,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1961164003] [2024-11-03 09:01:58,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1961164003] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:01:58,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:01:58,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-03 09:01:58,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510223253] [2024-11-03 09:01:58,392 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:01:58,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-03 09:01:58,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:58,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-03 09:01:58,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2024-11-03 09:01:58,395 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 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-03 09:01:58,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:58,624 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2024-11-03 09:01:58,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-03 09:01:58,626 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 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 20 [2024-11-03 09:01:58,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:58,627 INFO L225 Difference]: With dead ends: 41 [2024-11-03 09:01:58,627 INFO L226 Difference]: Without dead ends: 35 [2024-11-03 09:01:58,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2024-11-03 09:01:58,629 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 12 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:58,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 44 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 09:01:58,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-03 09:01:58,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2024-11-03 09:01:58,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 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-03 09:01:58,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2024-11-03 09:01:58,637 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 20 [2024-11-03 09:01:58,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:58,637 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2024-11-03 09:01:58,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 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-03 09:01:58,638 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2024-11-03 09:01:58,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-03 09:01:58,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:58,639 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:01:58,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-03 09:01:58,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 09:01:58,840 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:58,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:58,841 INFO L85 PathProgramCache]: Analyzing trace with hash 2041591177, now seen corresponding path program 3 times [2024-11-03 09:01:58,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:58,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [338611858] [2024-11-03 09:01:58,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:58,841 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-03 09:01:58,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:58,845 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-03 09:01:58,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-03 09:01:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:58,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-03 09:01:58,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:58,960 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-03 09:01:58,960 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:58,983 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-03 09:01:58,983 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:58,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [338611858] [2024-11-03 09:01:58,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [338611858] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:01:58,988 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:01:58,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-03 09:01:58,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835789483] [2024-11-03 09:01:58,989 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:01:58,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-03 09:01:58,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:58,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-03 09:01:58,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-03 09:01:58,990 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-03 09:01:59,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:01:59,032 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2024-11-03 09:01:59,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-03 09:01:59,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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 30 [2024-11-03 09:01:59,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:01:59,033 INFO L225 Difference]: With dead ends: 38 [2024-11-03 09:01:59,034 INFO L226 Difference]: Without dead ends: 33 [2024-11-03 09:01:59,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-03 09:01:59,035 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 09:01:59,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 21 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 09:01:59,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-03 09:01:59,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-03 09:01:59,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 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-03 09:01:59,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2024-11-03 09:01:59,043 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2024-11-03 09:01:59,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:01:59,043 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2024-11-03 09:01:59,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-03 09:01:59,044 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2024-11-03 09:01:59,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-03 09:01:59,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:01:59,045 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:01:59,048 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 (5)] Ended with exit code 0 [2024-11-03 09:01:59,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-03 09:01:59,246 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:01:59,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:01:59,246 INFO L85 PathProgramCache]: Analyzing trace with hash -777640855, now seen corresponding path program 1 times [2024-11-03 09:01:59,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:01:59,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2032496280] [2024-11-03 09:01:59,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:01:59,247 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-03 09:01:59,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:01:59,248 INFO L229 MonitoredProcess]: Starting monitored process 6 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-03 09:01:59,249 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 (6)] Waiting until timeout for monitored process [2024-11-03 09:01:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:01:59,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-03 09:01:59,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:01:59,608 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-03 09:01:59,608 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:01:59,860 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-03 09:01:59,860 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:01:59,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2032496280] [2024-11-03 09:01:59,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2032496280] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:01:59,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:01:59,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-03 09:01:59,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81667636] [2024-11-03 09:01:59,861 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:01:59,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-03 09:01:59,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:01:59,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-03 09:01:59,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-03 09:01:59,863 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 09:02:00,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:02:00,408 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2024-11-03 09:02:00,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-03 09:02:00,409 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-03 09:02:00,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:02:00,410 INFO L225 Difference]: With dead ends: 44 [2024-11-03 09:02:00,410 INFO L226 Difference]: Without dead ends: 37 [2024-11-03 09:02:00,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-03 09:02:00,411 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 14 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-03 09:02:00,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 29 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-03 09:02:00,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-03 09:02:00,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-03 09:02:00,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 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-03 09:02:00,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2024-11-03 09:02:00,432 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 32 [2024-11-03 09:02:00,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:02:00,432 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2024-11-03 09:02:00,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 09:02:00,433 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2024-11-03 09:02:00,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-03 09:02:00,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:02:00,434 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:02:00,440 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 (6)] Ended with exit code 0 [2024-11-03 09:02:00,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-03 09:02:00,635 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:02:00,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:02:00,636 INFO L85 PathProgramCache]: Analyzing trace with hash 2139052585, now seen corresponding path program 2 times [2024-11-03 09:02:00,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:02:00,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [666069031] [2024-11-03 09:02:00,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:02:00,636 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-03 09:02:00,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:02:00,638 INFO L229 MonitoredProcess]: Starting monitored process 7 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-03 09:02:00,638 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 (7)] Waiting until timeout for monitored process [2024-11-03 09:02:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:02:00,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-03 09:02:00,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:02:46,781 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 20 refuted. 1 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-03 09:02:46,782 INFO L311 TraceCheckSpWp]: Computing backward predicates...