./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c32259e8853e6c89afe16cd58a269df43712e1774228eb070d84df2c9631efaa --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 11:52:10,233 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 11:52:10,316 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-16 11:52:10,323 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 11:52:10,324 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 11:52:10,355 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 11:52:10,356 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 11:52:10,356 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 11:52:10,357 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 11:52:10,360 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 11:52:10,361 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 11:52:10,361 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 11:52:10,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 11:52:10,362 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 11:52:10,362 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 11:52:10,362 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 11:52:10,363 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 11:52:10,363 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 11:52:10,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 11:52:10,365 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 11:52:10,365 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 11:52:10,365 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 11:52:10,366 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 11:52:10,366 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 11:52:10,366 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 11:52:10,367 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 11:52:10,367 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 11:52:10,367 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 11:52:10,368 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 11:52:10,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:52:10,368 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 11:52:10,368 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 11:52:10,369 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 11:52:10,369 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 11:52:10,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 11:52:10,370 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 11:52:10,371 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 11:52:10,371 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 11:52:10,371 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 11:52:10,371 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c32259e8853e6c89afe16cd58a269df43712e1774228eb070d84df2c9631efaa [2024-11-16 11:52:10,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 11:52:10,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 11:52:10,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 11:52:10,645 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 11:52:10,646 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 11:52:10,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c [2024-11-16 11:52:12,098 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 11:52:12,280 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 11:52:12,281 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c [2024-11-16 11:52:12,297 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/293136edf/e1009cf09a85450298e483b9ecff0bc2/FLAG57ea73512 [2024-11-16 11:52:12,314 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/293136edf/e1009cf09a85450298e483b9ecff0bc2 [2024-11-16 11:52:12,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 11:52:12,318 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 11:52:12,319 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 11:52:12,320 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 11:52:12,324 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 11:52:12,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:52:12" (1/1) ... [2024-11-16 11:52:12,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f5e74c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:12, skipping insertion in model container [2024-11-16 11:52:12,325 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:52:12" (1/1) ... [2024-11-16 11:52:12,344 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 11:52:12,514 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c[1259,1272] [2024-11-16 11:52:12,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:52:12,577 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 11:52:12,589 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c[1259,1272] [2024-11-16 11:52:12,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:52:12,624 INFO L204 MainTranslator]: Completed translation [2024-11-16 11:52:12,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:12 WrapperNode [2024-11-16 11:52:12,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 11:52:12,627 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 11:52:12,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 11:52:12,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 11:52:12,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:12" (1/1) ... [2024-11-16 11:52:12,640 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:12" (1/1) ... [2024-11-16 11:52:12,683 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 137 [2024-11-16 11:52:12,683 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 11:52:12,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 11:52:12,684 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 11:52:12,684 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 11:52:12,695 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:12" (1/1) ... [2024-11-16 11:52:12,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:12" (1/1) ... [2024-11-16 11:52:12,699 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:12" (1/1) ... [2024-11-16 11:52:12,720 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-16 11:52:12,721 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:12" (1/1) ... [2024-11-16 11:52:12,721 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:12" (1/1) ... [2024-11-16 11:52:12,733 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:12" (1/1) ... [2024-11-16 11:52:12,735 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:12" (1/1) ... [2024-11-16 11:52:12,737 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:12" (1/1) ... [2024-11-16 11:52:12,738 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:12" (1/1) ... [2024-11-16 11:52:12,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 11:52:12,743 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 11:52:12,743 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 11:52:12,743 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 11:52:12,744 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:12" (1/1) ... [2024-11-16 11:52:12,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:52:12,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:52:12,790 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-16 11:52:12,797 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-16 11:52:12,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 11:52:12,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 11:52:12,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 11:52:12,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 11:52:12,935 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 11:52:12,938 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 11:52:13,278 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2024-11-16 11:52:13,279 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 11:52:13,315 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 11:52:13,316 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 11:52:13,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:52:13 BoogieIcfgContainer [2024-11-16 11:52:13,318 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 11:52:13,322 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 11:52:13,322 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 11:52:13,326 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 11:52:13,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:52:12" (1/3) ... [2024-11-16 11:52:13,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b4e80ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:52:13, skipping insertion in model container [2024-11-16 11:52:13,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:52:12" (2/3) ... [2024-11-16 11:52:13,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b4e80ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:52:13, skipping insertion in model container [2024-11-16 11:52:13,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:52:13" (3/3) ... [2024-11-16 11:52:13,329 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.twocount2.c [2024-11-16 11:52:13,343 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 11:52:13,344 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 11:52:13,406 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 11:52:13,413 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;@201118d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 11:52:13,414 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 11:52:13,418 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 43 states have (on average 1.441860465116279) internal successors, (62), 44 states have internal predecessors, (62), 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-16 11:52:13,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-16 11:52:13,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:52:13,427 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:52:13,428 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:52:13,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:52:13,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1797453801, now seen corresponding path program 1 times [2024-11-16 11:52:13,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:52:13,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890224815] [2024-11-16 11:52:13,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:52:13,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:52:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:52:13,941 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-16 11:52:13,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:52:13,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890224815] [2024-11-16 11:52:13,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890224815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:52:13,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:52:13,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:52:13,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061795762] [2024-11-16 11:52:13,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:52:13,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:52:13,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:52:13,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:52:13,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:52:13,972 INFO L87 Difference]: Start difference. First operand has 45 states, 43 states have (on average 1.441860465116279) internal successors, (62), 44 states have internal predecessors, (62), 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 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-16 11:52:14,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:52:14,027 INFO L93 Difference]: Finished difference Result 77 states and 109 transitions. [2024-11-16 11:52:14,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:52:14,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2024-11-16 11:52:14,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:52:14,036 INFO L225 Difference]: With dead ends: 77 [2024-11-16 11:52:14,036 INFO L226 Difference]: Without dead ends: 42 [2024-11-16 11:52:14,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:52:14,045 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 11:52:14,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 11:52:14,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-16 11:52:14,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-16 11:52:14,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 41 states have internal predecessors, (58), 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-16 11:52:14,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2024-11-16 11:52:14,083 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 16 [2024-11-16 11:52:14,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:52:14,084 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2024-11-16 11:52:14,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-16 11:52:14,084 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2024-11-16 11:52:14,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-16 11:52:14,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:52:14,086 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:52:14,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 11:52:14,086 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:52:14,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:52:14,087 INFO L85 PathProgramCache]: Analyzing trace with hash 31546381, now seen corresponding path program 1 times [2024-11-16 11:52:14,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:52:14,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884207408] [2024-11-16 11:52:14,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:52:14,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:52:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:52:14,202 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-16 11:52:14,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:52:14,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884207408] [2024-11-16 11:52:14,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884207408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:52:14,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:52:14,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:52:14,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903889252] [2024-11-16 11:52:14,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:52:14,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:52:14,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:52:14,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:52:14,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:52:14,209 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-16 11:52:14,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:52:14,279 INFO L93 Difference]: Finished difference Result 76 states and 105 transitions. [2024-11-16 11:52:14,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:52:14,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2024-11-16 11:52:14,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:52:14,281 INFO L225 Difference]: With dead ends: 76 [2024-11-16 11:52:14,281 INFO L226 Difference]: Without dead ends: 44 [2024-11-16 11:52:14,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:52:14,283 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:52:14,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:52:14,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-16 11:52:14,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-16 11:52:14,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 states have internal predecessors, (60), 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-16 11:52:14,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2024-11-16 11:52:14,288 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 17 [2024-11-16 11:52:14,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:52:14,289 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2024-11-16 11:52:14,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-16 11:52:14,289 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2024-11-16 11:52:14,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-16 11:52:14,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:52:14,290 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:52:14,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 11:52:14,291 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:52:14,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:52:14,292 INFO L85 PathProgramCache]: Analyzing trace with hash 725181390, now seen corresponding path program 1 times [2024-11-16 11:52:14,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:52:14,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763954979] [2024-11-16 11:52:14,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:52:14,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:52:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:52:14,540 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-16 11:52:14,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:52:14,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763954979] [2024-11-16 11:52:14,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763954979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:52:14,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:52:14,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 11:52:14,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007373549] [2024-11-16 11:52:14,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:52:14,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 11:52:14,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:52:14,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 11:52:14,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 11:52:14,545 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:52:14,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:52:14,655 INFO L93 Difference]: Finished difference Result 97 states and 132 transitions. [2024-11-16 11:52:14,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 11:52:14,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-16 11:52:14,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:52:14,657 INFO L225 Difference]: With dead ends: 97 [2024-11-16 11:52:14,658 INFO L226 Difference]: Without dead ends: 63 [2024-11-16 11:52:14,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 11:52:14,659 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 30 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:52:14,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 156 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:52:14,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-16 11:52:14,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 50. [2024-11-16 11:52:14,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 states have internal predecessors, (68), 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-16 11:52:14,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2024-11-16 11:52:14,672 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 18 [2024-11-16 11:52:14,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:52:14,674 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2024-11-16 11:52:14,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:52:14,674 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2024-11-16 11:52:14,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-16 11:52:14,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:52:14,675 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:52:14,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 11:52:14,676 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:52:14,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:52:14,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1698632762, now seen corresponding path program 1 times [2024-11-16 11:52:14,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:52:14,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228229058] [2024-11-16 11:52:14,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:52:14,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:52:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:52:14,880 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:52:14,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:52:14,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228229058] [2024-11-16 11:52:14,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228229058] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 11:52:14,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057953536] [2024-11-16 11:52:14,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:52:14,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 11:52:14,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:52:14,884 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 11:52:14,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 11:52:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:52:14,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-16 11:52:15,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 11:52:15,372 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:52:15,372 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 11:52:15,827 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:52:15,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057953536] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 11:52:15,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 11:52:15,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 9] total 20 [2024-11-16 11:52:15,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646029169] [2024-11-16 11:52:15,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 11:52:15,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-16 11:52:15,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:52:15,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-16 11:52:15,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-11-16 11:52:15,830 INFO L87 Difference]: Start difference. First operand 50 states and 68 transitions. Second operand has 20 states, 20 states have (on average 4.2) internal successors, (84), 20 states have internal predecessors, (84), 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-16 11:52:16,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:52:16,423 INFO L93 Difference]: Finished difference Result 176 states and 236 transitions. [2024-11-16 11:52:16,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-16 11:52:16,424 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.2) internal successors, (84), 20 states have internal predecessors, (84), 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 33 [2024-11-16 11:52:16,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:52:16,426 INFO L225 Difference]: With dead ends: 176 [2024-11-16 11:52:16,426 INFO L226 Difference]: Without dead ends: 142 [2024-11-16 11:52:16,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=268, Invalid=1292, Unknown=0, NotChecked=0, Total=1560 [2024-11-16 11:52:16,428 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 369 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:52:16,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 319 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 11:52:16,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-16 11:52:16,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 85. [2024-11-16 11:52:16,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 84 states have internal predecessors, (114), 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-16 11:52:16,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 114 transitions. [2024-11-16 11:52:16,438 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 114 transitions. Word has length 33 [2024-11-16 11:52:16,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:52:16,438 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 114 transitions. [2024-11-16 11:52:16,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.2) internal successors, (84), 20 states have internal predecessors, (84), 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-16 11:52:16,439 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 114 transitions. [2024-11-16 11:52:16,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-16 11:52:16,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:52:16,440 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:52:16,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 11:52:16,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 11:52:16,645 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:52:16,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:52:16,646 INFO L85 PathProgramCache]: Analyzing trace with hash -2067026800, now seen corresponding path program 1 times [2024-11-16 11:52:16,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:52:16,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369297890] [2024-11-16 11:52:16,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:52:16,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:52:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:52:16,979 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:52:16,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:52:16,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369297890] [2024-11-16 11:52:16,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369297890] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 11:52:16,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930285057] [2024-11-16 11:52:16,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:52:16,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 11:52:16,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:52:16,983 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 11:52:16,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 11:52:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:52:17,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-16 11:52:17,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 11:52:17,314 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:52:17,315 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 11:52:17,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930285057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:52:17,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 11:52:17,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 12 [2024-11-16 11:52:17,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213315156] [2024-11-16 11:52:17,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:52:17,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 11:52:17,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:52:17,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 11:52:17,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-16 11:52:17,319 INFO L87 Difference]: Start difference. First operand 85 states and 114 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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-16 11:52:17,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:52:17,477 INFO L93 Difference]: Finished difference Result 186 states and 243 transitions. [2024-11-16 11:52:17,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 11:52:17,478 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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 35 [2024-11-16 11:52:17,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:52:17,478 INFO L225 Difference]: With dead ends: 186 [2024-11-16 11:52:17,479 INFO L226 Difference]: Without dead ends: 111 [2024-11-16 11:52:17,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-16 11:52:17,480 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 17 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:52:17,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 110 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 11:52:17,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-16 11:52:17,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 96. [2024-11-16 11:52:17,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.3368421052631578) internal successors, (127), 95 states have internal predecessors, (127), 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-16 11:52:17,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 127 transitions. [2024-11-16 11:52:17,494 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 127 transitions. Word has length 35 [2024-11-16 11:52:17,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:52:17,495 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 127 transitions. [2024-11-16 11:52:17,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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-16 11:52:17,495 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 127 transitions. [2024-11-16 11:52:17,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-16 11:52:17,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:52:17,496 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:52:17,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 11:52:17,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 11:52:17,697 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:52:17,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:52:17,698 INFO L85 PathProgramCache]: Analyzing trace with hash 153661268, now seen corresponding path program 1 times [2024-11-16 11:52:17,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:52:17,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640837834] [2024-11-16 11:52:17,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:52:17,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:52:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:52:17,990 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:52:17,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:52:17,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640837834] [2024-11-16 11:52:17,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640837834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:52:17,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:52:17,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 11:52:17,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552886909] [2024-11-16 11:52:17,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:52:17,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 11:52:17,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:52:17,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 11:52:17,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 11:52:17,993 INFO L87 Difference]: Start difference. First operand 96 states and 127 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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-16 11:52:18,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:52:18,055 INFO L93 Difference]: Finished difference Result 171 states and 227 transitions. [2024-11-16 11:52:18,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 11:52:18,055 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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 36 [2024-11-16 11:52:18,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:52:18,057 INFO L225 Difference]: With dead ends: 171 [2024-11-16 11:52:18,058 INFO L226 Difference]: Without dead ends: 96 [2024-11-16 11:52:18,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 11:52:18,060 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 46 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:52:18,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 113 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:52:18,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-16 11:52:18,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 70. [2024-11-16 11:52:18,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 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-16 11:52:18,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2024-11-16 11:52:18,067 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 36 [2024-11-16 11:52:18,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:52:18,068 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2024-11-16 11:52:18,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 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-16 11:52:18,068 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2024-11-16 11:52:18,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-16 11:52:18,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:52:18,069 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:52:18,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 11:52:18,070 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:52:18,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:52:18,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1299047764, now seen corresponding path program 1 times [2024-11-16 11:52:18,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:52:18,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562067278] [2024-11-16 11:52:18,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:52:18,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:52:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:52:18,364 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:52:18,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:52:18,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562067278] [2024-11-16 11:52:18,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562067278] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 11:52:18,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45825204] [2024-11-16 11:52:18,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:52:18,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 11:52:18,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:52:18,369 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 11:52:18,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 11:52:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:52:18,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-16 11:52:18,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 11:52:18,640 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:52:18,641 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 11:52:18,862 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:52:18,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45825204] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 11:52:18,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 11:52:18,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 8] total 17 [2024-11-16 11:52:18,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783425235] [2024-11-16 11:52:18,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 11:52:18,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-16 11:52:18,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:52:18,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-16 11:52:18,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2024-11-16 11:52:18,865 INFO L87 Difference]: Start difference. First operand 70 states and 90 transitions. Second operand has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 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-16 11:52:18,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:52:18,993 INFO L93 Difference]: Finished difference Result 151 states and 192 transitions. [2024-11-16 11:52:18,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 11:52:18,995 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 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 36 [2024-11-16 11:52:18,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:52:18,996 INFO L225 Difference]: With dead ends: 151 [2024-11-16 11:52:18,996 INFO L226 Difference]: Without dead ends: 102 [2024-11-16 11:52:18,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2024-11-16 11:52:18,998 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 138 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:52:18,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 164 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:52:18,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-16 11:52:19,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 70. [2024-11-16 11:52:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 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-16 11:52:19,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2024-11-16 11:52:19,008 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 36 [2024-11-16 11:52:19,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:52:19,009 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2024-11-16 11:52:19,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 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-16 11:52:19,009 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2024-11-16 11:52:19,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-16 11:52:19,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:52:19,010 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:52:19,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 11:52:19,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 11:52:19,211 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:52:19,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:52:19,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1380057170, now seen corresponding path program 1 times [2024-11-16 11:52:19,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:52:19,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368958400] [2024-11-16 11:52:19,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:52:19,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:52:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:52:19,525 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:52:19,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:52:19,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368958400] [2024-11-16 11:52:19,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368958400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:52:19,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:52:19,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 11:52:19,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371650324] [2024-11-16 11:52:19,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:52:19,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 11:52:19,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:52:19,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 11:52:19,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 11:52:19,528 INFO L87 Difference]: Start difference. First operand 70 states and 90 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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-16 11:52:19,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:52:19,637 INFO L93 Difference]: Finished difference Result 137 states and 173 transitions. [2024-11-16 11:52:19,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 11:52:19,638 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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 37 [2024-11-16 11:52:19,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:52:19,638 INFO L225 Difference]: With dead ends: 137 [2024-11-16 11:52:19,638 INFO L226 Difference]: Without dead ends: 88 [2024-11-16 11:52:19,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 11:52:19,640 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 19 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:52:19,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 146 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:52:19,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-16 11:52:19,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2024-11-16 11:52:19,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 79 states have internal predecessors, (101), 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-16 11:52:19,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 101 transitions. [2024-11-16 11:52:19,649 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 101 transitions. Word has length 37 [2024-11-16 11:52:19,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:52:19,653 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 101 transitions. [2024-11-16 11:52:19,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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-16 11:52:19,653 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 101 transitions. [2024-11-16 11:52:19,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-16 11:52:19,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:52:19,654 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:52:19,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 11:52:19,654 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:52:19,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:52:19,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1587083830, now seen corresponding path program 1 times [2024-11-16 11:52:19,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:52:19,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653451799] [2024-11-16 11:52:19,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:52:19,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:52:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:52:19,959 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:52:19,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:52:19,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653451799] [2024-11-16 11:52:19,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653451799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:52:19,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:52:19,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 11:52:19,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319449429] [2024-11-16 11:52:19,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:52:19,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 11:52:19,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:52:19,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 11:52:19,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 11:52:19,963 INFO L87 Difference]: Start difference. First operand 80 states and 101 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:52:20,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:52:20,073 INFO L93 Difference]: Finished difference Result 146 states and 185 transitions. [2024-11-16 11:52:20,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 11:52:20,074 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-16 11:52:20,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:52:20,075 INFO L225 Difference]: With dead ends: 146 [2024-11-16 11:52:20,075 INFO L226 Difference]: Without dead ends: 97 [2024-11-16 11:52:20,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 11:52:20,076 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 18 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:52:20,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 119 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:52:20,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-16 11:52:20,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2024-11-16 11:52:20,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.2553191489361701) internal successors, (118), 94 states have internal predecessors, (118), 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-16 11:52:20,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 118 transitions. [2024-11-16 11:52:20,081 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 118 transitions. Word has length 38 [2024-11-16 11:52:20,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:52:20,082 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 118 transitions. [2024-11-16 11:52:20,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:52:20,082 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 118 transitions. [2024-11-16 11:52:20,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-16 11:52:20,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:52:20,083 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:52:20,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 11:52:20,083 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:52:20,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:52:20,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1434619403, now seen corresponding path program 1 times [2024-11-16 11:52:20,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:52:20,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727159138] [2024-11-16 11:52:20,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:52:20,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:52:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:52:20,646 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:52:20,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:52:20,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727159138] [2024-11-16 11:52:20,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727159138] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 11:52:20,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144322007] [2024-11-16 11:52:20,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:52:20,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 11:52:20,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:52:20,650 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 11:52:20,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 11:52:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:52:20,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-16 11:52:20,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 11:52:21,314 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:52:21,315 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 11:52:22,999 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:52:22,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144322007] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 11:52:22,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 11:52:22,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 16] total 36 [2024-11-16 11:52:23,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257689573] [2024-11-16 11:52:23,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 11:52:23,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-16 11:52:23,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:52:23,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-16 11:52:23,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1136, Unknown=0, NotChecked=0, Total=1260 [2024-11-16 11:52:23,002 INFO L87 Difference]: Start difference. First operand 95 states and 118 transitions. Second operand has 36 states, 36 states have (on average 2.7777777777777777) internal successors, (100), 36 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) [2024-11-16 11:52:24,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:52:24,424 INFO L93 Difference]: Finished difference Result 237 states and 293 transitions. [2024-11-16 11:52:24,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-16 11:52:24,425 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.7777777777777777) internal successors, (100), 36 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) Word has length 39 [2024-11-16 11:52:24,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:52:24,427 INFO L225 Difference]: With dead ends: 237 [2024-11-16 11:52:24,427 INFO L226 Difference]: Without dead ends: 181 [2024-11-16 11:52:24,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=323, Invalid=3099, Unknown=0, NotChecked=0, Total=3422 [2024-11-16 11:52:24,430 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 116 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 11:52:24,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 284 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 11:52:24,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-16 11:52:24,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 96. [2024-11-16 11:52:24,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 95 states have internal predecessors, (118), 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-16 11:52:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2024-11-16 11:52:24,439 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 39 [2024-11-16 11:52:24,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:52:24,439 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 118 transitions. [2024-11-16 11:52:24,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.7777777777777777) internal successors, (100), 36 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) [2024-11-16 11:52:24,440 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2024-11-16 11:52:24,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-16 11:52:24,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:52:24,442 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:52:24,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-16 11:52:24,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 11:52:24,643 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:52:24,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:52:24,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1632586014, now seen corresponding path program 1 times [2024-11-16 11:52:24,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:52:24,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42975441] [2024-11-16 11:52:24,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:52:24,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:52:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:52:25,123 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:52:25,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:52:25,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42975441] [2024-11-16 11:52:25,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42975441] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 11:52:25,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105095135] [2024-11-16 11:52:25,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:52:25,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 11:52:25,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:52:25,128 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 11:52:25,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-16 11:52:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:52:25,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-16 11:52:25,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 11:52:25,655 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:52:25,655 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 11:52:26,150 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:52:26,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105095135] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 11:52:26,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 11:52:26,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 10] total 28 [2024-11-16 11:52:26,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082366978] [2024-11-16 11:52:26,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 11:52:26,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-16 11:52:26,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:52:26,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-16 11:52:26,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2024-11-16 11:52:26,156 INFO L87 Difference]: Start difference. First operand 96 states and 118 transitions. Second operand has 28 states, 28 states have (on average 4.892857142857143) internal successors, (137), 28 states have internal predecessors, (137), 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-16 11:52:27,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:52:27,469 INFO L93 Difference]: Finished difference Result 291 states and 360 transitions. [2024-11-16 11:52:27,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-16 11:52:27,469 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.892857142857143) internal successors, (137), 28 states have internal predecessors, (137), 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 55 [2024-11-16 11:52:27,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:52:27,470 INFO L225 Difference]: With dead ends: 291 [2024-11-16 11:52:27,470 INFO L226 Difference]: Without dead ends: 242 [2024-11-16 11:52:27,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=705, Invalid=3717, Unknown=0, NotChecked=0, Total=4422 [2024-11-16 11:52:27,474 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 423 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 11:52:27,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 311 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 11:52:27,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-16 11:52:27,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 207. [2024-11-16 11:52:27,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.2378640776699028) internal successors, (255), 206 states have internal predecessors, (255), 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-16 11:52:27,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 255 transitions. [2024-11-16 11:52:27,487 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 255 transitions. Word has length 55 [2024-11-16 11:52:27,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:52:27,487 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 255 transitions. [2024-11-16 11:52:27,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.892857142857143) internal successors, (137), 28 states have internal predecessors, (137), 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-16 11:52:27,488 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 255 transitions. [2024-11-16 11:52:27,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-16 11:52:27,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:52:27,489 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:52:27,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-16 11:52:27,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-16 11:52:27,694 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:52:27,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:52:27,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1776761723, now seen corresponding path program 1 times [2024-11-16 11:52:27,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:52:27,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548262045] [2024-11-16 11:52:27,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:52:27,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:52:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:52:28,762 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:52:28,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:52:28,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548262045] [2024-11-16 11:52:28,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548262045] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 11:52:28,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947009218] [2024-11-16 11:52:28,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:52:28,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 11:52:28,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:52:28,765 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 11:52:28,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-16 11:52:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:52:28,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-16 11:52:28,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 11:52:29,473 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:52:29,473 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 11:52:31,536 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:52:31,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947009218] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 11:52:31,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 11:52:31,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 18] total 43 [2024-11-16 11:52:31,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28265761] [2024-11-16 11:52:31,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 11:52:31,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-16 11:52:31,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:52:31,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-16 11:52:31,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1598, Unknown=0, NotChecked=0, Total=1806 [2024-11-16 11:52:31,539 INFO L87 Difference]: Start difference. First operand 207 states and 255 transitions. Second operand has 43 states, 43 states have (on average 3.186046511627907) internal successors, (137), 43 states have internal predecessors, (137), 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-16 11:52:33,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:52:33,953 INFO L93 Difference]: Finished difference Result 572 states and 701 transitions. [2024-11-16 11:52:33,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-11-16 11:52:33,955 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.186046511627907) internal successors, (137), 43 states have internal predecessors, (137), 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 57 [2024-11-16 11:52:33,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:52:33,956 INFO L225 Difference]: With dead ends: 572 [2024-11-16 11:52:33,956 INFO L226 Difference]: Without dead ends: 420 [2024-11-16 11:52:33,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2451 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1150, Invalid=8356, Unknown=0, NotChecked=0, Total=9506 [2024-11-16 11:52:33,962 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 394 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 11:52:33,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 340 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 11:52:33,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-11-16 11:52:33,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 365. [2024-11-16 11:52:33,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.2087912087912087) internal successors, (440), 364 states have internal predecessors, (440), 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-16 11:52:33,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 440 transitions. [2024-11-16 11:52:33,973 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 440 transitions. Word has length 57 [2024-11-16 11:52:33,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:52:33,973 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 440 transitions. [2024-11-16 11:52:33,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.186046511627907) internal successors, (137), 43 states have internal predecessors, (137), 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-16 11:52:33,974 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 440 transitions. [2024-11-16 11:52:33,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-16 11:52:33,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:52:33,975 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:52:33,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-16 11:52:34,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 11:52:34,179 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:52:34,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:52:34,179 INFO L85 PathProgramCache]: Analyzing trace with hash -893148549, now seen corresponding path program 1 times [2024-11-16 11:52:34,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:52:34,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142358037] [2024-11-16 11:52:34,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:52:34,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:52:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:52:34,978 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:52:34,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:52:34,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142358037] [2024-11-16 11:52:34,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142358037] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 11:52:34,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476653120] [2024-11-16 11:52:34,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:52:34,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 11:52:34,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:52:34,981 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 11:52:34,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-16 11:52:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:52:35,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-16 11:52:35,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 11:52:35,666 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:52:35,667 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 11:52:38,840 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:52:38,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476653120] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 11:52:38,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 11:52:38,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 39 [2024-11-16 11:52:38,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927834229] [2024-11-16 11:52:38,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 11:52:38,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-16 11:52:38,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:52:38,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-16 11:52:38,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1313, Unknown=0, NotChecked=0, Total=1482 [2024-11-16 11:52:38,844 INFO L87 Difference]: Start difference. First operand 365 states and 440 transitions. Second operand has 39 states, 39 states have (on average 3.2564102564102564) internal successors, (127), 39 states have internal predecessors, (127), 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-16 11:52:39,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:52:39,436 INFO L93 Difference]: Finished difference Result 779 states and 936 transitions. [2024-11-16 11:52:39,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-16 11:52:39,437 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.2564102564102564) internal successors, (127), 39 states have internal predecessors, (127), 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 57 [2024-11-16 11:52:39,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:52:39,438 INFO L225 Difference]: With dead ends: 779 [2024-11-16 11:52:39,439 INFO L226 Difference]: Without dead ends: 465 [2024-11-16 11:52:39,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=251, Invalid=1819, Unknown=0, NotChecked=0, Total=2070 [2024-11-16 11:52:39,440 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 87 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 11:52:39,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 297 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 11:52:39,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-11-16 11:52:39,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 398. [2024-11-16 11:52:39,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 1.2040302267002518) internal successors, (478), 397 states have internal predecessors, (478), 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-16 11:52:39,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 478 transitions. [2024-11-16 11:52:39,457 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 478 transitions. Word has length 57 [2024-11-16 11:52:39,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:52:39,457 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 478 transitions. [2024-11-16 11:52:39,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.2564102564102564) internal successors, (127), 39 states have internal predecessors, (127), 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-16 11:52:39,458 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 478 transitions. [2024-11-16 11:52:39,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-16 11:52:39,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:52:39,459 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:52:39,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-16 11:52:39,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 11:52:39,660 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:52:39,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:52:39,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1393108569, now seen corresponding path program 1 times [2024-11-16 11:52:39,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:52:39,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507197882] [2024-11-16 11:52:39,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:52:39,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:52:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:52:40,301 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 21 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:52:40,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:52:40,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507197882] [2024-11-16 11:52:40,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507197882] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 11:52:40,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755093011] [2024-11-16 11:52:40,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:52:40,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 11:52:40,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:52:40,304 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 11:52:40,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-16 11:52:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:52:40,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-16 11:52:40,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 11:52:40,934 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 21 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:52:40,934 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 11:52:42,552 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:52:42,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755093011] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 11:52:42,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 11:52:42,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 15] total 34 [2024-11-16 11:52:42,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235703300] [2024-11-16 11:52:42,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 11:52:42,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-16 11:52:42,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:52:42,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-16 11:52:42,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=959, Unknown=0, NotChecked=0, Total=1122 [2024-11-16 11:52:42,554 INFO L87 Difference]: Start difference. First operand 398 states and 478 transitions. Second operand has 34 states, 34 states have (on average 4.5) internal successors, (153), 34 states have internal predecessors, (153), 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-16 11:52:43,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:52:43,436 INFO L93 Difference]: Finished difference Result 858 states and 1030 transitions. [2024-11-16 11:52:43,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-16 11:52:43,436 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 4.5) internal successors, (153), 34 states have internal predecessors, (153), 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 58 [2024-11-16 11:52:43,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:52:43,438 INFO L225 Difference]: With dead ends: 858 [2024-11-16 11:52:43,438 INFO L226 Difference]: Without dead ends: 544 [2024-11-16 11:52:43,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=370, Invalid=1886, Unknown=0, NotChecked=0, Total=2256 [2024-11-16 11:52:43,439 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 120 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 11:52:43,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 257 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 11:52:43,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2024-11-16 11:52:43,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 536. [2024-11-16 11:52:43,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 535 states have (on average 1.1925233644859814) internal successors, (638), 535 states have internal predecessors, (638), 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-16 11:52:43,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 638 transitions. [2024-11-16 11:52:43,453 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 638 transitions. Word has length 58 [2024-11-16 11:52:43,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:52:43,453 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 638 transitions. [2024-11-16 11:52:43,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.5) internal successors, (153), 34 states have internal predecessors, (153), 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-16 11:52:43,454 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 638 transitions. [2024-11-16 11:52:43,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-16 11:52:43,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:52:43,455 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:52:43,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-16 11:52:43,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-16 11:52:43,655 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:52:43,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:52:43,656 INFO L85 PathProgramCache]: Analyzing trace with hash -330460626, now seen corresponding path program 2 times [2024-11-16 11:52:43,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:52:43,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878906671] [2024-11-16 11:52:43,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:52:43,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:52:43,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:52:44,702 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:52:44,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:52:44,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878906671] [2024-11-16 11:52:44,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878906671] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 11:52:44,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328935141] [2024-11-16 11:52:44,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 11:52:44,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 11:52:44,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:52:44,704 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 11:52:44,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-16 11:52:44,845 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 11:52:44,845 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 11:52:44,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-11-16 11:52:44,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 11:52:45,640 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:52:45,640 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 11:52:55,940 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:52:55,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328935141] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 11:52:55,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 11:52:55,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19, 21] total 50 [2024-11-16 11:52:55,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626273267] [2024-11-16 11:52:55,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 11:52:55,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-16 11:52:55,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:52:55,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-16 11:52:55,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=2150, Unknown=0, NotChecked=0, Total=2450 [2024-11-16 11:52:55,942 INFO L87 Difference]: Start difference. First operand 536 states and 638 transitions. Second operand has 50 states, 50 states have (on average 3.32) internal successors, (166), 50 states have internal predecessors, (166), 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-16 11:52:58,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:52:58,422 INFO L93 Difference]: Finished difference Result 1523 states and 1806 transitions. [2024-11-16 11:52:58,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-16 11:52:58,422 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.32) internal successors, (166), 50 states have internal predecessors, (166), 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 60 [2024-11-16 11:52:58,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:52:58,426 INFO L225 Difference]: With dead ends: 1523 [2024-11-16 11:52:58,426 INFO L226 Difference]: Without dead ends: 1112 [2024-11-16 11:52:58,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1341 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=434, Invalid=3226, Unknown=0, NotChecked=0, Total=3660 [2024-11-16 11:52:58,428 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 224 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:52:58,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 413 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1160 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-16 11:52:58,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2024-11-16 11:52:58,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 568. [2024-11-16 11:52:58,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 567 states have (on average 1.1975308641975309) internal successors, (679), 567 states have internal predecessors, (679), 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-16 11:52:58,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 679 transitions. [2024-11-16 11:52:58,456 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 679 transitions. Word has length 60 [2024-11-16 11:52:58,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:52:58,456 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 679 transitions. [2024-11-16 11:52:58,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.32) internal successors, (166), 50 states have internal predecessors, (166), 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-16 11:52:58,457 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 679 transitions. [2024-11-16 11:52:58,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-16 11:52:58,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:52:58,459 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:52:58,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-16 11:52:58,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-16 11:52:58,660 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:52:58,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:52:58,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1578928654, now seen corresponding path program 1 times [2024-11-16 11:52:58,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:52:58,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489740736] [2024-11-16 11:52:58,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:52:58,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:52:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 11:52:58,781 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 11:52:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 11:52:58,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 11:52:58,929 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 11:52:58,929 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 11:52:58,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 11:52:58,934 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:52:58,997 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 11:52:59,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:52:59 BoogieIcfgContainer [2024-11-16 11:52:59,000 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 11:52:59,001 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 11:52:59,001 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 11:52:59,001 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 11:52:59,001 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:52:13" (3/4) ... [2024-11-16 11:52:59,004 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 11:52:59,005 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 11:52:59,005 INFO L158 Benchmark]: Toolchain (without parser) took 46687.10ms. Allocated memory was 144.7MB in the beginning and 513.8MB in the end (delta: 369.1MB). Free memory was 89.8MB in the beginning and 179.8MB in the end (delta: -90.0MB). Peak memory consumption was 280.8MB. Max. memory is 16.1GB. [2024-11-16 11:52:59,006 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 144.7MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 11:52:59,006 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.20ms. Allocated memory is still 144.7MB. Free memory was 89.4MB in the beginning and 75.8MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 11:52:59,007 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.98ms. Allocated memory is still 144.7MB. Free memory was 75.8MB in the beginning and 71.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 11:52:59,007 INFO L158 Benchmark]: Boogie Preprocessor took 57.96ms. Allocated memory is still 144.7MB. Free memory was 71.6MB in the beginning and 68.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 11:52:59,007 INFO L158 Benchmark]: IcfgBuilder took 574.99ms. Allocated memory was 144.7MB in the beginning and 203.4MB in the end (delta: 58.7MB). Free memory was 68.8MB in the beginning and 160.2MB in the end (delta: -91.4MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2024-11-16 11:52:59,008 INFO L158 Benchmark]: TraceAbstraction took 45677.74ms. Allocated memory was 203.4MB in the beginning and 513.8MB in the end (delta: 310.4MB). Free memory was 160.2MB in the beginning and 179.8MB in the end (delta: -19.6MB). Peak memory consumption was 290.8MB. Max. memory is 16.1GB. [2024-11-16 11:52:59,008 INFO L158 Benchmark]: Witness Printer took 4.35ms. Allocated memory is still 513.8MB. Free memory is still 179.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 11:52:59,009 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.22ms. Allocated memory is still 144.7MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 306.20ms. Allocated memory is still 144.7MB. Free memory was 89.4MB in the beginning and 75.8MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.98ms. Allocated memory is still 144.7MB. Free memory was 75.8MB in the beginning and 71.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.96ms. Allocated memory is still 144.7MB. Free memory was 71.6MB in the beginning and 68.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 574.99ms. Allocated memory was 144.7MB in the beginning and 203.4MB in the end (delta: 58.7MB). Free memory was 68.8MB in the beginning and 160.2MB in the end (delta: -91.4MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * TraceAbstraction took 45677.74ms. Allocated memory was 203.4MB in the beginning and 513.8MB in the end (delta: 310.4MB). Free memory was 160.2MB in the beginning and 179.8MB in the end (delta: -19.6MB). Peak memory consumption was 290.8MB. Max. memory is 16.1GB. * Witness Printer took 4.35ms. Allocated memory is still 513.8MB. Free memory is still 179.8MB. There was no memory consumed. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 22]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 78. Possible 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 - 2); [L31] const SORT_2 msb_SORT_2 = (SORT_2)1 << (2 - 1); [L33] const SORT_2 var_4 = 0; [L34] const SORT_2 var_9 = 1; [L35] const SORT_2 var_16 = mask_SORT_2; [L37] SORT_1 input_3; [L39] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=3, var_16=3, var_4=0, var_9=1] [L39] SORT_2 state_5 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L40] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=3, var_16=3, var_4=0, var_9=1] [L40] SORT_2 state_6 = __VERIFIER_nondet_uchar() & 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=3, state_5=0, state_6=0, var_16=3, var_9=1] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=3, state_5=0, state_6=0, var_16=3, var_9=1] [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; VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=0, state_6=0, var_16=3, var_19_arg_0=0, var_19_arg_1=0, var_9=1] [L60] EXPR var_19_arg_0 & var_19_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=0, state_6=0, var_16=3, var_9=1] [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] EXPR var_19 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=0, state_6=0, var_16=3, var_9=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; VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_6=0, var_12=1, var_16=3, var_9=1] [L72] EXPR var_12 & mask_SORT_2 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_6=0, var_16=3, var_9=1] [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; VAL [mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=1, state_6=0, var_11=1, var_13_arg_0=-1, var_16=3, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=1, state_6=0, var_11=1, var_16=3, var_9=1] [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; VAL [mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=1, var_13=1, var_16=3, var_9=1] [L82] EXPR var_13 & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=1, var_16=3, var_9=1] [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] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=3, state_5=1, state_6=1, var_16=3, var_9=1] [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; VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=1, state_6=1, var_16=3, var_19_arg_0=0, var_19_arg_1=0, var_9=1] [L60] EXPR var_19_arg_0 & var_19_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=1, state_6=1, var_16=3, var_9=1] [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] EXPR var_19 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=1, state_6=1, var_16=3, var_9=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; VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_6=1, var_12=2, var_16=3, var_9=1] [L72] EXPR var_12 & mask_SORT_2 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_6=1, var_16=3, var_9=1] [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; VAL [mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=2, state_6=1, var_11=2, var_13_arg_0=-1, var_16=3, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=2, state_6=1, var_11=2, var_16=3, var_9=1] [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; VAL [mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=2, var_13=2, var_16=3, var_9=1] [L82] EXPR var_13 & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=2, var_16=3, var_9=1] [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] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=3, state_5=2, state_6=2, var_16=3, var_9=1] [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; VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=2, state_6=2, var_16=3, var_19_arg_0=0, var_19_arg_1=0, var_9=1] [L60] EXPR var_19_arg_0 & var_19_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=2, state_6=2, var_16=3, var_9=1] [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] EXPR var_19 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=2, state_6=2, var_16=3, var_9=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; VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_6=2, var_12=3, var_16=3, var_9=1] [L72] EXPR var_12 & mask_SORT_2 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_6=2, var_16=3, var_9=1] [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; VAL [mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=3, state_6=2, var_11=3, var_13_arg_0=-1, var_16=3, var_9=1] [L78] EXPR var_13_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=3, state_6=2, var_11=3, var_16=3, var_9=1] [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; VAL [mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=3, var_13=3, var_16=3, var_9=1] [L82] EXPR var_13 & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=3, next_14_arg_1=3, var_16=3, var_9=1] [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] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=3, state_5=3, state_6=3, var_16=3, var_9=1] [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; VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=3, state_6=3, var_16=3, var_19_arg_0=1, var_19_arg_1=1, var_9=1] [L60] EXPR var_19_arg_0 & var_19_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=3, state_6=3, var_16=3, var_9=1] [L60] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L61] EXPR var_19 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_2=3, state_5=3, state_6=3, var_16=3, var_9=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, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.5s, OverallIterations: 16, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2001 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2001 mSDsluCounter, 3292 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2857 mSDsCounter, 100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6953 IncrementalHoareTripleChecker+Invalid, 7053 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100 mSolverCounterUnsat, 435 mSDtfsCounter, 6953 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1122 GetRequests, 668 SyntacticMatches, 0 SemanticMatches, 454 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7189 ImplicationChecksByTransitivity, 13.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=568occurred in iteration=15, InterpolantAutomatonStates: 283, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 947 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 30.5s InterpolantComputationTime, 1101 NumberOfCodeBlocks, 1101 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1385 ConstructedInterpolants, 0 QuantifiedInterpolants, 29447 SizeOfPredicates, 50 NumberOfNonLiveVariables, 2219 ConjunctsInSsa, 566 ConjunctsInUnsatCore, 32 InterpolantComputations, 7 PerfectInterpolantSequences, 327/628 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 could not prove your program: unable to determine feasibility of some traces [2024-11-16 11:52:59,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c32259e8853e6c89afe16cd58a269df43712e1774228eb070d84df2c9631efaa --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 11:53:01,235 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 11:53:01,321 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-16 11:53:01,328 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 11:53:01,329 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 11:53:01,361 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 11:53:01,362 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 11:53:01,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 11:53:01,362 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 11:53:01,363 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 11:53:01,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 11:53:01,368 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 11:53:01,368 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 11:53:01,369 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 11:53:01,369 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 11:53:01,369 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 11:53:01,369 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 11:53:01,370 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 11:53:01,370 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 11:53:01,370 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 11:53:01,371 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 11:53:01,374 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 11:53:01,375 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 11:53:01,375 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 11:53:01,375 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 11:53:01,375 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 11:53:01,376 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 11:53:01,376 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 11:53:01,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 11:53:01,376 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 11:53:01,377 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 11:53:01,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:53:01,377 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 11:53:01,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 11:53:01,378 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 11:53:01,378 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 11:53:01,378 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 11:53:01,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 11:53:01,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 11:53:01,382 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 11:53:01,382 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 11:53:01,382 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c32259e8853e6c89afe16cd58a269df43712e1774228eb070d84df2c9631efaa [2024-11-16 11:53:01,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 11:53:01,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 11:53:01,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 11:53:01,726 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 11:53:01,727 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 11:53:01,728 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c [2024-11-16 11:53:03,267 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 11:53:03,468 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 11:53:03,469 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c [2024-11-16 11:53:03,480 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/507e13733/90fd70114ccc4da3bcd5ed2c90d8541d/FLAGbc6429116 [2024-11-16 11:53:03,497 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/507e13733/90fd70114ccc4da3bcd5ed2c90d8541d [2024-11-16 11:53:03,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 11:53:03,503 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 11:53:03,506 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 11:53:03,506 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 11:53:03,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 11:53:03,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:53:03" (1/1) ... [2024-11-16 11:53:03,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28833d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:53:03, skipping insertion in model container [2024-11-16 11:53:03,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:53:03" (1/1) ... [2024-11-16 11:53:03,535 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 11:53:03,731 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c[1259,1272] [2024-11-16 11:53:03,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:53:03,786 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 11:53:03,797 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c[1259,1272] [2024-11-16 11:53:03,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:53:03,841 INFO L204 MainTranslator]: Completed translation [2024-11-16 11:53:03,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:53:03 WrapperNode [2024-11-16 11:53:03,841 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 11:53:03,842 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 11:53:03,842 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 11:53:03,843 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 11:53:03,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:53:03" (1/1) ... [2024-11-16 11:53:03,860 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:53:03" (1/1) ... [2024-11-16 11:53:03,880 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 73 [2024-11-16 11:53:03,884 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 11:53:03,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 11:53:03,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 11:53:03,885 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 11:53:03,894 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:53:03" (1/1) ... [2024-11-16 11:53:03,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:53:03" (1/1) ... [2024-11-16 11:53:03,901 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:53:03" (1/1) ... [2024-11-16 11:53:03,921 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-16 11:53:03,924 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:53:03" (1/1) ... [2024-11-16 11:53:03,924 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:53:03" (1/1) ... [2024-11-16 11:53:03,928 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:53:03" (1/1) ... [2024-11-16 11:53:03,931 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:53:03" (1/1) ... [2024-11-16 11:53:03,932 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:53:03" (1/1) ... [2024-11-16 11:53:03,933 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:53:03" (1/1) ... [2024-11-16 11:53:03,935 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 11:53:03,939 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 11:53:03,939 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 11:53:03,939 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 11:53:03,940 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:53:03" (1/1) ... [2024-11-16 11:53:03,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:53:03,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:53:03,972 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-16 11:53:03,975 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-16 11:53:04,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 11:53:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 11:53:04,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 11:53:04,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 11:53:04,107 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 11:53:04,109 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 11:53:04,275 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-16 11:53:04,275 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 11:53:04,294 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 11:53:04,294 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 11:53:04,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:53:04 BoogieIcfgContainer [2024-11-16 11:53:04,296 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 11:53:04,298 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 11:53:04,300 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 11:53:04,303 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 11:53:04,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:53:03" (1/3) ... [2024-11-16 11:53:04,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4af096fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:53:04, skipping insertion in model container [2024-11-16 11:53:04,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:53:03" (2/3) ... [2024-11-16 11:53:04,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4af096fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:53:04, skipping insertion in model container [2024-11-16 11:53:04,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:53:04" (3/3) ... [2024-11-16 11:53:04,306 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.twocount2.c [2024-11-16 11:53:04,323 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 11:53:04,325 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 11:53:04,384 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 11:53:04,391 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;@367365e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 11:53:04,392 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 11:53:04,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:53:04,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-16 11:53:04,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:53:04,403 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-16 11:53:04,404 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:53:04,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:53:04,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-16 11:53:04,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 11:53:04,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1952550389] [2024-11-16 11:53:04,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:53:04,422 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-16 11:53:04,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 11:53:04,426 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-16 11:53:04,427 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-16 11:53:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:53:04,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-16 11:53:04,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 11:53:04,698 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-16 11:53:04,699 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 11:53:04,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 11:53:04,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1952550389] [2024-11-16 11:53:04,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1952550389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:53:04,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:53:04,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:53:04,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118202125] [2024-11-16 11:53:04,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:53:04,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:53:04,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 11:53:04,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:53:04,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:53:04,731 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-16 11:53:04,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:53:04,778 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2024-11-16 11:53:04,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:53:04,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2024-11-16 11:53:04,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:53:04,787 INFO L225 Difference]: With dead ends: 22 [2024-11-16 11:53:04,787 INFO L226 Difference]: Without dead ends: 11 [2024-11-16 11:53:04,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-16 11:53:04,795 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 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-16 11:53:04,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 11:53:04,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-16 11:53:04,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2024-11-16 11:53:04,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 11:53:04,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-16 11:53:04,834 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-16 11:53:04,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:53:04,835 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-16 11:53:04,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-16 11:53:04,835 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-16 11:53:04,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-16 11:53:04,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:53:04,836 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:53:04,842 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 [2024-11-16 11:53:05,039 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-16 11:53:05,040 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:53:05,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:53:05,041 INFO L85 PathProgramCache]: Analyzing trace with hash 2061110753, now seen corresponding path program 1 times [2024-11-16 11:53:05,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 11:53:05,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356081531] [2024-11-16 11:53:05,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:53:05,043 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-16 11:53:05,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 11:53:05,046 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-16 11:53:05,065 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-16 11:53:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:53:05,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-16 11:53:05,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 11:53:05,419 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-16 11:53:05,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 11:53:05,676 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-16 11:53:05,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 11:53:05,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [356081531] [2024-11-16 11:53:05,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [356081531] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 11:53:05,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 11:53:05,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-16 11:53:05,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741193686] [2024-11-16 11:53:05,677 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 11:53:05,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 11:53:05,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 11:53:05,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 11:53:05,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-16 11:53:05,679 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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-16 11:53:05,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:53:05,844 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2024-11-16 11:53:05,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 11:53:05,845 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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) Word has length 9 [2024-11-16 11:53:05,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:53:05,857 INFO L225 Difference]: With dead ends: 20 [2024-11-16 11:53:05,857 INFO L226 Difference]: Without dead ends: 17 [2024-11-16 11:53:05,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-16 11:53:05,859 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 6 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 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.0s IncrementalHoareTripleChecker+Time [2024-11-16 11:53:05,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 11:53:05,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-16 11:53:05,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2024-11-16 11:53:05,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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-16 11:53:05,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2024-11-16 11:53:05,867 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2024-11-16 11:53:05,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:53:05,867 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2024-11-16 11:53:05,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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-16 11:53:05,868 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2024-11-16 11:53:05,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-16 11:53:05,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:53:05,869 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2024-11-16 11:53:05,873 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-16 11:53:06,072 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-16 11:53:06,074 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:53:06,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:53:06,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1989777505, now seen corresponding path program 2 times [2024-11-16 11:53:06,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 11:53:06,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103080026] [2024-11-16 11:53:06,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 11:53:06,076 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-16 11:53:06,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 11:53:06,084 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-16 11:53:06,086 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-16 11:53:06,163 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 11:53:06,163 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 11:53:06,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-16 11:53:06,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 11:53:07,213 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-16 11:53:07,213 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 11:53:13,146 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-16 11:53:13,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 11:53:13,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103080026] [2024-11-16 11:53:13,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103080026] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 11:53:13,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 11:53:13,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-16 11:53:13,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343785622] [2024-11-16 11:53:13,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 11:53:13,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 11:53:13,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 11:53:13,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 11:53:13,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-16 11:53:13,154 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 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-16 11:53:14,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:53:14,403 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2024-11-16 11:53:14,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 11:53:14,404 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 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 15 [2024-11-16 11:53:14,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:53:14,405 INFO L225 Difference]: With dead ends: 29 [2024-11-16 11:53:14,405 INFO L226 Difference]: Without dead ends: 26 [2024-11-16 11:53:14,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2024-11-16 11:53:14,406 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 10 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 11:53:14,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 34 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 11:53:14,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-16 11:53:14,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-16 11:53:14,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 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-16 11:53:14,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2024-11-16 11:53:14,414 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 15 [2024-11-16 11:53:14,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:53:14,414 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2024-11-16 11:53:14,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 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-16 11:53:14,415 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2024-11-16 11:53:14,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-16 11:53:14,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:53:14,415 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1] [2024-11-16 11:53:14,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-16 11:53:14,616 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-16 11:53:14,617 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:53:14,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:53:14,617 INFO L85 PathProgramCache]: Analyzing trace with hash 610152573, now seen corresponding path program 3 times [2024-11-16 11:53:14,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 11:53:14,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [871888362] [2024-11-16 11:53:14,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-16 11:53:14,618 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-16 11:53:14,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 11:53:14,621 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-16 11:53:14,623 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-16 11:53:14,737 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-16 11:53:14,737 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-16 11:53:14,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 11:53:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 11:53:14,852 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-16 11:53:14,852 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 11:53:14,856 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 11:53:14,862 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-16 11:53:15,061 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-16 11:53:15,064 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-11-16 11:53:15,146 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 11:53:15,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:53:15 BoogieIcfgContainer [2024-11-16 11:53:15,150 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 11:53:15,151 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 11:53:15,151 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 11:53:15,151 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 11:53:15,152 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:53:04" (3/4) ... [2024-11-16 11:53:15,153 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 11:53:15,235 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 11:53:15,237 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 11:53:15,238 INFO L158 Benchmark]: Toolchain (without parser) took 11734.99ms. Allocated memory was 56.6MB in the beginning and 237.0MB in the end (delta: 180.4MB). Free memory was 28.0MB in the beginning and 205.4MB in the end (delta: -177.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 11:53:15,238 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 41.9MB. Free memory is still 18.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 11:53:15,238 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.48ms. Allocated memory is still 56.6MB. Free memory was 27.7MB in the beginning and 27.7MB in the end (delta: 67.0kB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-11-16 11:53:15,239 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.80ms. Allocated memory is still 56.6MB. Free memory was 27.7MB in the beginning and 25.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 11:53:15,239 INFO L158 Benchmark]: Boogie Preprocessor took 53.34ms. Allocated memory is still 56.6MB. Free memory was 25.9MB in the beginning and 23.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 11:53:15,239 INFO L158 Benchmark]: IcfgBuilder took 357.64ms. Allocated memory was 56.6MB in the beginning and 75.5MB in the end (delta: 18.9MB). Free memory was 23.9MB in the beginning and 44.7MB in the end (delta: -20.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 11:53:15,239 INFO L158 Benchmark]: TraceAbstraction took 10852.18ms. Allocated memory was 75.5MB in the beginning and 237.0MB in the end (delta: 161.5MB). Free memory was 44.1MB in the beginning and 211.7MB in the end (delta: -167.6MB). Peak memory consumption was 57.1MB. Max. memory is 16.1GB. [2024-11-16 11:53:15,240 INFO L158 Benchmark]: Witness Printer took 86.23ms. Allocated memory is still 237.0MB. Free memory was 211.7MB in the beginning and 205.4MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 11:53:15,241 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.12ms. Allocated memory is still 41.9MB. Free memory is still 18.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.48ms. Allocated memory is still 56.6MB. Free memory was 27.7MB in the beginning and 27.7MB in the end (delta: 67.0kB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.80ms. Allocated memory is still 56.6MB. Free memory was 27.7MB in the beginning and 25.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.34ms. Allocated memory is still 56.6MB. Free memory was 25.9MB in the beginning and 23.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 357.64ms. Allocated memory was 56.6MB in the beginning and 75.5MB in the end (delta: 18.9MB). Free memory was 23.9MB in the beginning and 44.7MB in the end (delta: -20.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 10852.18ms. Allocated memory was 75.5MB in the beginning and 237.0MB in the end (delta: 161.5MB). Free memory was 44.1MB in the beginning and 211.7MB in the end (delta: -167.6MB). Peak memory consumption was 57.1MB. Max. memory is 16.1GB. * Witness Printer took 86.23ms. Allocated memory is still 237.0MB. Free memory was 211.7MB in the beginning and 205.4MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * 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 - 2); [L31] const SORT_2 msb_SORT_2 = (SORT_2)1 << (2 - 1); [L33] const SORT_2 var_4 = 0; [L34] const SORT_2 var_9 = 1; [L35] const SORT_2 var_16 = mask_SORT_2; [L37] SORT_1 input_3; [L39] SORT_2 state_5 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L40] SORT_2 state_6 = __VERIFIER_nondet_uchar() & 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=3, 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, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 4, TraceHistogramMax: 7, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 66 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 83 IncrementalHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 15 mSDtfsCounter, 83 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred 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, 7.7s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 49 ConstructedInterpolants, 17 QuantifiedInterpolants, 8566 SizeOfPredicates, 17 NumberOfNonLiveVariables, 181 ConjunctsInSsa, 62 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-16 11:53:15,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE