/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 bitwuzla -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/bitvector/soft_float_4-3a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-03 13:37:38,344 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-03 13:37:38,428 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 13:37:38,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-03 13:37:38,434 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-03 13:37:38,466 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-03 13:37:38,467 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-03 13:37:38,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-03 13:37:38,469 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-03 13:37:38,470 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-03 13:37:38,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-03 13:37:38,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-03 13:37:38,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-03 13:37:38,472 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-03 13:37:38,472 INFO L153 SettingsManager]: * Use SBE=true [2024-11-03 13:37:38,472 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-03 13:37:38,472 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-03 13:37:38,473 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-03 13:37:38,473 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-03 13:37:38,476 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-03 13:37:38,478 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-03 13:37:38,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-03 13:37:38,478 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-03 13:37:38,478 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-03 13:37:38,479 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-03 13:37:38,479 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-03 13:37:38,479 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-03 13:37:38,479 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-03 13:37:38,479 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-03 13:37:38,480 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-03 13:37:38,480 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-03 13:37:38,480 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-03 13:37:38,480 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-03 13:37:38,481 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-03 13:37:38,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 13:37:38,481 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-03 13:37:38,482 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-03 13:37:38,483 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-03 13:37:38,483 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-03 13:37:38,483 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-03 13:37:38,483 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-03 13:37:38,483 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-03 13:37:38,484 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-03 13:37:38,484 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-03 13:37:38,484 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 -> bitwuzla [2024-11-03 13:37:38,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-03 13:37:38,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-03 13:37:38,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-03 13:37:38,752 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-03 13:37:38,753 INFO L274 PluginConnector]: CDTParser initialized [2024-11-03 13:37:38,755 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/soft_float_4-3a.c.cil.c [2024-11-03 13:37:40,216 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-03 13:37:40,410 INFO L384 CDTParser]: Found 1 translation units. [2024-11-03 13:37:40,411 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_4-3a.c.cil.c [2024-11-03 13:37:40,418 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0df409556/9d8ec68485ce413d89847e28242c5a66/FLAGaa56d7a80 [2024-11-03 13:37:40,810 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0df409556/9d8ec68485ce413d89847e28242c5a66 [2024-11-03 13:37:40,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-03 13:37:40,814 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-03 13:37:40,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-03 13:37:40,815 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-03 13:37:40,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-03 13:37:40,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:37:40" (1/1) ... [2024-11-03 13:37:40,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@238a2458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:37:40, skipping insertion in model container [2024-11-03 13:37:40,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:37:40" (1/1) ... [2024-11-03 13:37:40,856 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-03 13:37:40,998 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/soft_float_4-3a.c.cil.c[730,743] [2024-11-03 13:37:41,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 13:37:41,049 INFO L200 MainTranslator]: Completed pre-run [2024-11-03 13:37:41,061 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/soft_float_4-3a.c.cil.c[730,743] [2024-11-03 13:37:41,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 13:37:41,105 INFO L204 MainTranslator]: Completed translation [2024-11-03 13:37:41,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:37:41 WrapperNode [2024-11-03 13:37:41,106 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-03 13:37:41,107 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-03 13:37:41,107 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-03 13:37:41,107 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-03 13:37:41,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:37:41" (1/1) ... [2024-11-03 13:37:41,121 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:37:41" (1/1) ... [2024-11-03 13:37:41,136 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2024-11-03 13:37:41,137 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-03 13:37:41,138 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-03 13:37:41,138 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-03 13:37:41,138 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-03 13:37:41,150 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:37:41" (1/1) ... [2024-11-03 13:37:41,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:37:41" (1/1) ... [2024-11-03 13:37:41,153 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:37:41" (1/1) ... [2024-11-03 13:37:41,165 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-03 13:37:41,165 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:37:41" (1/1) ... [2024-11-03 13:37:41,166 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:37:41" (1/1) ... [2024-11-03 13:37:41,176 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:37:41" (1/1) ... [2024-11-03 13:37:41,180 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:37:41" (1/1) ... [2024-11-03 13:37:41,181 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:37:41" (1/1) ... [2024-11-03 13:37:41,183 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:37:41" (1/1) ... [2024-11-03 13:37:41,185 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-03 13:37:41,186 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-03 13:37:41,186 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-03 13:37:41,186 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-03 13:37:41,187 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:37:41" (1/1) ... [2024-11-03 13:37:41,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 13:37:41,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-03 13:37:41,217 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 13:37:41,221 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 13:37:41,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-03 13:37:41,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-03 13:37:41,248 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-03 13:37:41,248 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-03 13:37:41,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-03 13:37:41,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-03 13:37:41,248 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-11-03 13:37:41,249 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-11-03 13:37:41,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-03 13:37:41,249 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-03 13:37:41,337 INFO L238 CfgBuilder]: Building ICFG [2024-11-03 13:37:41,339 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-03 13:37:41,641 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-03 13:37:41,641 INFO L287 CfgBuilder]: Performing block encoding [2024-11-03 13:37:41,657 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-03 13:37:41,658 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-03 13:37:41,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:37:41 BoogieIcfgContainer [2024-11-03 13:37:41,660 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-03 13:37:41,663 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-03 13:37:41,663 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-03 13:37:41,667 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-03 13:37:41,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:37:40" (1/3) ... [2024-11-03 13:37:41,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ea21c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:37:41, skipping insertion in model container [2024-11-03 13:37:41,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:37:41" (2/3) ... [2024-11-03 13:37:41,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ea21c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:37:41, skipping insertion in model container [2024-11-03 13:37:41,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:37:41" (3/3) ... [2024-11-03 13:37:41,670 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2024-11-03 13:37:41,687 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-03 13:37:41,687 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-03 13:37:41,755 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-03 13:37:41,787 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;@6096eeba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-03 13:37:41,788 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-03 13:37:41,799 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 40 states have (on average 1.475) internal successors, (59), 41 states have internal predecessors, (59), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-03 13:37:41,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-03 13:37:41,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 13:37:41,809 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 13:37:41,809 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 13:37:41,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 13:37:41,814 INFO L85 PathProgramCache]: Analyzing trace with hash 173410466, now seen corresponding path program 1 times [2024-11-03 13:37:41,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 13:37:41,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [956315716] [2024-11-03 13:37:41,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 13:37:41,826 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-03 13:37:41,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 13:37:41,829 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-03 13:37:41,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (2)] Waiting until timeout for monitored process [2024-11-03 13:37:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 13:37:41,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-03 13:37:41,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 13:37:42,189 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-03 13:37:42,189 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 13:37:42,360 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-03 13:37:42,361 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 13:37:42,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [956315716] [2024-11-03 13:37:42,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [956315716] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 13:37:42,362 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 13:37:42,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 8] imperfect sequences [] total 14 [2024-11-03 13:37:42,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518612395] [2024-11-03 13:37:42,369 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 13:37:42,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-03 13:37:42,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 13:37:42,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-03 13:37:42,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-03 13:37:42,405 INFO L87 Difference]: Start difference. First operand has 54 states, 40 states have (on average 1.475) internal successors, (59), 41 states have internal predecessors, (59), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 14 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-03 13:37:42,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 13:37:42,728 INFO L93 Difference]: Finished difference Result 164 states and 258 transitions. [2024-11-03 13:37:42,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-03 13:37:42,731 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 31 [2024-11-03 13:37:42,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 13:37:42,739 INFO L225 Difference]: With dead ends: 164 [2024-11-03 13:37:42,739 INFO L226 Difference]: Without dead ends: 103 [2024-11-03 13:37:42,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-03 13:37:42,746 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 56 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 13:37:42,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 823 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 13:37:42,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-03 13:37:42,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 86. [2024-11-03 13:37:42,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 63 states have internal predecessors, (79), 18 states have call successors, (18), 5 states have call predecessors, (18), 6 states have return successors, (21), 17 states have call predecessors, (21), 17 states have call successors, (21) [2024-11-03 13:37:42,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 118 transitions. [2024-11-03 13:37:42,801 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 118 transitions. Word has length 31 [2024-11-03 13:37:42,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 13:37:42,802 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 118 transitions. [2024-11-03 13:37:42,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-03 13:37:42,802 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 118 transitions. [2024-11-03 13:37:42,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-03 13:37:42,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 13:37:42,805 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 13:37:42,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (2)] Ended with exit code 0 [2024-11-03 13:37:43,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 13:37:43,008 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 13:37:43,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 13:37:43,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1707598935, now seen corresponding path program 1 times [2024-11-03 13:37:43,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 13:37:43,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1476630237] [2024-11-03 13:37:43,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 13:37:43,010 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-03 13:37:43,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 13:37:43,012 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-03 13:37:43,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (3)] Waiting until timeout for monitored process [2024-11-03 13:37:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 13:37:43,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-03 13:37:43,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 13:37:43,159 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-03 13:37:43,160 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 13:37:43,220 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-03 13:37:43,220 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 13:37:43,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1476630237] [2024-11-03 13:37:43,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1476630237] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 13:37:43,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 13:37:43,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-03 13:37:43,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748862913] [2024-11-03 13:37:43,221 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 13:37:43,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-03 13:37:43,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 13:37:43,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-03 13:37:43,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-03 13:37:43,228 INFO L87 Difference]: Start difference. First operand 86 states and 118 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-03 13:37:43,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 13:37:43,368 INFO L93 Difference]: Finished difference Result 144 states and 193 transitions. [2024-11-03 13:37:43,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-03 13:37:43,371 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2024-11-03 13:37:43,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 13:37:43,375 INFO L225 Difference]: With dead ends: 144 [2024-11-03 13:37:43,375 INFO L226 Difference]: Without dead ends: 104 [2024-11-03 13:37:43,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-03 13:37:43,378 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 15 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 13:37:43,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 480 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 13:37:43,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-03 13:37:43,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2024-11-03 13:37:43,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 71 states have (on average 1.267605633802817) internal successors, (90), 73 states have internal predecessors, (90), 18 states have call successors, (18), 7 states have call predecessors, (18), 8 states have return successors, (21), 17 states have call predecessors, (21), 17 states have call successors, (21) [2024-11-03 13:37:43,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 129 transitions. [2024-11-03 13:37:43,394 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 129 transitions. Word has length 35 [2024-11-03 13:37:43,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 13:37:43,395 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 129 transitions. [2024-11-03 13:37:43,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-03 13:37:43,395 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 129 transitions. [2024-11-03 13:37:43,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-03 13:37:43,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 13:37:43,397 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 13:37:43,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (3)] Ended with exit code 0 [2024-11-03 13:37:43,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 13:37:43,600 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 13:37:43,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 13:37:43,601 INFO L85 PathProgramCache]: Analyzing trace with hash -786298741, now seen corresponding path program 1 times [2024-11-03 13:37:43,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 13:37:43,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [373310892] [2024-11-03 13:37:43,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 13:37:43,602 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-03 13:37:43,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 13:37:43,604 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-03 13:37:43,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (4)] Waiting until timeout for monitored process [2024-11-03 13:37:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 13:37:43,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-03 13:37:43,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 13:37:43,716 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-03 13:37:43,716 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 13:37:43,765 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-03 13:37:43,766 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 13:37:43,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [373310892] [2024-11-03 13:37:43,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [373310892] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 13:37:43,766 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 13:37:43,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2024-11-03 13:37:43,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780921326] [2024-11-03 13:37:43,767 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 13:37:43,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-03 13:37:43,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 13:37:43,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-03 13:37:43,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-03 13:37:43,769 INFO L87 Difference]: Start difference. First operand 98 states and 129 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-03 13:37:43,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 13:37:43,840 INFO L93 Difference]: Finished difference Result 151 states and 200 transitions. [2024-11-03 13:37:43,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-03 13:37:43,840 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-11-03 13:37:43,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 13:37:43,842 INFO L225 Difference]: With dead ends: 151 [2024-11-03 13:37:43,842 INFO L226 Difference]: Without dead ends: 111 [2024-11-03 13:37:43,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-03 13:37:43,844 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 12 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 13:37:43,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 426 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 13:37:43,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-03 13:37:43,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 104. [2024-11-03 13:37:43,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 76 states have (on average 1.25) internal successors, (95), 78 states have internal predecessors, (95), 18 states have call successors, (18), 8 states have call predecessors, (18), 9 states have return successors, (21), 17 states have call predecessors, (21), 17 states have call successors, (21) [2024-11-03 13:37:43,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 134 transitions. [2024-11-03 13:37:43,861 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 134 transitions. Word has length 35 [2024-11-03 13:37:43,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 13:37:43,862 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 134 transitions. [2024-11-03 13:37:43,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-03 13:37:43,865 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 134 transitions. [2024-11-03 13:37:43,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-03 13:37:43,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 13:37:43,867 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 13:37:43,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (4)] Ended with exit code 0 [2024-11-03 13:37:44,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 13:37:44,068 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 13:37:44,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 13:37:44,069 INFO L85 PathProgramCache]: Analyzing trace with hash -54729342, now seen corresponding path program 2 times [2024-11-03 13:37:44,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 13:37:44,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2056333782] [2024-11-03 13:37:44,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 13:37:44,070 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-03 13:37:44,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 13:37:44,072 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-03 13:37:44,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (5)] Waiting until timeout for monitored process [2024-11-03 13:37:44,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 13:37:44,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-03 13:37:44,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 13:37:44,288 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-03 13:37:44,288 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 13:37:44,452 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-03 13:37:44,452 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 13:37:44,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2056333782] [2024-11-03 13:37:44,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2056333782] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 13:37:44,453 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 13:37:44,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2024-11-03 13:37:44,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250276298] [2024-11-03 13:37:44,453 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 13:37:44,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-03 13:37:44,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 13:37:44,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-03 13:37:44,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-03 13:37:44,455 INFO L87 Difference]: Start difference. First operand 104 states and 134 transitions. Second operand has 10 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-03 13:37:45,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-03 13:37:45,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 13:37:45,667 INFO L93 Difference]: Finished difference Result 112 states and 142 transitions. [2024-11-03 13:37:45,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-03 13:37:45,668 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-11-03 13:37:45,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 13:37:45,669 INFO L225 Difference]: With dead ends: 112 [2024-11-03 13:37:45,669 INFO L226 Difference]: Without dead ends: 110 [2024-11-03 13:37:45,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-03 13:37:45,672 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 6 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-03 13:37:45,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 370 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-03 13:37:45,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-03 13:37:45,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2024-11-03 13:37:45,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 79 states have (on average 1.240506329113924) internal successors, (98), 81 states have internal predecessors, (98), 18 states have call successors, (18), 9 states have call predecessors, (18), 10 states have return successors, (21), 17 states have call predecessors, (21), 17 states have call successors, (21) [2024-11-03 13:37:45,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 137 transitions. [2024-11-03 13:37:45,689 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 137 transitions. Word has length 39 [2024-11-03 13:37:45,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 13:37:45,689 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 137 transitions. [2024-11-03 13:37:45,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-03 13:37:45,690 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 137 transitions. [2024-11-03 13:37:45,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-03 13:37:45,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 13:37:45,691 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 13:37:45,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (5)] Ended with exit code 0 [2024-11-03 13:37:45,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 13:37:45,892 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 13:37:45,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 13:37:45,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1837968146, now seen corresponding path program 1 times [2024-11-03 13:37:45,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 13:37:45,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [714260] [2024-11-03 13:37:45,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 13:37:45,893 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-03 13:37:45,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 13:37:45,895 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-03 13:37:45,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (6)] Waiting until timeout for monitored process [2024-11-03 13:37:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 13:37:45,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-03 13:37:45,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 13:37:46,172 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-03 13:37:46,172 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 13:37:46,622 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-03 13:37:46,622 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 13:37:46,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [714260] [2024-11-03 13:37:46,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [714260] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-03 13:37:46,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-03 13:37:46,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [16] total 27 [2024-11-03 13:37:46,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605611510] [2024-11-03 13:37:46,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-03 13:37:46,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-03 13:37:46,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 13:37:46,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-03 13:37:46,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2024-11-03 13:37:46,624 INFO L87 Difference]: Start difference. First operand 108 states and 137 transitions. Second operand has 15 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-03 13:37:47,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 13:37:47,006 INFO L93 Difference]: Finished difference Result 149 states and 190 transitions. [2024-11-03 13:37:47,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-03 13:37:47,007 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 44 [2024-11-03 13:37:47,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 13:37:47,011 INFO L225 Difference]: With dead ends: 149 [2024-11-03 13:37:47,011 INFO L226 Difference]: Without dead ends: 141 [2024-11-03 13:37:47,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=821, Unknown=0, NotChecked=0, Total=930 [2024-11-03 13:37:47,015 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 27 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-03 13:37:47,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 740 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-03 13:37:47,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-03 13:37:47,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 111. [2024-11-03 13:37:47,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 83 states have internal predecessors, (101), 18 states have call successors, (18), 9 states have call predecessors, (18), 10 states have return successors, (21), 18 states have call predecessors, (21), 17 states have call successors, (21) [2024-11-03 13:37:47,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 140 transitions. [2024-11-03 13:37:47,040 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 140 transitions. Word has length 44 [2024-11-03 13:37:47,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 13:37:47,040 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 140 transitions. [2024-11-03 13:37:47,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-03 13:37:47,040 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 140 transitions. [2024-11-03 13:37:47,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-03 13:37:47,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 13:37:47,043 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 13:37:47,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (6)] Forceful destruction successful, exit code 0 [2024-11-03 13:37:47,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 13:37:47,244 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 13:37:47,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 13:37:47,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1849173563, now seen corresponding path program 1 times [2024-11-03 13:37:47,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 13:37:47,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1925974935] [2024-11-03 13:37:47,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 13:37:47,244 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-03 13:37:47,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 13:37:47,246 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-03 13:37:47,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (7)] Waiting until timeout for monitored process [2024-11-03 13:37:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-03 13:37:47,284 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-03 13:37:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-03 13:37:47,326 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-03 13:37:47,327 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-03 13:37:47,327 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-03 13:37:47,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (7)] Forceful destruction successful, exit code 0 [2024-11-03 13:37:47,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 13:37:47,533 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2024-11-03 13:37:47,567 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-03 13:37:47,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 01:37:47 BoogieIcfgContainer [2024-11-03 13:37:47,571 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-03 13:37:47,571 INFO L158 Benchmark]: Toolchain (without parser) took 6757.55ms. Allocated memory was 180.4MB in the beginning and 282.1MB in the end (delta: 101.7MB). Free memory was 133.8MB in the beginning and 200.5MB in the end (delta: -66.8MB). Peak memory consumption was 36.5MB. Max. memory is 8.0GB. [2024-11-03 13:37:47,571 INFO L158 Benchmark]: CDTParser took 0.81ms. Allocated memory is still 180.4MB. Free memory is still 135.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-03 13:37:47,572 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.30ms. Allocated memory is still 180.4MB. Free memory was 133.4MB in the beginning and 118.3MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-11-03 13:37:47,572 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.44ms. Allocated memory is still 180.4MB. Free memory was 118.0MB in the beginning and 116.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-03 13:37:47,572 INFO L158 Benchmark]: Boogie Preprocessor took 47.61ms. Allocated memory is still 180.4MB. Free memory was 116.6MB in the beginning and 114.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-03 13:37:47,573 INFO L158 Benchmark]: RCFGBuilder took 473.94ms. Allocated memory is still 180.4MB. Free memory was 114.2MB in the beginning and 98.4MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2024-11-03 13:37:47,573 INFO L158 Benchmark]: TraceAbstraction took 5907.55ms. Allocated memory was 180.4MB in the beginning and 282.1MB in the end (delta: 101.7MB). Free memory was 97.7MB in the beginning and 200.5MB in the end (delta: -102.8MB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-03 13:37:47,578 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.81ms. Allocated memory is still 180.4MB. Free memory is still 135.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 291.30ms. Allocated memory is still 180.4MB. Free memory was 133.4MB in the beginning and 118.3MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.44ms. Allocated memory is still 180.4MB. Free memory was 118.0MB in the beginning and 116.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.61ms. Allocated memory is still 180.4MB. Free memory was 116.6MB in the beginning and 114.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 473.94ms. Allocated memory is still 180.4MB. Free memory was 114.2MB in the beginning and 98.4MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 5907.55ms. Allocated memory was 180.4MB in the beginning and 282.1MB in the end (delta: 101.7MB). Free memory was 97.7MB in the beginning and 200.5MB in the end (delta: -102.8MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add1 ; [L233] unsigned int r_add2 ; [L234] unsigned int zero ; [L235] int tmp ; [L236] int tmp___0 ; [L237] int __retres14 ; [L241] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L241] RET, EXPR base2flt(0, 0) [L241] zero = base2flt(0, 0) [L242] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=-127, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L76] m = m & ~ (1U << 24U) [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=-127, \old(m)=16777216, __retres4=16777216] [L80] return (__retres4); VAL [\old(e)=-127, \old(m)=16777216, \result=16777216] [L242] RET, EXPR base2flt(ma, ea) VAL [ea=-127, ma=16777216] [L242] a = base2flt(ma, ea) [L243] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=127, \old(m)=33554431] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554431, e=127, m=33554431] [L29] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554431, e=127, m=33554431] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554431, e=127, m=33554431] [L57] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554431, e=127, m=33554431] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=127, \old(m)=33554431, e=127, m=33554431] [L76] m = m & ~ (1U << 24U) [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=127, \old(m)=33554431, __retres4=-1] [L80] return (__retres4); VAL [\old(e)=127, \old(m)=33554431, \result=-1] [L243] RET, EXPR base2flt(mb, eb) VAL [a=16777216, ea=-127, eb=127, ma=16777216, mb=33554431] [L243] b = base2flt(mb, eb) [L244] CALL addflt(a, b) VAL [\old(a)=16777216, \old(b)=-1] [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [\old(a)=16777216, \old(b)=-1, a=16777216, b=-1] [L94] COND TRUE a < b [L95] tmp = a [L96] a = b [L97] b = tmp VAL [\old(a)=16777216, \old(b)=-1, a=-1, b=16777216] [L101] COND FALSE !(! b) [L108] ma = a & ((1U << 24U) - 1U) [L109] ea = (int )(a >> 24U) - 128 [L110] ma = ma | (1U << 24U) [L111] mb = b & ((1U << 24U) - 1U) [L112] eb = (int )(b >> 24U) - 128 [L113] mb = mb | (1U << 24U) VAL [\old(a)=16777216, \old(b)=-1, a=-1, ea=127, eb=-127, ma=33554431, mb=16777216] [L114] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L114] RET __VERIFIER_assert(ea >= eb) VAL [\old(a)=16777216, \old(b)=-1, a=-1, ea=127, eb=-127, ma=33554431, mb=16777216] [L115] delta = ea - eb VAL [\old(a)=16777216, \old(b)=-1, a=-1, delta=254, ea=127, ma=33554431, mb=16777216] [L116] CALL __VERIFIER_assert(delta < sizeof(mb) * 8) VAL [\old(cond)=0] [L16] COND TRUE !(cond) VAL [\old(cond)=0] [L17] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 142 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 116 mSDsluCounter, 2839 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2508 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 577 IncrementalHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 331 mSDtfsCounter, 577 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 369 GetRequests, 298 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=5, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 62 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 358 ConstructedInterpolants, 1 QuantifiedInterpolants, 648 SizeOfPredicates, 10 NumberOfNonLiveVariables, 380 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 159/170 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-03 13:37:47,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...