/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/locks/test_locks_15-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 08:19:57,057 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 08:19:57,213 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 08:19:57,221 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 08:19:57,222 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 08:19:57,276 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 08:19:57,276 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 08:19:57,277 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 08:19:57,277 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 08:19:57,282 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 08:19:57,282 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 08:19:57,283 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 08:19:57,284 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 08:19:57,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 08:19:57,285 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 08:19:57,286 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 08:19:57,286 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 08:19:57,286 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 08:19:57,286 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 08:19:57,287 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 08:19:57,287 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 08:19:57,287 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 08:19:57,287 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 08:19:57,288 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 08:19:57,288 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 08:19:57,288 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 08:19:57,288 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 08:19:57,288 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 08:19:57,289 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 08:19:57,289 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 08:19:57,292 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 08:19:57,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 08:19:57,292 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 08:19:57,293 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 08:19:57,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 08:19:57,293 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 08:19:57,293 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 08:19:57,293 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 08:19:57,293 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 08:19:57,294 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 08:19:57,294 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 08:19:57,296 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 08:19:57,296 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 08:19:57,296 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 08:19:57,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 08:19:57,296 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 08:19:57,296 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 08:19:57,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 08:19:57,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 08:19:57,759 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 08:19:57,760 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 08:19:57,776 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 08:19:57,778 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_15-1.c [2023-12-16 08:19:59,244 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 08:19:59,464 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 08:19:59,465 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15-1.c [2023-12-16 08:19:59,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc762a1cd/96148bb0a2364b2f98c4855223714332/FLAG3e6084152 [2023-12-16 08:19:59,492 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc762a1cd/96148bb0a2364b2f98c4855223714332 [2023-12-16 08:19:59,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 08:19:59,495 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 08:19:59,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 08:19:59,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 08:19:59,500 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 08:19:59,501 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:19:59" (1/1) ... [2023-12-16 08:19:59,502 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@485ab4e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:19:59, skipping insertion in model container [2023-12-16 08:19:59,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:19:59" (1/1) ... [2023-12-16 08:19:59,537 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 08:19:59,752 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15-1.c[5654,5667] [2023-12-16 08:19:59,756 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 08:19:59,779 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 08:19:59,818 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15-1.c[5654,5667] [2023-12-16 08:19:59,819 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 08:19:59,840 INFO L206 MainTranslator]: Completed translation [2023-12-16 08:19:59,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:19:59 WrapperNode [2023-12-16 08:19:59,841 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 08:19:59,842 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 08:19:59,842 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 08:19:59,842 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 08:19:59,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:19:59" (1/1) ... [2023-12-16 08:19:59,867 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:19:59" (1/1) ... [2023-12-16 08:19:59,887 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 194 [2023-12-16 08:19:59,888 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 08:19:59,888 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 08:19:59,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 08:19:59,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 08:19:59,897 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:19:59" (1/1) ... [2023-12-16 08:19:59,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:19:59" (1/1) ... [2023-12-16 08:19:59,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:19:59" (1/1) ... [2023-12-16 08:19:59,915 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 08:19:59,915 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:19:59" (1/1) ... [2023-12-16 08:19:59,916 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:19:59" (1/1) ... [2023-12-16 08:19:59,922 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:19:59" (1/1) ... [2023-12-16 08:19:59,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:19:59" (1/1) ... [2023-12-16 08:19:59,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:19:59" (1/1) ... [2023-12-16 08:19:59,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:19:59" (1/1) ... [2023-12-16 08:19:59,932 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 08:19:59,933 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 08:19:59,933 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 08:19:59,933 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 08:19:59,933 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:19:59" (1/1) ... [2023-12-16 08:19:59,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 08:19:59,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 08:19:59,963 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 08:19:59,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 08:20:00,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 08:20:00,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 08:20:00,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 08:20:00,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 08:20:00,076 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 08:20:00,078 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 08:20:00,369 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 08:20:00,390 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 08:20:00,390 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 08:20:00,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 08:20:00 BoogieIcfgContainer [2023-12-16 08:20:00,391 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 08:20:00,397 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 08:20:00,397 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 08:20:00,400 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 08:20:00,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 08:19:59" (1/3) ... [2023-12-16 08:20:00,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20247602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 08:20:00, skipping insertion in model container [2023-12-16 08:20:00,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:19:59" (2/3) ... [2023-12-16 08:20:00,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20247602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 08:20:00, skipping insertion in model container [2023-12-16 08:20:00,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 08:20:00" (3/3) ... [2023-12-16 08:20:00,404 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_15-1.c [2023-12-16 08:20:00,448 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 08:20:00,449 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 08:20:00,491 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 08:20:00,501 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;@62149063, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 08:20:00,501 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 08:20:00,507 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 51 states have (on average 1.9607843137254901) internal successors, (100), 52 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 08:20:00,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-16 08:20:00,514 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:20:00,514 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] [2023-12-16 08:20:00,515 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:20:00,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:20:00,522 INFO L85 PathProgramCache]: Analyzing trace with hash -916342328, now seen corresponding path program 1 times [2023-12-16 08:20:00,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:20:00,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494661548] [2023-12-16 08:20:00,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:20:00,531 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:20:00,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:20:00,533 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 08:20:00,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 08:20:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:20:00,626 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 08:20:00,635 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:20:00,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 08:20:00,721 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:20:00,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:20:00,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494661548] [2023-12-16 08:20:00,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494661548] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:20:00,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:20:00,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:20:00,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904355468] [2023-12-16 08:20:00,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:20:00,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 08:20:00,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:20:00,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 08:20:00,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:20:00,753 INFO L87 Difference]: Start difference. First operand has 53 states, 51 states have (on average 1.9607843137254901) internal successors, (100), 52 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 08:20:00,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:20:00,809 INFO L93 Difference]: Finished difference Result 155 states and 296 transitions. [2023-12-16 08:20:00,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 08:20:00,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-16 08:20:00,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:20:00,824 INFO L225 Difference]: With dead ends: 155 [2023-12-16 08:20:00,824 INFO L226 Difference]: Without dead ends: 98 [2023-12-16 08:20:00,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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-16 08:20:00,829 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 78 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 08:20:00,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 243 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 08:20:00,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-16 08:20:00,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2023-12-16 08:20:00,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.9157894736842105) internal successors, (182), 95 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 08:20:00,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 182 transitions. [2023-12-16 08:20:00,952 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 182 transitions. Word has length 21 [2023-12-16 08:20:00,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:20:00,952 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 182 transitions. [2023-12-16 08:20:00,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 08:20:00,952 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 182 transitions. [2023-12-16 08:20:00,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-16 08:20:00,954 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:20:00,954 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] [2023-12-16 08:20:00,960 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-16 08:20:01,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:20:01,157 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:20:01,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:20:01,158 INFO L85 PathProgramCache]: Analyzing trace with hash -916349520, now seen corresponding path program 1 times [2023-12-16 08:20:01,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:20:01,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1257046781] [2023-12-16 08:20:01,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:20:01,159 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:20:01,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:20:01,163 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 08:20:01,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 08:20:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:20:01,224 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 08:20:01,225 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:20:01,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 08:20:01,289 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:20:01,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:20:01,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1257046781] [2023-12-16 08:20:01,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1257046781] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:20:01,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:20:01,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:20:01,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054074601] [2023-12-16 08:20:01,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:20:01,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 08:20:01,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:20:01,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 08:20:01,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:20:01,296 INFO L87 Difference]: Start difference. First operand 96 states and 182 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 08:20:01,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:20:01,327 INFO L93 Difference]: Finished difference Result 99 states and 185 transitions. [2023-12-16 08:20:01,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 08:20:01,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-16 08:20:01,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:20:01,332 INFO L225 Difference]: With dead ends: 99 [2023-12-16 08:20:01,332 INFO L226 Difference]: Without dead ends: 97 [2023-12-16 08:20:01,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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-16 08:20:01,333 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 14 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 08:20:01,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 181 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 08:20:01,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-12-16 08:20:01,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-12-16 08:20:01,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.90625) internal successors, (183), 96 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 08:20:01,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 183 transitions. [2023-12-16 08:20:01,346 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 183 transitions. Word has length 21 [2023-12-16 08:20:01,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:20:01,347 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 183 transitions. [2023-12-16 08:20:01,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 08:20:01,347 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 183 transitions. [2023-12-16 08:20:01,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-16 08:20:01,348 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:20:01,348 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] [2023-12-16 08:20:01,355 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-16 08:20:01,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:20:01,551 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:20:01,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:20:01,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1384480262, now seen corresponding path program 1 times [2023-12-16 08:20:01,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:20:01,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926576439] [2023-12-16 08:20:01,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:20:01,552 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:20:01,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:20:01,554 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 08:20:01,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 08:20:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:20:01,594 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 08:20:01,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:20:01,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 08:20:01,631 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:20:01,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:20:01,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926576439] [2023-12-16 08:20:01,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [926576439] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:20:01,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:20:01,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:20:01,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364959442] [2023-12-16 08:20:01,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:20:01,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 08:20:01,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:20:01,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 08:20:01,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:20:01,634 INFO L87 Difference]: Start difference. First operand 97 states and 183 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 08:20:01,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:20:01,650 INFO L93 Difference]: Finished difference Result 232 states and 436 transitions. [2023-12-16 08:20:01,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 08:20:01,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-16 08:20:01,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:20:01,652 INFO L225 Difference]: With dead ends: 232 [2023-12-16 08:20:01,652 INFO L226 Difference]: Without dead ends: 136 [2023-12-16 08:20:01,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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-16 08:20:01,654 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 76 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 08:20:01,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 131 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 08:20:01,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-12-16 08:20:01,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2023-12-16 08:20:01,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.8721804511278195) internal successors, (249), 133 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 08:20:01,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 249 transitions. [2023-12-16 08:20:01,662 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 249 transitions. Word has length 21 [2023-12-16 08:20:01,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:20:01,663 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 249 transitions. [2023-12-16 08:20:01,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 08:20:01,663 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 249 transitions. [2023-12-16 08:20:01,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-16 08:20:01,664 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:20:01,664 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] [2023-12-16 08:20:01,672 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-16 08:20:01,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:20:01,867 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:20:01,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:20:01,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1384473070, now seen corresponding path program 1 times [2023-12-16 08:20:01,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:20:01,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724025518] [2023-12-16 08:20:01,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:20:01,868 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:20:01,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:20:01,869 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-16 08:20:01,872 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-16 08:20:01,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:20:01,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 08:20:01,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:20:01,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 08:20:01,956 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:20:01,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:20:01,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724025518] [2023-12-16 08:20:01,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724025518] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:20:01,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:20:01,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:20:01,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437392957] [2023-12-16 08:20:01,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:20:01,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 08:20:01,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:20:01,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 08:20:01,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:20:01,963 INFO L87 Difference]: Start difference. First operand 134 states and 249 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 08:20:01,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:20:01,994 INFO L93 Difference]: Finished difference Result 186 states and 340 transitions. [2023-12-16 08:20:01,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 08:20:01,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-16 08:20:01,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:20:01,995 INFO L225 Difference]: With dead ends: 186 [2023-12-16 08:20:01,995 INFO L226 Difference]: Without dead ends: 134 [2023-12-16 08:20:01,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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-16 08:20:01,997 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 74 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 08:20:01,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 209 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 08:20:01,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-12-16 08:20:02,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2023-12-16 08:20:02,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.8473282442748091) internal successors, (242), 131 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 08:20:02,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 242 transitions. [2023-12-16 08:20:02,006 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 242 transitions. Word has length 21 [2023-12-16 08:20:02,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:20:02,006 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 242 transitions. [2023-12-16 08:20:02,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 08:20:02,007 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 242 transitions. [2023-12-16 08:20:02,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-16 08:20:02,007 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:20:02,008 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] [2023-12-16 08:20:02,012 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-16 08:20:02,210 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-16 08:20:02,210 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:20:02,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:20:02,211 INFO L85 PathProgramCache]: Analyzing trace with hash -203867640, now seen corresponding path program 1 times [2023-12-16 08:20:02,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:20:02,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337979863] [2023-12-16 08:20:02,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:20:02,212 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 08:20:02,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:20:02,213 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-16 08:20:02,215 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-16 08:20:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 08:20:02,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 08:20:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 08:20:02,320 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-16 08:20:02,320 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 08:20:02,321 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 08:20:02,328 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-16 08:20:02,525 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-16 08:20:02,529 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-16 08:20:02,535 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 08:20:02,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 08:20:02 BoogieIcfgContainer [2023-12-16 08:20:02,619 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 08:20:02,619 INFO L158 Benchmark]: Toolchain (without parser) took 3124.12ms. Allocated memory is still 268.4MB. Free memory was 215.2MB in the beginning and 164.4MB in the end (delta: 50.8MB). Peak memory consumption was 51.8MB. Max. memory is 8.0GB. [2023-12-16 08:20:02,620 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 202.4MB. Free memory is still 153.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 08:20:02,620 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.94ms. Allocated memory is still 268.4MB. Free memory was 215.0MB in the beginning and 202.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 08:20:02,626 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.77ms. Allocated memory is still 268.4MB. Free memory was 202.4MB in the beginning and 200.5MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 08:20:02,626 INFO L158 Benchmark]: Boogie Preprocessor took 43.46ms. Allocated memory is still 268.4MB. Free memory was 200.3MB in the beginning and 198.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 08:20:02,632 INFO L158 Benchmark]: RCFGBuilder took 458.34ms. Allocated memory is still 268.4MB. Free memory was 198.2MB in the beginning and 179.8MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-16 08:20:02,638 INFO L158 Benchmark]: TraceAbstraction took 2221.94ms. Allocated memory is still 268.4MB. Free memory was 179.3MB in the beginning and 164.4MB in the end (delta: 14.9MB). Peak memory consumption was 15.1MB. Max. memory is 8.0GB. [2023-12-16 08:20:02,639 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.21ms. Allocated memory is still 202.4MB. Free memory is still 153.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 344.94ms. Allocated memory is still 268.4MB. Free memory was 215.0MB in the beginning and 202.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.77ms. Allocated memory is still 268.4MB. Free memory was 202.4MB in the beginning and 200.5MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.46ms. Allocated memory is still 268.4MB. Free memory was 200.3MB in the beginning and 198.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 458.34ms. Allocated memory is still 268.4MB. Free memory was 198.2MB in the beginning and 179.8MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 2221.94ms. Allocated memory is still 268.4MB. Free memory was 179.3MB in the beginning and 164.4MB in the end (delta: 14.9MB). Peak memory consumption was 15.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 233]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 VAL [cond=2, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0] [L93] COND FALSE !(p1 != 0) VAL [cond=2, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0] [L97] COND FALSE !(p2 != 0) VAL [cond=2, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0] [L101] COND FALSE !(p3 != 0) VAL [cond=2, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0] [L105] COND TRUE p4 != 0 [L106] lk4 = 1 VAL [cond=2, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0, p4=2] [L109] COND TRUE p5 != 0 [L110] lk5 = 1 VAL [cond=2, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0, p4=2, p5=2] [L113] COND TRUE p6 != 0 [L114] lk6 = 1 VAL [cond=2, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=0, lk8=0, lk9=0, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2] [L117] COND TRUE p7 != 0 [L118] lk7 = 1 VAL [cond=2, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=0, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2] [L121] COND TRUE p8 != 0 [L122] lk8 = 1 VAL [cond=2, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=0, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2] [L125] COND TRUE p9 != 0 [L126] lk9 = 1 VAL [cond=2, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L129] COND TRUE p10 != 0 [L130] lk10 = 1 VAL [cond=2, lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=2, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L133] COND FALSE !(p11 != 0) VAL [cond=2, lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=2, p11=0, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L137] COND TRUE p12 != 0 [L138] lk12 = 1 VAL [cond=2, lk10=1, lk11=0, lk12=1, lk13=0, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=2, p11=0, p12=2, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L141] COND TRUE p13 != 0 [L142] lk13 = 1 VAL [cond=2, lk10=1, lk11=0, lk12=1, lk13=1, lk14=0, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=2, p11=0, p12=2, p13=2, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L145] COND TRUE p14 != 0 [L146] lk14 = 1 VAL [cond=2, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=0, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=2, p11=0, p12=2, p13=2, p14=2, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L149] COND TRUE p15 != 0 [L150] lk15 = 1 VAL [cond=2, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=2, p11=0, p12=2, p13=2, p14=2, p15=2, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L155] COND FALSE !(p1 != 0) VAL [cond=2, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=2, p11=0, p12=2, p13=2, p14=2, p15=2, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L160] COND FALSE !(p2 != 0) VAL [cond=2, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=2, p11=0, p12=2, p13=2, p14=2, p15=2, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] [L233] reach_error() VAL [cond=2, lk10=1, lk11=0, lk12=1, lk13=1, lk14=1, lk15=1, lk1=0, lk2=0, lk3=0, lk4=1, lk5=1, lk6=1, lk7=1, lk8=1, lk9=1, p10=2, p11=0, p12=2, p13=2, p14=2, p15=2, p1=0, p2=0, p3=0, p4=2, p5=2, p6=2, p7=2, p8=2, p9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 242 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 242 mSDsluCounter, 764 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 301 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28 IncrementalHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 463 mSDtfsCounter, 28 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=3, InterpolantAutomatonStates: 12, 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, 4 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 105 NumberOfCodeBlocks, 105 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 232 SizeOfPredicates, 0 NumberOfNonLiveVariables, 238 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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-16 08:20:02,659 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...