/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/systemc/pc_sfifo_2.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 07:12:32,443 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 07:12:32,513 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 07:12:32,518 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 07:12:32,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 07:12:32,541 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 07:12:32,541 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 07:12:32,542 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 07:12:32,542 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 07:12:32,545 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 07:12:32,545 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 07:12:32,545 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 07:12:32,546 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 07:12:32,547 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 07:12:32,547 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 07:12:32,548 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 07:12:32,548 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 07:12:32,548 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 07:12:32,548 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 07:12:32,549 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 07:12:32,549 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 07:12:32,550 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 07:12:32,550 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 07:12:32,550 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 07:12:32,550 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 07:12:32,550 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 07:12:32,550 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 07:12:32,551 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 07:12:32,551 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 07:12:32,551 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 07:12:32,552 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 07:12:32,552 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 07:12:32,552 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 07:12:32,552 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 07:12:32,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:12:32,552 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 07:12:32,552 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 07:12:32,552 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 07:12:32,552 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 07:12:32,553 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 07:12:32,553 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 07:12:32,553 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 07:12:32,553 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 07:12:32,553 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 07:12:32,553 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 07:12:32,553 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 07:12:32,554 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-25 07:12:32,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 07:12:32,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 07:12:32,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 07:12:32,788 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 07:12:32,788 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 07:12:32,789 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_2.cil-2.c [2023-12-25 07:12:33,842 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 07:12:33,997 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 07:12:33,998 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_2.cil-2.c [2023-12-25 07:12:34,006 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ebd0ad0b/ceb2f855117c46048cd6e75b0c38bd8c/FLAGb48099ae3 [2023-12-25 07:12:34,020 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ebd0ad0b/ceb2f855117c46048cd6e75b0c38bd8c [2023-12-25 07:12:34,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 07:12:34,023 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 07:12:34,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 07:12:34,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 07:12:34,027 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 07:12:34,027 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:12:34" (1/1) ... [2023-12-25 07:12:34,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74b0b801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:12:34, skipping insertion in model container [2023-12-25 07:12:34,028 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 07:12:34" (1/1) ... [2023-12-25 07:12:34,048 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 07:12:34,154 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_2.cil-2.c[643,656] [2023-12-25 07:12:34,183 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:12:34,192 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 07:12:34,200 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_2.cil-2.c[643,656] [2023-12-25 07:12:34,214 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 07:12:34,226 INFO L206 MainTranslator]: Completed translation [2023-12-25 07:12:34,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:12:34 WrapperNode [2023-12-25 07:12:34,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 07:12:34,227 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 07:12:34,227 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 07:12:34,227 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 07:12:34,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:12:34" (1/1) ... [2023-12-25 07:12:34,238 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:12:34" (1/1) ... [2023-12-25 07:12:34,258 INFO L138 Inliner]: procedures = 29, calls = 32, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 184 [2023-12-25 07:12:34,258 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 07:12:34,258 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 07:12:34,259 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 07:12:34,259 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 07:12:34,265 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:12:34" (1/1) ... [2023-12-25 07:12:34,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:12:34" (1/1) ... [2023-12-25 07:12:34,267 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:12:34" (1/1) ... [2023-12-25 07:12:34,275 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-25 07:12:34,276 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:12:34" (1/1) ... [2023-12-25 07:12:34,276 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:12:34" (1/1) ... [2023-12-25 07:12:34,279 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:12:34" (1/1) ... [2023-12-25 07:12:34,283 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:12:34" (1/1) ... [2023-12-25 07:12:34,296 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:12:34" (1/1) ... [2023-12-25 07:12:34,297 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:12:34" (1/1) ... [2023-12-25 07:12:34,299 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 07:12:34,299 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 07:12:34,299 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 07:12:34,300 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 07:12:34,301 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:12:34" (1/1) ... [2023-12-25 07:12:34,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 07:12:34,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 07:12:34,329 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-25 07:12:34,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 07:12:34,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 07:12:34,353 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-12-25 07:12:34,353 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-12-25 07:12:34,354 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2023-12-25 07:12:34,355 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2023-12-25 07:12:34,355 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-12-25 07:12:34,355 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-12-25 07:12:34,355 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-12-25 07:12:34,355 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-12-25 07:12:34,355 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-12-25 07:12:34,355 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-12-25 07:12:34,355 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-12-25 07:12:34,355 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-12-25 07:12:34,356 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-12-25 07:12:34,356 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-12-25 07:12:34,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 07:12:34,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 07:12:34,356 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2023-12-25 07:12:34,356 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2023-12-25 07:12:34,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-25 07:12:34,442 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 07:12:34,443 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 07:12:34,632 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 07:12:34,669 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 07:12:34,669 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-25 07:12:34,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:12:34 BoogieIcfgContainer [2023-12-25 07:12:34,670 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 07:12:34,671 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 07:12:34,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 07:12:34,673 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 07:12:34,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 07:12:34" (1/3) ... [2023-12-25 07:12:34,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501c214d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:12:34, skipping insertion in model container [2023-12-25 07:12:34,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 07:12:34" (2/3) ... [2023-12-25 07:12:34,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501c214d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 07:12:34, skipping insertion in model container [2023-12-25 07:12:34,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 07:12:34" (3/3) ... [2023-12-25 07:12:34,675 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2.c [2023-12-25 07:12:34,688 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 07:12:34,688 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 07:12:34,719 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 07:12:34,724 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5e819b89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 07:12:34,724 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 07:12:34,727 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 67 states have (on average 1.6119402985074627) internal successors, (108), 72 states have internal predecessors, (108), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-25 07:12:34,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-25 07:12:34,733 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:12:34,734 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:12:34,734 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:12:34,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:12:34,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1096187651, now seen corresponding path program 1 times [2023-12-25 07:12:34,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:12:34,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300051952] [2023-12-25 07:12:34,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:12:34,751 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:12:34,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:12:34,753 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:12:34,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 07:12:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:12:34,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-25 07:12:34,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:12:34,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:12:34,957 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:12:34,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:12:34,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1300051952] [2023-12-25 07:12:34,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1300051952] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:12:34,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:12:34,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 07:12:34,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729309458] [2023-12-25 07:12:34,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:12:34,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-25 07:12:34,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:12:34,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-25 07:12:34,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:12:34,998 INFO L87 Difference]: Start difference. First operand has 92 states, 67 states have (on average 1.6119402985074627) internal successors, (108), 72 states have internal predecessors, (108), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 07:12:35,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:12:35,062 INFO L93 Difference]: Finished difference Result 178 states and 268 transitions. [2023-12-25 07:12:35,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-25 07:12:35,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2023-12-25 07:12:35,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:12:35,070 INFO L225 Difference]: With dead ends: 178 [2023-12-25 07:12:35,071 INFO L226 Difference]: Without dead ends: 89 [2023-12-25 07:12:35,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-25 07:12:35,076 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 118 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:12:35,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 115 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:12:35,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-25 07:12:35,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-12-25 07:12:35,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 69 states have internal predecessors, (96), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 07:12:35,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 123 transitions. [2023-12-25 07:12:35,107 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 123 transitions. Word has length 52 [2023-12-25 07:12:35,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:12:35,108 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 123 transitions. [2023-12-25 07:12:35,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 07:12:35,108 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 123 transitions. [2023-12-25 07:12:35,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-25 07:12:35,110 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:12:35,110 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:12:35,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-25 07:12:35,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:12:35,315 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:12:35,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:12:35,316 INFO L85 PathProgramCache]: Analyzing trace with hash 202701313, now seen corresponding path program 1 times [2023-12-25 07:12:35,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:12:35,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1995661725] [2023-12-25 07:12:35,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:12:35,317 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:12:35,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:12:35,318 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:12:35,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 07:12:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:12:35,367 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 07:12:35,370 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:12:35,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:12:35,416 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:12:35,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:12:35,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1995661725] [2023-12-25 07:12:35,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1995661725] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:12:35,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:12:35,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:12:35,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808089492] [2023-12-25 07:12:35,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:12:35,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:12:35,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:12:35,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:12:35,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:12:35,418 INFO L87 Difference]: Start difference. First operand 89 states and 123 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 07:12:35,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:12:35,626 INFO L93 Difference]: Finished difference Result 267 states and 378 transitions. [2023-12-25 07:12:35,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 07:12:35,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2023-12-25 07:12:35,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:12:35,632 INFO L225 Difference]: With dead ends: 267 [2023-12-25 07:12:35,632 INFO L226 Difference]: Without dead ends: 185 [2023-12-25 07:12:35,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:12:35,635 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 191 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 07:12:35,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 282 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 07:12:35,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-12-25 07:12:35,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 177. [2023-12-25 07:12:35,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 134 states have (on average 1.4328358208955223) internal successors, (192), 139 states have internal predecessors, (192), 26 states have call successors, (26), 15 states have call predecessors, (26), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2023-12-25 07:12:35,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 246 transitions. [2023-12-25 07:12:35,668 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 246 transitions. Word has length 52 [2023-12-25 07:12:35,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:12:35,669 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 246 transitions. [2023-12-25 07:12:35,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 07:12:35,669 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 246 transitions. [2023-12-25 07:12:35,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-25 07:12:35,675 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:12:35,675 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:12:35,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-25 07:12:35,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:12:35,879 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:12:35,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:12:35,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1528816928, now seen corresponding path program 1 times [2023-12-25 07:12:35,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:12:35,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27994087] [2023-12-25 07:12:35,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:12:35,881 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:12:35,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:12:35,883 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:12:35,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 07:12:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:12:35,956 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 07:12:35,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:12:36,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:12:36,006 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:12:36,006 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:12:36,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [27994087] [2023-12-25 07:12:36,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [27994087] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:12:36,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:12:36,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 07:12:36,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887682848] [2023-12-25 07:12:36,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:12:36,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 07:12:36,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:12:36,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 07:12:36,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 07:12:36,008 INFO L87 Difference]: Start difference. First operand 177 states and 246 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 07:12:36,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:12:36,236 INFO L93 Difference]: Finished difference Result 538 states and 767 transitions. [2023-12-25 07:12:36,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 07:12:36,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2023-12-25 07:12:36,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:12:36,243 INFO L225 Difference]: With dead ends: 538 [2023-12-25 07:12:36,243 INFO L226 Difference]: Without dead ends: 373 [2023-12-25 07:12:36,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:12:36,249 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 183 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 07:12:36,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 286 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 07:12:36,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2023-12-25 07:12:36,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 364. [2023-12-25 07:12:36,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 277 states have (on average 1.4007220216606497) internal successors, (388), 290 states have internal predecessors, (388), 48 states have call successors, (48), 29 states have call predecessors, (48), 38 states have return successors, (70), 48 states have call predecessors, (70), 45 states have call successors, (70) [2023-12-25 07:12:36,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 506 transitions. [2023-12-25 07:12:36,283 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 506 transitions. Word has length 52 [2023-12-25 07:12:36,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:12:36,283 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 506 transitions. [2023-12-25 07:12:36,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 07:12:36,284 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 506 transitions. [2023-12-25 07:12:36,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-25 07:12:36,285 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:12:36,285 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:12:36,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 07:12:36,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:12:36,487 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:12:36,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:12:36,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1570179775, now seen corresponding path program 1 times [2023-12-25 07:12:36,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:12:36,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1727239569] [2023-12-25 07:12:36,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:12:36,489 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:12:36,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:12:36,490 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 07:12:36,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 07:12:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:12:36,555 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 07:12:36,556 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:12:36,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:12:36,583 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:12:36,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:12:36,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1727239569] [2023-12-25 07:12:36,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1727239569] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:12:36,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:12:36,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 07:12:36,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640913214] [2023-12-25 07:12:36,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:12:36,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 07:12:36,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:12:36,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 07:12:36,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:12:36,584 INFO L87 Difference]: Start difference. First operand 364 states and 506 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 07:12:36,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:12:36,643 INFO L93 Difference]: Finished difference Result 720 states and 1004 transitions. [2023-12-25 07:12:36,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 07:12:36,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2023-12-25 07:12:36,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:12:36,646 INFO L225 Difference]: With dead ends: 720 [2023-12-25 07:12:36,646 INFO L226 Difference]: Without dead ends: 382 [2023-12-25 07:12:36,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-25 07:12:36,647 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 6 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:12:36,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 560 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:12:36,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2023-12-25 07:12:36,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 372. [2023-12-25 07:12:36,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 283 states have (on average 1.3851590106007068) internal successors, (392), 296 states have internal predecessors, (392), 48 states have call successors, (48), 29 states have call predecessors, (48), 40 states have return successors, (72), 50 states have call predecessors, (72), 45 states have call successors, (72) [2023-12-25 07:12:36,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 512 transitions. [2023-12-25 07:12:36,682 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 512 transitions. Word has length 52 [2023-12-25 07:12:36,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:12:36,682 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 512 transitions. [2023-12-25 07:12:36,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 07:12:36,682 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 512 transitions. [2023-12-25 07:12:36,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-25 07:12:36,683 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:12:36,683 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:12:36,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-25 07:12:36,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:12:36,887 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:12:36,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:12:36,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1338584127, now seen corresponding path program 1 times [2023-12-25 07:12:36,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:12:36,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561256981] [2023-12-25 07:12:36,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:12:36,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:12:36,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:12:36,889 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) [2023-12-25 07:12:36,928 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 [2023-12-25 07:12:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 07:12:36,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 07:12:36,961 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 07:12:36,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 07:12:36,987 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 07:12:36,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 07:12:36,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561256981] [2023-12-25 07:12:36,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561256981] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 07:12:36,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 07:12:36,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 07:12:36,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629129090] [2023-12-25 07:12:36,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 07:12:36,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-25 07:12:36,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 07:12:36,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-25 07:12:36,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-25 07:12:36,991 INFO L87 Difference]: Start difference. First operand 372 states and 512 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 07:12:37,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 07:12:37,063 INFO L93 Difference]: Finished difference Result 730 states and 1006 transitions. [2023-12-25 07:12:37,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 07:12:37,065 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2023-12-25 07:12:37,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 07:12:37,074 INFO L225 Difference]: With dead ends: 730 [2023-12-25 07:12:37,075 INFO L226 Difference]: Without dead ends: 384 [2023-12-25 07:12:37,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-25 07:12:37,077 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 3 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 07:12:37,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 565 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 07:12:37,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2023-12-25 07:12:37,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 380. [2023-12-25 07:12:37,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 289 states have (on average 1.3702422145328719) internal successors, (396), 302 states have internal predecessors, (396), 48 states have call successors, (48), 29 states have call predecessors, (48), 42 states have return successors, (74), 52 states have call predecessors, (74), 45 states have call successors, (74) [2023-12-25 07:12:37,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 518 transitions. [2023-12-25 07:12:37,106 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 518 transitions. Word has length 52 [2023-12-25 07:12:37,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 07:12:37,106 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 518 transitions. [2023-12-25 07:12:37,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-25 07:12:37,107 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 518 transitions. [2023-12-25 07:12:37,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-25 07:12:37,107 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 07:12:37,107 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 07:12:37,112 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 (6)] Forceful destruction successful, exit code 0 [2023-12-25 07:12:37,310 WARN L477 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 [2023-12-25 07:12:37,310 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 07:12:37,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 07:12:37,311 INFO L85 PathProgramCache]: Analyzing trace with hash -915882301, now seen corresponding path program 1 times [2023-12-25 07:12:37,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 07:12:37,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548922967] [2023-12-25 07:12:37,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 07:12:37,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:12:37,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 07:12:37,312 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) [2023-12-25 07:12:37,313 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 [2023-12-25 07:12:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 07:12:37,349 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-25 07:12:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-25 07:12:37,404 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-25 07:12:37,404 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-25 07:12:37,405 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 07:12:37,414 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 (7)] Forceful destruction successful, exit code 0 [2023-12-25 07:12:37,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 07:12:37,612 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-25 07:12:37,615 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 07:12:37,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 07:12:37 BoogieIcfgContainer [2023-12-25 07:12:37,659 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 07:12:37,660 INFO L158 Benchmark]: Toolchain (without parser) took 3636.73ms. Allocated memory was 249.6MB in the beginning and 325.1MB in the end (delta: 75.5MB). Free memory was 194.4MB in the beginning and 199.4MB in the end (delta: -4.9MB). Peak memory consumption was 71.6MB. Max. memory is 8.0GB. [2023-12-25 07:12:37,660 INFO L158 Benchmark]: CDTParser took 0.62ms. Allocated memory is still 207.6MB. Free memory was 156.3MB in the beginning and 156.1MB in the end (delta: 163.6kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 07:12:37,660 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.87ms. Allocated memory is still 249.6MB. Free memory was 193.9MB in the beginning and 180.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-25 07:12:37,660 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.97ms. Allocated memory is still 249.6MB. Free memory was 180.3MB in the beginning and 178.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 07:12:37,660 INFO L158 Benchmark]: Boogie Preprocessor took 40.42ms. Allocated memory is still 249.6MB. Free memory was 178.2MB in the beginning and 176.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 07:12:37,660 INFO L158 Benchmark]: RCFGBuilder took 370.27ms. Allocated memory is still 249.6MB. Free memory was 176.1MB in the beginning and 152.0MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-12-25 07:12:37,661 INFO L158 Benchmark]: TraceAbstraction took 2988.09ms. Allocated memory was 249.6MB in the beginning and 325.1MB in the end (delta: 75.5MB). Free memory was 151.4MB in the beginning and 199.4MB in the end (delta: -47.9MB). Peak memory consumption was 28.6MB. Max. memory is 8.0GB. [2023-12-25 07:12:37,662 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.62ms. Allocated memory is still 207.6MB. Free memory was 156.3MB in the beginning and 156.1MB in the end (delta: 163.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 202.87ms. Allocated memory is still 249.6MB. Free memory was 193.9MB in the beginning and 180.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.97ms. Allocated memory is still 249.6MB. Free memory was 180.3MB in the beginning and 178.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.42ms. Allocated memory is still 249.6MB. Free memory was 178.2MB in the beginning and 176.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 370.27ms. Allocated memory is still 249.6MB. Free memory was 176.1MB in the beginning and 152.0MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 2988.09ms. Allocated memory was 249.6MB in the beginning and 325.1MB in the end (delta: 75.5MB). Free memory was 151.4MB in the beginning and 199.4MB in the end (delta: -47.9MB). Peak memory consumption was 28.6MB. 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: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int q_buf_0 ; [L26] int q_free ; [L27] int q_read_ev ; [L28] int q_write_ev ; [L29] int q_req_up ; [L30] int q_ev ; [L51] int p_num_write ; [L52] int p_last_write ; [L53] int p_dw_st ; [L54] int p_dw_pc ; [L55] int p_dw_i ; [L56] int c_num_read ; [L57] int c_last_read ; [L58] int c_dr_st ; [L59] int c_dr_pc ; [L60] int c_dr_i ; [L164] static int a_t ; [L466] int __retres1 ; [L470] CALL init_model() [L452] q_free = 1 [L453] q_write_ev = 2 [L454] q_read_ev = q_write_ev [L455] p_num_write = 0 [L456] p_dw_pc = 0 [L457] p_dw_i = 1 [L458] c_num_read = 0 [L459] c_dr_pc = 0 [L460] c_dr_i = 1 [L470] RET init_model() [L471] CALL start_simulation() [L406] int kernel_st ; [L407] int tmp ; [L411] kernel_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L412] CALL update_channels() VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L222] COND FALSE !((int )q_req_up == 1) VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L412] RET update_channels() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L413] CALL init_threads() [L237] COND TRUE (int )p_dw_i == 1 [L238] p_dw_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L242] COND TRUE (int )c_dr_i == 1 [L243] c_dr_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L413] RET init_threads() [L414] CALL fire_delta_events() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L275] COND FALSE !((int )q_read_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L280] COND FALSE !((int )q_write_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L414] RET fire_delta_events() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L415] CALL activate_threads() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L308] int tmp ; [L309] int tmp___0 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L313] CALL, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L62] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L65] COND FALSE !((int )p_dw_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L75] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L77] return (__retres1); [L313] RET, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L313] tmp = is_do_write_p_triggered() [L315] COND FALSE !(\read(tmp)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp=0] [L321] CALL, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L81] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L84] COND FALSE !((int )c_dr_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L94] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L96] return (__retres1); [L321] RET, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp=0] [L321] tmp___0 = is_do_read_c_triggered() [L323] COND FALSE !(\read(tmp___0)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp=0, tmp___0=0] [L415] RET activate_threads() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L416] CALL reset_delta_events() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L293] COND FALSE !((int )q_read_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L298] COND FALSE !((int )q_write_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L416] RET reset_delta_events() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, kernel_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L419] COND TRUE 1 [L422] kernel_st = 1 [L423] CALL eval() [L333] int tmp ; [L334] int tmp___0 ; [L335] int tmp___1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L339] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L342] CALL, EXPR exists_runnable_thread() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L252] int __retres1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L255] COND TRUE (int )p_dw_st == 0 [L256] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L268] return (__retres1); [L342] RET, EXPR exists_runnable_thread() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L342] tmp___1 = exists_runnable_thread() [L344] COND TRUE \read(tmp___1) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp___1=1] [L349] COND TRUE (int )p_dw_st == 0 [L351] tmp = __VERIFIER_nondet_int() [L353] COND FALSE !(\read(tmp)) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, tmp=0, tmp___1=1] [L359] CALL error() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L20] reach_error() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 514 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 501 mSDsluCounter, 1808 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1294 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 510 IncrementalHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 514 mSDtfsCounter, 510 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 259 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=380occurred in iteration=5, InterpolantAutomatonStates: 27, 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, 31 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 312 NumberOfCodeBlocks, 312 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 255 ConstructedInterpolants, 0 QuantifiedInterpolants, 337 SizeOfPredicates, 3 NumberOfNonLiveVariables, 584 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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! [2023-12-25 07:12:37,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...