/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.trace.refinement.strategy WOLF -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.twocount32.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 07:30:54,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 07:30:54,342 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-06 07:30:54,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 07:30:54,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 07:30:54,378 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 07:30:54,378 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 07:30:54,379 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 07:30:54,379 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 07:30:54,380 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 07:30:54,380 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 07:30:54,381 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 07:30:54,382 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 07:30:54,382 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 07:30:54,383 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 07:30:54,383 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 07:30:54,383 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 07:30:54,384 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 07:30:54,384 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 07:30:54,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 07:30:54,385 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 07:30:54,385 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 07:30:54,386 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 07:30:54,386 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 07:30:54,386 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 07:30:54,386 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 07:30:54,387 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 07:30:54,387 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 07:30:54,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 07:30:54,387 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 07:30:54,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 07:30:54,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 07:30:54,388 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 07:30:54,388 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 07:30:54,389 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 07:30:54,389 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 07:30:54,389 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 07:30:54,389 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 07:30:54,389 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 07:30:54,389 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 07:30:54,390 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 07:30:54,390 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> WOLF [2024-11-06 07:30:54,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 07:30:54,635 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 07:30:54,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 07:30:54,638 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 07:30:54,638 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 07:30:54,639 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.twocount32.c [2024-11-06 07:30:56,052 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 07:30:56,233 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 07:30:56,234 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.twocount32.c [2024-11-06 07:30:56,243 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96a063ab5/e812e86cd2a24bd0842d967caea9d0e3/FLAG64740d9c9 [2024-11-06 07:30:56,626 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96a063ab5/e812e86cd2a24bd0842d967caea9d0e3 [2024-11-06 07:30:56,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 07:30:56,630 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 07:30:56,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 07:30:56,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 07:30:56,638 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 07:30:56,638 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:30:56" (1/1) ... [2024-11-06 07:30:56,639 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ecb9973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:30:56, skipping insertion in model container [2024-11-06 07:30:56,639 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:30:56" (1/1) ... [2024-11-06 07:30:56,659 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 07:30:56,796 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.twocount32.c[1260,1273] [2024-11-06 07:30:56,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 07:30:56,833 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 07:30:56,842 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.twocount32.c[1260,1273] [2024-11-06 07:30:56,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 07:30:56,876 INFO L204 MainTranslator]: Completed translation [2024-11-06 07:30:56,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:30:56 WrapperNode [2024-11-06 07:30:56,876 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 07:30:56,877 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 07:30:56,877 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 07:30:56,877 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 07:30:56,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:30:56" (1/1) ... [2024-11-06 07:30:56,892 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:30:56" (1/1) ... [2024-11-06 07:30:56,909 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2024-11-06 07:30:56,909 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 07:30:56,910 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 07:30:56,910 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 07:30:56,910 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 07:30:56,918 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:30:56" (1/1) ... [2024-11-06 07:30:56,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:30:56" (1/1) ... [2024-11-06 07:30:56,921 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:30:56" (1/1) ... [2024-11-06 07:30:56,934 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-06 07:30:56,934 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:30:56" (1/1) ... [2024-11-06 07:30:56,934 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:30:56" (1/1) ... [2024-11-06 07:30:56,939 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:30:56" (1/1) ... [2024-11-06 07:30:56,941 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:30:56" (1/1) ... [2024-11-06 07:30:56,942 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:30:56" (1/1) ... [2024-11-06 07:30:56,943 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:30:56" (1/1) ... [2024-11-06 07:30:56,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 07:30:56,946 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 07:30:56,946 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 07:30:56,946 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 07:30:56,947 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:30:56" (1/1) ... [2024-11-06 07:30:56,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 07:30:56,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 07:30:56,980 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 07:30:56,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 07:30:57,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 07:30:57,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 07:30:57,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 07:30:57,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 07:30:57,087 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 07:30:57,088 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 07:30:57,260 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-06 07:30:57,260 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 07:30:57,273 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 07:30:57,274 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 07:30:57,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:30:57 BoogieIcfgContainer [2024-11-06 07:30:57,274 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 07:30:57,278 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 07:30:57,278 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 07:30:57,280 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 07:30:57,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:30:56" (1/3) ... [2024-11-06 07:30:57,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae98fad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:30:57, skipping insertion in model container [2024-11-06 07:30:57,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:30:56" (2/3) ... [2024-11-06 07:30:57,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae98fad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:30:57, skipping insertion in model container [2024-11-06 07:30:57,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:30:57" (3/3) ... [2024-11-06 07:30:57,285 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.twocount32.c [2024-11-06 07:30:57,301 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 07:30:57,301 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 07:30:57,387 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 07:30:57,395 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@66757730, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 07:30:57,395 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 07:30:57,400 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 07:30:57,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-06 07:30:57,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 07:30:57,407 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-06 07:30:57,408 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 07:30:57,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 07:30:57,413 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-06 07:30:57,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 07:30:57,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202216085] [2024-11-06 07:30:57,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 07:30:57,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 07:30:57,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 07:30:57,425 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 07:30:57,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-06 07:30:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 07:30:57,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-06 07:30:57,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 07:30:57,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 07:30:57,662 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 07:30:57,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 07:30:57,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202216085] [2024-11-06 07:30:57,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202216085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 07:30:57,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 07:30:57,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 07:30:57,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142787105] [2024-11-06 07:30:57,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 07:30:57,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 07:30:57,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 07:30:57,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 07:30:57,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 07:30:57,694 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 07:30:57,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 07:30:57,750 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-06 07:30:57,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 07:30:57,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-06 07:30:57,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 07:30:57,758 INFO L225 Difference]: With dead ends: 18 [2024-11-06 07:30:57,758 INFO L226 Difference]: Without dead ends: 10 [2024-11-06 07:30:57,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 07:30:57,763 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 07:30:57,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 07:30:57,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-06 07:30:57,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-06 07:30:57,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 07:30:57,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-06 07:30:57,789 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-06 07:30:57,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 07:30:57,789 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-06 07:30:57,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 07:30:57,789 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-06 07:30:57,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-06 07:30:57,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 07:30:57,790 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-06 07:30:57,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-06 07:30:57,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 07:30:57,993 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 07:30:57,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 07:30:57,994 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-06 07:30:57,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 07:30:57,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080880908] [2024-11-06 07:30:57,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 07:30:57,995 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 07:30:57,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 07:30:57,998 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 07:30:58,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-06 07:30:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 07:30:58,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-06 07:30:58,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 07:30:58,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 07:30:58,328 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 07:31:02,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 07:31:02,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 07:31:02,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080880908] [2024-11-06 07:31:02,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080880908] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 07:31:02,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 07:31:02,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-06 07:31:02,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221954189] [2024-11-06 07:31:02,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 07:31:02,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 07:31:02,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 07:31:02,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 07:31:02,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-06 07:31:02,174 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 07:31:03,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 07:31:03,646 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2024-11-06 07:31:03,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 07:31:03,647 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-06 07:31:03,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 07:31:03,648 INFO L225 Difference]: With dead ends: 18 [2024-11-06 07:31:03,648 INFO L226 Difference]: Without dead ends: 16 [2024-11-06 07:31:03,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-11-06 07:31:03,650 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 07:31:03,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 11 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 07:31:03,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-06 07:31:03,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-06 07:31:03,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 07:31:03,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-06 07:31:03,656 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2024-11-06 07:31:03,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 07:31:03,656 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-06 07:31:03,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 07:31:03,657 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-06 07:31:03,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-06 07:31:03,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 07:31:03,657 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-06 07:31:03,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-06 07:31:03,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 07:31:03,859 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 07:31:03,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 07:31:03,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 2 times [2024-11-06 07:31:03,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 07:31:03,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [673344943] [2024-11-06 07:31:03,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 07:31:03,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 07:31:03,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 07:31:03,866 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 07:31:03,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-06 07:31:03,955 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 07:31:03,956 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 07:31:03,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-06 07:31:03,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 07:31:09,573 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 07:31:09,574 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 07:31:32,282 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 07:31:32,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 07:31:32,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [673344943] [2024-11-06 07:31:32,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [673344943] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 07:31:32,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 07:31:32,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-06 07:31:32,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277501677] [2024-11-06 07:31:32,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 07:31:32,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-06 07:31:32,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 07:31:32,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-06 07:31:32,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-06 07:31:32,286 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 16 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 07:31:40,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 07:31:40,356 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2024-11-06 07:31:40,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-06 07:31:40,357 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 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 14 [2024-11-06 07:31:40,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 07:31:40,358 INFO L225 Difference]: With dead ends: 27 [2024-11-06 07:31:40,358 INFO L226 Difference]: Without dead ends: 25 [2024-11-06 07:31:40,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2024-11-06 07:31:40,359 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 07:31:40,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 29 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 07:31:40,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-06 07:31:40,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-11-06 07:31:40,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 07:31:40,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2024-11-06 07:31:40,365 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 14 [2024-11-06 07:31:40,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 07:31:40,365 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2024-11-06 07:31:40,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 07:31:40,366 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2024-11-06 07:31:40,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-06 07:31:40,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 07:31:40,366 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1] [2024-11-06 07:31:40,374 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 [2024-11-06 07:31:40,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 07:31:40,567 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 07:31:40,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 07:31:40,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1845955269, now seen corresponding path program 3 times [2024-11-06 07:31:40,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 07:31:40,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2015061673] [2024-11-06 07:31:40,569 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-06 07:31:40,569 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 07:31:40,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 07:31:40,572 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 07:31:40,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-06 07:31:40,684 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-06 07:31:40,684 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-06 07:31:40,684 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 07:31:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 07:31:40,829 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-06 07:31:40,830 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 07:31:40,831 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 07:31:40,843 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 [2024-11-06 07:31:41,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 07:31:41,039 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-11-06 07:31:41,064 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 07:31:41,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:31:41 BoogieIcfgContainer [2024-11-06 07:31:41,067 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 07:31:41,069 INFO L158 Benchmark]: Toolchain (without parser) took 44438.12ms. Allocated memory was 186.6MB in the beginning and 250.6MB in the end (delta: 64.0MB). Free memory was 138.2MB in the beginning and 74.9MB in the end (delta: 63.2MB). Peak memory consumption was 128.1MB. Max. memory is 8.0GB. [2024-11-06 07:31:41,070 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 186.6MB. Free memory is still 141.2MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-06 07:31:41,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.05ms. Allocated memory is still 186.6MB. Free memory was 137.8MB in the beginning and 124.1MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-06 07:31:41,070 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.42ms. Allocated memory is still 186.6MB. Free memory was 124.1MB in the beginning and 122.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-11-06 07:31:41,070 INFO L158 Benchmark]: Boogie Preprocessor took 35.00ms. Allocated memory is still 186.6MB. Free memory was 122.5MB in the beginning and 120.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-06 07:31:41,071 INFO L158 Benchmark]: RCFGBuilder took 328.40ms. Allocated memory is still 186.6MB. Free memory was 120.4MB in the beginning and 107.6MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-11-06 07:31:41,071 INFO L158 Benchmark]: TraceAbstraction took 43789.82ms. Allocated memory was 186.6MB in the beginning and 250.6MB in the end (delta: 64.0MB). Free memory was 106.8MB in the beginning and 74.9MB in the end (delta: 31.9MB). Peak memory consumption was 96.6MB. Max. memory is 8.0GB. [2024-11-06 07:31:41,078 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.11ms. Allocated memory is still 186.6MB. Free memory is still 141.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 243.05ms. Allocated memory is still 186.6MB. Free memory was 137.8MB in the beginning and 124.1MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.42ms. Allocated memory is still 186.6MB. Free memory was 124.1MB in the beginning and 122.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.00ms. Allocated memory is still 186.6MB. Free memory was 122.5MB in the beginning and 120.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 328.40ms. Allocated memory is still 186.6MB. Free memory was 120.4MB in the beginning and 107.6MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 43789.82ms. Allocated memory was 186.6MB in the beginning and 250.6MB in the end (delta: 64.0MB). Free memory was 106.8MB in the beginning and 74.9MB in the end (delta: 31.9MB). Peak memory consumption was 96.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: 22]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L30] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 32); [L31] const SORT_2 msb_SORT_2 = (SORT_2)1 << (32 - 1); [L33] const SORT_2 var_4 = 0; [L34] const SORT_2 var_9 = 1; [L35] const SORT_2 var_16 = 3; [L37] SORT_1 input_3; [L39] SORT_2 state_5 = __VERIFIER_nondet_uint() & mask_SORT_2; [L40] SORT_2 state_6 = __VERIFIER_nondet_uint() & mask_SORT_2; [L42] SORT_2 init_7_arg_1 = var_4; [L43] state_5 = init_7_arg_1 [L44] SORT_2 init_8_arg_1 = var_4; [L45] state_6 = init_8_arg_1 VAL [mask_SORT_1=1, mask_SORT_2=-1, state_5=0, state_6=0, var_16=3, var_9=1] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L22] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L22] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L22] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L22] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L22] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L22] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_20_arg_0)) [L65] SORT_2 var_10_arg_0 = state_5; [L66] SORT_2 var_10_arg_1 = var_9; [L67] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L68] SORT_1 var_12_arg_0 = input_3; [L69] SORT_2 var_12_arg_1 = state_5; [L70] SORT_2 var_12_arg_2 = var_10; [L71] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; [L72] var_12 = var_12 & mask_SORT_2 [L73] SORT_2 next_14_arg_1 = var_12; [L74] SORT_2 var_11_arg_0 = state_6; [L75] SORT_2 var_11_arg_1 = var_9; [L76] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L77] SORT_1 var_13_arg_0 = ~input_3; [L78] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L79] SORT_2 var_13_arg_1 = state_6; [L80] SORT_2 var_13_arg_2 = var_11; [L81] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L82] var_13 = var_13 & mask_SORT_2 [L83] SORT_2 next_15_arg_1 = var_13; [L85] state_5 = next_14_arg_1 [L86] state_6 = next_15_arg_1 [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L52] SORT_2 var_17_arg_0 = state_5; [L53] SORT_2 var_17_arg_1 = var_16; [L54] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L55] SORT_2 var_18_arg_0 = state_6; [L56] SORT_2 var_18_arg_1 = var_16; [L57] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L58] SORT_1 var_19_arg_0 = var_17; [L59] SORT_1 var_19_arg_1 = var_18; [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] var_19 = var_19 & mask_SORT_1 [L62] SORT_1 bad_20_arg_0 = var_19; [L63] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L22] COND TRUE !(cond) [L22] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.7s, OverallIterations: 4, TraceHistogramMax: 7, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 51 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 95 IncrementalHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 12 mSDtfsCounter, 95 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 22.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=3, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 32.6s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 44 ConstructedInterpolants, 18 QuantifiedInterpolants, 5033 SizeOfPredicates, 17 NumberOfNonLiveVariables, 178 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 0/34 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-06 07:31:41,163 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...