./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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.dk.eval-mul-div-a046e57-m [2024-10-12 23:38:02,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:38:02,415 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-12 23:38:02,425 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:38:02,425 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:38:02,448 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:38:02,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:38:02,449 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:38:02,449 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:38:02,450 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:38:02,450 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:38:02,451 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:38:02,452 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:38:02,452 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:38:02,454 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:38:02,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:38:02,455 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:38:02,455 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 23:38:02,455 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:38:02,455 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:38:02,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:38:02,456 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:38:02,457 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:38:02,458 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:38:02,458 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:38:02,461 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:38:02,461 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:38:02,461 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:38:02,461 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:38:02,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:38:02,462 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:38:02,462 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:38:02,462 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:38:02,462 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 23:38:02,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 23:38:02,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:38:02,464 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:38:02,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:38:02,465 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:38:02,465 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-10-12 23:38:02,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:38:02,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:38:02,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:38:02,787 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:38:02,788 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:38:02,789 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c [2024-10-12 23:38:04,229 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:38:04,452 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:38:04,453 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c [2024-10-12 23:38:04,461 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73abfa986/f8e441731e184ec38f4af852825032c5/FLAG04d6f4cee [2024-10-12 23:38:04,475 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73abfa986/f8e441731e184ec38f4af852825032c5 [2024-10-12 23:38:04,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:38:04,478 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:38:04,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:38:04,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:38:04,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:38:04,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:38:04" (1/1) ... [2024-10-12 23:38:04,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c82c6cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:38:04, skipping insertion in model container [2024-10-12 23:38:04,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:38:04" (1/1) ... [2024-10-12 23:38:04,515 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:38:04,678 WARN L248 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-10-12 23:38:04,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:38:04,721 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:38:04,730 WARN L248 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-10-12 23:38:04,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:38:04,762 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:38:04,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:38:04 WrapperNode [2024-10-12 23:38:04,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:38:04,764 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:38:04,764 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:38:04,764 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:38:04,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:38:04" (1/1) ... [2024-10-12 23:38:04,782 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:38:04" (1/1) ... [2024-10-12 23:38:04,821 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 138 [2024-10-12 23:38:04,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:38:04,823 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:38:04,823 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:38:04,823 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:38:04,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:38:04" (1/1) ... [2024-10-12 23:38:04,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:38:04" (1/1) ... [2024-10-12 23:38:04,843 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:38:04" (1/1) ... [2024-10-12 23:38:04,861 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-10-12 23:38:04,862 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:38:04" (1/1) ... [2024-10-12 23:38:04,863 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:38:04" (1/1) ... [2024-10-12 23:38:04,877 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:38:04" (1/1) ... [2024-10-12 23:38:04,884 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:38:04" (1/1) ... [2024-10-12 23:38:04,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:38:04" (1/1) ... [2024-10-12 23:38:04,894 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:38:04" (1/1) ... [2024-10-12 23:38:04,900 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:38:04,902 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:38:04,902 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:38:04,902 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:38:04,903 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:38:04" (1/1) ... [2024-10-12 23:38:04,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:38:04,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:38:04,930 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-10-12 23:38:04,932 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-10-12 23:38:04,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:38:04,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 23:38:04,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:38:04,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:38:05,050 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:38:05,052 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:38:05,401 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2024-10-12 23:38:05,402 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:38:05,431 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:38:05,435 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:38:05,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:38:05 BoogieIcfgContainer [2024-10-12 23:38:05,436 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:38:05,439 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:38:05,439 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:38:05,443 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:38:05,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:38:04" (1/3) ... [2024-10-12 23:38:05,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4674d8d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:38:05, skipping insertion in model container [2024-10-12 23:38:05,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:38:04" (2/3) ... [2024-10-12 23:38:05,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4674d8d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:38:05, skipping insertion in model container [2024-10-12 23:38:05,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:38:05" (3/3) ... [2024-10-12 23:38:05,445 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.twocount2.c [2024-10-12 23:38:05,461 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:38:05,461 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:38:05,510 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:38:05,517 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;@5e6efb43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:38:05,517 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:38:05,521 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 38 states have internal predecessors, (56), 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-10-12 23:38:05,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-12 23:38:05,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:38:05,542 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:38:05,543 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:38:05,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:38:05,550 INFO L85 PathProgramCache]: Analyzing trace with hash -726076948, now seen corresponding path program 1 times [2024-10-12 23:38:05,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:38:05,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654545382] [2024-10-12 23:38:05,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:05,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:38:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:38:06,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:06,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:38:06,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654545382] [2024-10-12 23:38:06,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654545382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:38:06,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:38:06,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:38:06,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589864671] [2024-10-12 23:38:06,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:38:06,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:38:06,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:38:06,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:38:06,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:38:06,077 INFO L87 Difference]: Start difference. First operand has 39 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 38 states have internal predecessors, (56), 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 3.5) internal successors, (14), 4 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-10-12 23:38:06,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:38:06,125 INFO L93 Difference]: Finished difference Result 70 states and 102 transitions. [2024-10-12 23:38:06,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:38:06,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-12 23:38:06,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:38:06,135 INFO L225 Difference]: With dead ends: 70 [2024-10-12 23:38:06,135 INFO L226 Difference]: Without dead ends: 40 [2024-10-12 23:38:06,139 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-10-12 23:38:06,144 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:38:06,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:38:06,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-12 23:38:06,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-12 23:38:06,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.435897435897436) internal successors, (56), 39 states have internal predecessors, (56), 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-10-12 23:38:06,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2024-10-12 23:38:06,181 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 14 [2024-10-12 23:38:06,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:38:06,182 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2024-10-12 23:38:06,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-10-12 23:38:06,182 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2024-10-12 23:38:06,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-12 23:38:06,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:38:06,184 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:38:06,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 23:38:06,185 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:38:06,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:38:06,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1031853690, now seen corresponding path program 1 times [2024-10-12 23:38:06,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:38:06,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055135343] [2024-10-12 23:38:06,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:06,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:38:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:38:06,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:06,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:38:06,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055135343] [2024-10-12 23:38:06,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055135343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:38:06,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:38:06,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:38:06,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143567983] [2024-10-12 23:38:06,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:38:06,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:38:06,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:38:06,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:38:06,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:38:06,345 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-10-12 23:38:06,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:38:06,382 INFO L93 Difference]: Finished difference Result 73 states and 102 transitions. [2024-10-12 23:38:06,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:38:06,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 15 [2024-10-12 23:38:06,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:38:06,383 INFO L225 Difference]: With dead ends: 73 [2024-10-12 23:38:06,384 INFO L226 Difference]: Without dead ends: 42 [2024-10-12 23:38:06,385 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-10-12 23:38:06,386 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:38:06,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:38:06,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-12 23:38:06,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-12 23:38:06,395 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-10-12 23:38:06,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2024-10-12 23:38:06,396 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 15 [2024-10-12 23:38:06,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:38:06,396 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2024-10-12 23:38:06,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-10-12 23:38:06,396 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2024-10-12 23:38:06,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-12 23:38:06,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:38:06,397 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:38:06,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 23:38:06,397 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:38:06,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:38:06,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1274308101, now seen corresponding path program 1 times [2024-10-12 23:38:06,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:38:06,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002640515] [2024-10-12 23:38:06,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:06,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:38:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:38:06,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:06,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:38:06,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002640515] [2024-10-12 23:38:06,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002640515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:38:06,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:38:06,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 23:38:06,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479703197] [2024-10-12 23:38:06,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:38:06,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 23:38:06,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:38:06,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 23:38:06,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:38:06,764 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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-10-12 23:38:06,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:38:06,866 INFO L93 Difference]: Finished difference Result 94 states and 129 transitions. [2024-10-12 23:38:06,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 23:38:06,867 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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-10-12 23:38:06,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:38:06,867 INFO L225 Difference]: With dead ends: 94 [2024-10-12 23:38:06,868 INFO L226 Difference]: Without dead ends: 61 [2024-10-12 23:38:06,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 23:38:06,869 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 39 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:38:06,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 179 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:38:06,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-12 23:38:06,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 48. [2024-10-12 23:38:06,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 47 states have internal predecessors, (66), 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-10-12 23:38:06,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 66 transitions. [2024-10-12 23:38:06,875 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 66 transitions. Word has length 16 [2024-10-12 23:38:06,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:38:06,875 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 66 transitions. [2024-10-12 23:38:06,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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-10-12 23:38:06,876 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 66 transitions. [2024-10-12 23:38:06,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-12 23:38:06,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:38:06,876 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] [2024-10-12 23:38:06,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 23:38:06,877 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:38:06,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:38:06,878 INFO L85 PathProgramCache]: Analyzing trace with hash 660826831, now seen corresponding path program 1 times [2024-10-12 23:38:06,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:38:06,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543552801] [2024-10-12 23:38:06,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:06,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:38:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:38:07,083 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:07,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:38:07,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543552801] [2024-10-12 23:38:07,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543552801] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 23:38:07,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472774368] [2024-10-12 23:38:07,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:07,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:38:07,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:38:07,087 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-10-12 23:38:07,088 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-10-12 23:38:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:38:07,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 23:38:07,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:38:07,294 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:07,295 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:38:07,425 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:07,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472774368] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:38:07,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 23:38:07,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-12 23:38:07,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310926966] [2024-10-12 23:38:07,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 23:38:07,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 23:38:07,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:38:07,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 23:38:07,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-12 23:38:07,433 INFO L87 Difference]: Start difference. First operand 48 states and 66 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 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-10-12 23:38:07,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:38:07,590 INFO L93 Difference]: Finished difference Result 130 states and 177 transitions. [2024-10-12 23:38:07,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 23:38:07,591 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 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 31 [2024-10-12 23:38:07,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:38:07,593 INFO L225 Difference]: With dead ends: 130 [2024-10-12 23:38:07,595 INFO L226 Difference]: Without dead ends: 74 [2024-10-12 23:38:07,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-10-12 23:38:07,598 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 38 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:38:07,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 328 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:38:07,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-12 23:38:07,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2024-10-12 23:38:07,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 69 states have internal predecessors, (95), 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-10-12 23:38:07,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 95 transitions. [2024-10-12 23:38:07,611 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 95 transitions. Word has length 31 [2024-10-12 23:38:07,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:38:07,611 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 95 transitions. [2024-10-12 23:38:07,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 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-10-12 23:38:07,612 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 95 transitions. [2024-10-12 23:38:07,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-12 23:38:07,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:38:07,613 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] [2024-10-12 23:38:07,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 23:38:07,817 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-10-12 23:38:07,818 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:38:07,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:38:07,819 INFO L85 PathProgramCache]: Analyzing trace with hash -41704899, now seen corresponding path program 1 times [2024-10-12 23:38:07,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:38:07,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371685898] [2024-10-12 23:38:07,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:07,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:38:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:38:08,235 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:08,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:38:08,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371685898] [2024-10-12 23:38:08,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371685898] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 23:38:08,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926197195] [2024-10-12 23:38:08,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:08,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:38:08,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:38:08,239 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-10-12 23:38:08,241 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-10-12 23:38:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:38:08,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-12 23:38:08,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:38:08,581 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:08,581 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:38:08,918 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:08,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926197195] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:38:08,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 23:38:08,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 18 [2024-10-12 23:38:08,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592892785] [2024-10-12 23:38:08,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 23:38:08,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-12 23:38:08,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:38:08,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-12 23:38:08,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2024-10-12 23:38:08,921 INFO L87 Difference]: Start difference. First operand 70 states and 95 transitions. Second operand has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 18 states have internal predecessors, (80), 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-10-12 23:38:09,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:38:09,196 INFO L93 Difference]: Finished difference Result 155 states and 209 transitions. [2024-10-12 23:38:09,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 23:38:09,196 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 18 states have internal predecessors, (80), 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 32 [2024-10-12 23:38:09,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:38:09,197 INFO L225 Difference]: With dead ends: 155 [2024-10-12 23:38:09,198 INFO L226 Difference]: Without dead ends: 102 [2024-10-12 23:38:09,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2024-10-12 23:38:09,199 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 260 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 23:38:09,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 72 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 23:38:09,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-12 23:38:09,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 71. [2024-10-12 23:38:09,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 70 states have internal predecessors, (96), 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-10-12 23:38:09,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 96 transitions. [2024-10-12 23:38:09,205 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 96 transitions. Word has length 32 [2024-10-12 23:38:09,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:38:09,206 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 96 transitions. [2024-10-12 23:38:09,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 18 states have internal predecessors, (80), 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-10-12 23:38:09,206 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 96 transitions. [2024-10-12 23:38:09,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-12 23:38:09,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:38:09,207 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-10-12 23:38:09,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 23:38:09,411 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-10-12 23:38:09,412 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:38:09,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:38:09,412 INFO L85 PathProgramCache]: Analyzing trace with hash -76300106, now seen corresponding path program 1 times [2024-10-12 23:38:09,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:38:09,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104681730] [2024-10-12 23:38:09,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:09,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:38:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:38:09,738 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:09,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:38:09,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104681730] [2024-10-12 23:38:09,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104681730] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 23:38:09,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786055392] [2024-10-12 23:38:09,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:09,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:38:09,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:38:09,744 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-10-12 23:38:09,745 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-10-12 23:38:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:38:09,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-12 23:38:09,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:38:10,148 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:10,148 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:38:10,510 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:10,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786055392] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:38:10,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 23:38:10,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 8] total 21 [2024-10-12 23:38:10,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509678709] [2024-10-12 23:38:10,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 23:38:10,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-12 23:38:10,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:38:10,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-12 23:38:10,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2024-10-12 23:38:10,513 INFO L87 Difference]: Start difference. First operand 71 states and 96 transitions. Second operand has 22 states, 22 states have (on average 3.5454545454545454) internal successors, (78), 21 states have internal predecessors, (78), 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-10-12 23:38:10,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:38:10,967 INFO L93 Difference]: Finished difference Result 209 states and 275 transitions. [2024-10-12 23:38:10,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 23:38:10,968 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.5454545454545454) internal successors, (78), 21 states have internal predecessors, (78), 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-10-12 23:38:10,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:38:10,970 INFO L225 Difference]: With dead ends: 209 [2024-10-12 23:38:10,970 INFO L226 Difference]: Without dead ends: 147 [2024-10-12 23:38:10,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2024-10-12 23:38:10,972 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 210 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 23:38:10,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 132 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 23:38:10,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-12 23:38:10,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 81. [2024-10-12 23:38:10,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 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-10-12 23:38:10,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 110 transitions. [2024-10-12 23:38:10,979 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 110 transitions. Word has length 33 [2024-10-12 23:38:10,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:38:10,979 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 110 transitions. [2024-10-12 23:38:10,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.5454545454545454) internal successors, (78), 21 states have internal predecessors, (78), 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-10-12 23:38:10,980 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 110 transitions. [2024-10-12 23:38:10,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-12 23:38:10,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:38:10,981 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] [2024-10-12 23:38:10,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 23:38:11,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:38:11,185 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:38:11,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:38:11,186 INFO L85 PathProgramCache]: Analyzing trace with hash 724097021, now seen corresponding path program 1 times [2024-10-12 23:38:11,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:38:11,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058533180] [2024-10-12 23:38:11,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:11,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:38:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:38:11,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:11,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:38:11,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058533180] [2024-10-12 23:38:11,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058533180] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:38:11,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:38:11,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 23:38:11,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29958591] [2024-10-12 23:38:11,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:38:11,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 23:38:11,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:38:11,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 23:38:11,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 23:38:11,348 INFO L87 Difference]: Start difference. First operand 81 states and 110 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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-10-12 23:38:11,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:38:11,406 INFO L93 Difference]: Finished difference Result 159 states and 214 transitions. [2024-10-12 23:38:11,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 23:38:11,407 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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 34 [2024-10-12 23:38:11,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:38:11,407 INFO L225 Difference]: With dead ends: 159 [2024-10-12 23:38:11,408 INFO L226 Difference]: Without dead ends: 87 [2024-10-12 23:38:11,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-10-12 23:38:11,409 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 76 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:38:11,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 138 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:38:11,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-12 23:38:11,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2024-10-12 23:38:11,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 82 states have internal predecessors, (112), 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-10-12 23:38:11,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 112 transitions. [2024-10-12 23:38:11,414 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 112 transitions. Word has length 34 [2024-10-12 23:38:11,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:38:11,415 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 112 transitions. [2024-10-12 23:38:11,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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-10-12 23:38:11,415 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 112 transitions. [2024-10-12 23:38:11,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-12 23:38:11,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:38:11,416 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] [2024-10-12 23:38:11,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 23:38:11,416 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:38:11,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:38:11,417 INFO L85 PathProgramCache]: Analyzing trace with hash -700071083, now seen corresponding path program 1 times [2024-10-12 23:38:11,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:38:11,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000594765] [2024-10-12 23:38:11,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:11,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:38:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:38:11,586 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:11,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:38:11,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000594765] [2024-10-12 23:38:11,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000594765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:38:11,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:38:11,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 23:38:11,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709477971] [2024-10-12 23:38:11,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:38:11,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 23:38:11,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:38:11,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 23:38:11,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 23:38:11,588 INFO L87 Difference]: Start difference. First operand 83 states and 112 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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-10-12 23:38:11,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:38:11,636 INFO L93 Difference]: Finished difference Result 157 states and 211 transitions. [2024-10-12 23:38:11,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 23:38:11,636 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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 34 [2024-10-12 23:38:11,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:38:11,637 INFO L225 Difference]: With dead ends: 157 [2024-10-12 23:38:11,637 INFO L226 Difference]: Without dead ends: 83 [2024-10-12 23:38:11,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-10-12 23:38:11,639 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 49 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:38:11,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 123 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:38:11,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-12 23:38:11,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 57. [2024-10-12 23:38:11,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 56 states have internal predecessors, (75), 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-10-12 23:38:11,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2024-10-12 23:38:11,645 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 75 transitions. Word has length 34 [2024-10-12 23:38:11,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:38:11,645 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 75 transitions. [2024-10-12 23:38:11,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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-10-12 23:38:11,645 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2024-10-12 23:38:11,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-12 23:38:11,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:38:11,646 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] [2024-10-12 23:38:11,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 23:38:11,646 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:38:11,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:38:11,647 INFO L85 PathProgramCache]: Analyzing trace with hash 906444762, now seen corresponding path program 1 times [2024-10-12 23:38:11,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:38:11,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536719772] [2024-10-12 23:38:11,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:11,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:38:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:38:12,014 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:12,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:38:12,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536719772] [2024-10-12 23:38:12,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536719772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:38:12,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:38:12,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 23:38:12,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165443076] [2024-10-12 23:38:12,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:38:12,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 23:38:12,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:38:12,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 23:38:12,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:38:12,017 INFO L87 Difference]: Start difference. First operand 57 states and 75 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 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-10-12 23:38:12,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:38:12,092 INFO L93 Difference]: Finished difference Result 126 states and 162 transitions. [2024-10-12 23:38:12,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 23:38:12,092 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 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-10-12 23:38:12,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:38:12,093 INFO L225 Difference]: With dead ends: 126 [2024-10-12 23:38:12,093 INFO L226 Difference]: Without dead ends: 78 [2024-10-12 23:38:12,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-10-12 23:38:12,094 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 19 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:38:12,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 126 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:38:12,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-12 23:38:12,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2024-10-12 23:38:12,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.318840579710145) internal successors, (91), 69 states have internal predecessors, (91), 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-10-12 23:38:12,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2024-10-12 23:38:12,099 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 35 [2024-10-12 23:38:12,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:38:12,099 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2024-10-12 23:38:12,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 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-10-12 23:38:12,099 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2024-10-12 23:38:12,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-12 23:38:12,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:38:12,100 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-10-12 23:38:12,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 23:38:12,101 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:38:12,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:38:12,101 INFO L85 PathProgramCache]: Analyzing trace with hash 62465150, now seen corresponding path program 1 times [2024-10-12 23:38:12,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:38:12,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642304667] [2024-10-12 23:38:12,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:12,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:38:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:38:12,424 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:12,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:38:12,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642304667] [2024-10-12 23:38:12,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642304667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:38:12,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:38:12,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 23:38:12,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528068090] [2024-10-12 23:38:12,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:38:12,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 23:38:12,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:38:12,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 23:38:12,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 23:38:12,428 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 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-10-12 23:38:12,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:38:12,529 INFO L93 Difference]: Finished difference Result 135 states and 174 transitions. [2024-10-12 23:38:12,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 23:38:12,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 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-10-12 23:38:12,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:38:12,530 INFO L225 Difference]: With dead ends: 135 [2024-10-12 23:38:12,530 INFO L226 Difference]: Without dead ends: 87 [2024-10-12 23:38:12,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-10-12 23:38:12,531 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:38:12,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 128 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:38:12,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-12 23:38:12,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2024-10-12 23:38:12,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 84 states have internal predecessors, (108), 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-10-12 23:38:12,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 108 transitions. [2024-10-12 23:38:12,539 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 108 transitions. Word has length 36 [2024-10-12 23:38:12,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:38:12,539 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 108 transitions. [2024-10-12 23:38:12,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 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-10-12 23:38:12,540 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 108 transitions. [2024-10-12 23:38:12,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 23:38:12,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:38:12,540 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-10-12 23:38:12,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 23:38:12,541 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:38:12,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:38:12,545 INFO L85 PathProgramCache]: Analyzing trace with hash -2022204904, now seen corresponding path program 1 times [2024-10-12 23:38:12,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:38:12,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597707223] [2024-10-12 23:38:12,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:12,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:38:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:38:13,260 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:13,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:38:13,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597707223] [2024-10-12 23:38:13,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597707223] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 23:38:13,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529652278] [2024-10-12 23:38:13,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:13,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:38:13,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:38:13,263 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-10-12 23:38:13,264 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-10-12 23:38:13,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:38:13,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 90 conjuncts are in the unsatisfiable core [2024-10-12 23:38:13,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:38:14,137 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:14,138 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:38:16,705 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:16,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529652278] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:38:16,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 23:38:16,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 17] total 40 [2024-10-12 23:38:16,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868450099] [2024-10-12 23:38:16,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 23:38:16,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-12 23:38:16,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:38:16,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-12 23:38:16,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1471, Unknown=0, NotChecked=0, Total=1640 [2024-10-12 23:38:16,713 INFO L87 Difference]: Start difference. First operand 85 states and 108 transitions. Second operand has 41 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 40 states have internal predecessors, (102), 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-10-12 23:38:17,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:38:17,879 INFO L93 Difference]: Finished difference Result 198 states and 248 transitions. [2024-10-12 23:38:17,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-12 23:38:17,880 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 40 states have internal predecessors, (102), 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-10-12 23:38:17,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:38:17,880 INFO L225 Difference]: With dead ends: 198 [2024-10-12 23:38:17,881 INFO L226 Difference]: Without dead ends: 143 [2024-10-12 23:38:17,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=339, Invalid=2967, Unknown=0, NotChecked=0, Total=3306 [2024-10-12 23:38:17,882 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 108 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 23:38:17,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 188 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 23:38:17,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-12 23:38:17,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 86. [2024-10-12 23:38:17,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 85 states have internal predecessors, (108), 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-10-12 23:38:17,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2024-10-12 23:38:17,888 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 37 [2024-10-12 23:38:17,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:38:17,889 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2024-10-12 23:38:17,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 40 states have internal predecessors, (102), 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-10-12 23:38:17,889 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2024-10-12 23:38:17,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 23:38:17,890 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:38:17,890 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] [2024-10-12 23:38:17,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 23:38:18,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:38:18,091 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:38:18,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:38:18,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1980920491, now seen corresponding path program 1 times [2024-10-12 23:38:18,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:38:18,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458448576] [2024-10-12 23:38:18,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:18,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:38:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:38:18,514 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:18,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:38:18,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458448576] [2024-10-12 23:38:18,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458448576] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 23:38:18,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317568821] [2024-10-12 23:38:18,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:18,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:38:18,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:38:18,517 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-10-12 23:38:18,518 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-10-12 23:38:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:38:18,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-10-12 23:38:18,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:38:19,037 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:19,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:38:19,484 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:19,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317568821] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:38:19,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 23:38:19,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 25 [2024-10-12 23:38:19,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922707631] [2024-10-12 23:38:19,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 23:38:19,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-12 23:38:19,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:38:19,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-12 23:38:19,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2024-10-12 23:38:19,486 INFO L87 Difference]: Start difference. First operand 86 states and 108 transitions. Second operand has 26 states, 26 states have (on average 4.653846153846154) internal successors, (121), 25 states have internal predecessors, (121), 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-10-12 23:38:20,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:38:20,235 INFO L93 Difference]: Finished difference Result 203 states and 256 transitions. [2024-10-12 23:38:20,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-12 23:38:20,236 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.653846153846154) internal successors, (121), 25 states have internal predecessors, (121), 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 53 [2024-10-12 23:38:20,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:38:20,237 INFO L225 Difference]: With dead ends: 203 [2024-10-12 23:38:20,238 INFO L226 Difference]: Without dead ends: 155 [2024-10-12 23:38:20,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=349, Invalid=1457, Unknown=0, NotChecked=0, Total=1806 [2024-10-12 23:38:20,239 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 334 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 23:38:20,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 213 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 23:38:20,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-12 23:38:20,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 146. [2024-10-12 23:38:20,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.2689655172413794) internal successors, (184), 145 states have internal predecessors, (184), 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-10-12 23:38:20,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 184 transitions. [2024-10-12 23:38:20,248 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 184 transitions. Word has length 53 [2024-10-12 23:38:20,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:38:20,248 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 184 transitions. [2024-10-12 23:38:20,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.653846153846154) internal successors, (121), 25 states have internal predecessors, (121), 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-10-12 23:38:20,251 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 184 transitions. [2024-10-12 23:38:20,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 23:38:20,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:38:20,256 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] [2024-10-12 23:38:20,283 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-10-12 23:38:20,457 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,SelfDestructingSolverStorable11 [2024-10-12 23:38:20,457 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:38:20,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:38:20,458 INFO L85 PathProgramCache]: Analyzing trace with hash 748455523, now seen corresponding path program 1 times [2024-10-12 23:38:20,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:38:20,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165301698] [2024-10-12 23:38:20,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:20,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:38:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:38:20,839 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:20,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:38:20,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165301698] [2024-10-12 23:38:20,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165301698] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 23:38:20,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266327666] [2024-10-12 23:38:20,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:20,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:38:20,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:38:20,842 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-10-12 23:38:20,844 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-10-12 23:38:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:38:20,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-10-12 23:38:20,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:38:21,413 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:21,414 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:38:22,140 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:22,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266327666] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:38:22,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 23:38:22,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 12] total 25 [2024-10-12 23:38:22,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529345553] [2024-10-12 23:38:22,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 23:38:22,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-12 23:38:22,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:38:22,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-12 23:38:22,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2024-10-12 23:38:22,142 INFO L87 Difference]: Start difference. First operand 146 states and 184 transitions. Second operand has 26 states, 26 states have (on average 5.653846153846154) internal successors, (147), 25 states have internal predecessors, (147), 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-10-12 23:38:22,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:38:22,897 INFO L93 Difference]: Finished difference Result 407 states and 517 transitions. [2024-10-12 23:38:22,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-12 23:38:22,898 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.653846153846154) internal successors, (147), 25 states have internal predecessors, (147), 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 54 [2024-10-12 23:38:22,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:38:22,900 INFO L225 Difference]: With dead ends: 407 [2024-10-12 23:38:22,900 INFO L226 Difference]: Without dead ends: 307 [2024-10-12 23:38:22,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=280, Invalid=1526, Unknown=0, NotChecked=0, Total=1806 [2024-10-12 23:38:22,901 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 119 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 23:38:22,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 140 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 23:38:22,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-10-12 23:38:22,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 287. [2024-10-12 23:38:22,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 1.2587412587412588) internal successors, (360), 286 states have internal predecessors, (360), 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-10-12 23:38:22,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 360 transitions. [2024-10-12 23:38:22,911 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 360 transitions. Word has length 54 [2024-10-12 23:38:22,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:38:22,911 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 360 transitions. [2024-10-12 23:38:22,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.653846153846154) internal successors, (147), 25 states have internal predecessors, (147), 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-10-12 23:38:22,911 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 360 transitions. [2024-10-12 23:38:22,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-12 23:38:22,912 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:38:22,912 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1] [2024-10-12 23:38:22,930 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-10-12 23:38:23,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:38:23,117 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:38:23,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:38:23,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1660092998, now seen corresponding path program 1 times [2024-10-12 23:38:23,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:38:23,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81484509] [2024-10-12 23:38:23,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:23,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:38:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:38:23,884 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:23,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:38:23,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81484509] [2024-10-12 23:38:23,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81484509] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 23:38:23,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366175162] [2024-10-12 23:38:23,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:23,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:38:23,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:38:23,887 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-10-12 23:38:23,888 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-10-12 23:38:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:38:24,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-10-12 23:38:24,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:38:24,503 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:24,503 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:38:27,246 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:27,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366175162] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:38:27,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 23:38:27,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 18] total 41 [2024-10-12 23:38:27,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216329240] [2024-10-12 23:38:27,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 23:38:27,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-10-12 23:38:27,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:38:27,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-12 23:38:27,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1510, Unknown=0, NotChecked=0, Total=1722 [2024-10-12 23:38:27,249 INFO L87 Difference]: Start difference. First operand 287 states and 360 transitions. Second operand has 42 states, 42 states have (on average 3.238095238095238) internal successors, (136), 41 states have internal predecessors, (136), 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-10-12 23:38:28,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:38:28,560 INFO L93 Difference]: Finished difference Result 601 states and 749 transitions. [2024-10-12 23:38:28,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-12 23:38:28,561 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.238095238095238) internal successors, (136), 41 states have internal predecessors, (136), 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 56 [2024-10-12 23:38:28,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:38:28,562 INFO L225 Difference]: With dead ends: 601 [2024-10-12 23:38:28,562 INFO L226 Difference]: Without dead ends: 360 [2024-10-12 23:38:28,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1441 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=777, Invalid=4773, Unknown=0, NotChecked=0, Total=5550 [2024-10-12 23:38:28,565 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 264 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 23:38:28,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 353 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 23:38:28,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-12 23:38:28,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 323. [2024-10-12 23:38:28,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 322 states have (on average 1.2267080745341614) internal successors, (395), 322 states have internal predecessors, (395), 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-10-12 23:38:28,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 395 transitions. [2024-10-12 23:38:28,576 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 395 transitions. Word has length 56 [2024-10-12 23:38:28,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:38:28,576 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 395 transitions. [2024-10-12 23:38:28,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.238095238095238) internal successors, (136), 41 states have internal predecessors, (136), 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-10-12 23:38:28,577 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 395 transitions. [2024-10-12 23:38:28,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-12 23:38:28,578 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:38:28,578 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:38:28,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-12 23:38:28,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:38:28,779 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:38:28,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:38:28,779 INFO L85 PathProgramCache]: Analyzing trace with hash -282956205, now seen corresponding path program 1 times [2024-10-12 23:38:28,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:38:28,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794140203] [2024-10-12 23:38:28,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:28,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:38:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:38:29,730 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 37 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-12 23:38:29,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:38:29,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794140203] [2024-10-12 23:38:29,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794140203] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 23:38:29,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073366586] [2024-10-12 23:38:29,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:29,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:38:29,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:38:29,732 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-10-12 23:38:29,733 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-10-12 23:38:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:38:29,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-10-12 23:38:29,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:38:30,400 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-12 23:38:30,400 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:38:30,723 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 35 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-12 23:38:30,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073366586] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:38:30,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 23:38:30,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 9] total 29 [2024-10-12 23:38:30,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600712383] [2024-10-12 23:38:30,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 23:38:30,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-12 23:38:30,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:38:30,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-12 23:38:30,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2024-10-12 23:38:30,726 INFO L87 Difference]: Start difference. First operand 323 states and 395 transitions. Second operand has 30 states, 30 states have (on average 5.366666666666666) internal successors, (161), 29 states have internal predecessors, (161), 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-10-12 23:38:31,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:38:31,398 INFO L93 Difference]: Finished difference Result 660 states and 800 transitions. [2024-10-12 23:38:31,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-12 23:38:31,399 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.366666666666666) internal successors, (161), 29 states have internal predecessors, (161), 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 75 [2024-10-12 23:38:31,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:38:31,400 INFO L225 Difference]: With dead ends: 660 [2024-10-12 23:38:31,400 INFO L226 Difference]: Without dead ends: 346 [2024-10-12 23:38:31,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=383, Invalid=1779, Unknown=0, NotChecked=0, Total=2162 [2024-10-12 23:38:31,402 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 146 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 23:38:31,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 147 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 23:38:31,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-10-12 23:38:31,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 313. [2024-10-12 23:38:31,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 312 states have (on average 1.2115384615384615) internal successors, (378), 312 states have internal predecessors, (378), 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-10-12 23:38:31,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 378 transitions. [2024-10-12 23:38:31,412 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 378 transitions. Word has length 75 [2024-10-12 23:38:31,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:38:31,412 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 378 transitions. [2024-10-12 23:38:31,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.366666666666666) internal successors, (161), 29 states have internal predecessors, (161), 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-10-12 23:38:31,413 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 378 transitions. [2024-10-12 23:38:31,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 23:38:31,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:38:31,414 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:38:31,433 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-10-12 23:38:31,617 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,SelfDestructingSolverStorable14 [2024-10-12 23:38:31,618 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:38:31,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:38:31,618 INFO L85 PathProgramCache]: Analyzing trace with hash 194986318, now seen corresponding path program 1 times [2024-10-12 23:38:31,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:38:31,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855924734] [2024-10-12 23:38:31,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:31,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:38:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:38:32,503 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 54 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 23:38:32,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:38:32,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855924734] [2024-10-12 23:38:32,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855924734] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 23:38:32,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445414275] [2024-10-12 23:38:32,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:32,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:38:32,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:38:32,505 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-10-12 23:38:32,506 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-10-12 23:38:32,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:38:32,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-10-12 23:38:32,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:38:33,216 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 54 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 23:38:33,216 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:38:34,854 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 54 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 23:38:34,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445414275] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:38:34,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 23:38:34,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 14] total 34 [2024-10-12 23:38:34,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563402108] [2024-10-12 23:38:34,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 23:38:34,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-12 23:38:34,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:38:34,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-12 23:38:34,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1018, Unknown=0, NotChecked=0, Total=1190 [2024-10-12 23:38:34,857 INFO L87 Difference]: Start difference. First operand 313 states and 378 transitions. Second operand has 35 states, 35 states have (on average 4.571428571428571) internal successors, (160), 34 states have internal predecessors, (160), 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-10-12 23:38:35,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:38:35,282 INFO L93 Difference]: Finished difference Result 779 states and 931 transitions. [2024-10-12 23:38:35,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 23:38:35,283 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 4.571428571428571) internal successors, (160), 34 states have internal predecessors, (160), 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 76 [2024-10-12 23:38:35,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:38:35,285 INFO L225 Difference]: With dead ends: 779 [2024-10-12 23:38:35,285 INFO L226 Difference]: Without dead ends: 475 [2024-10-12 23:38:35,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=182, Invalid=1078, Unknown=0, NotChecked=0, Total=1260 [2024-10-12 23:38:35,287 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 63 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 23:38:35,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 162 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 23:38:35,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-10-12 23:38:35,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 313. [2024-10-12 23:38:35,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 312 states have (on average 1.2115384615384615) internal successors, (378), 312 states have internal predecessors, (378), 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-10-12 23:38:35,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 378 transitions. [2024-10-12 23:38:35,300 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 378 transitions. Word has length 76 [2024-10-12 23:38:35,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:38:35,301 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 378 transitions. [2024-10-12 23:38:35,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.571428571428571) internal successors, (160), 34 states have internal predecessors, (160), 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-10-12 23:38:35,301 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 378 transitions. [2024-10-12 23:38:35,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 23:38:35,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:38:35,302 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:38:35,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-12 23:38:35,502 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,SelfDestructingSolverStorable15 [2024-10-12 23:38:35,503 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:38:35,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:38:35,503 INFO L85 PathProgramCache]: Analyzing trace with hash -619170465, now seen corresponding path program 1 times [2024-10-12 23:38:35,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:38:35,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257300679] [2024-10-12 23:38:35,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:35,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:38:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:38:36,907 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 42 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:36,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:38:36,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257300679] [2024-10-12 23:38:36,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257300679] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 23:38:36,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479828985] [2024-10-12 23:38:36,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:36,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:38:36,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:38:36,909 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 23:38:36,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-12 23:38:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:38:37,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 110 conjuncts are in the unsatisfiable core [2024-10-12 23:38:37,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:38:37,978 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 33 proven. 45 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 23:38:37,979 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:38:52,785 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:38:52,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479828985] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:38:52,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 23:38:52,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 25] total 55 [2024-10-12 23:38:52,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756679874] [2024-10-12 23:38:52,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 23:38:52,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-10-12 23:38:52,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:38:52,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-10-12 23:38:52,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=2729, Unknown=0, NotChecked=0, Total=3080 [2024-10-12 23:38:52,788 INFO L87 Difference]: Start difference. First operand 313 states and 378 transitions. Second operand has 56 states, 56 states have (on average 3.9107142857142856) internal successors, (219), 55 states have internal predecessors, (219), 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-10-12 23:38:55,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:38:55,239 INFO L93 Difference]: Finished difference Result 720 states and 869 transitions. [2024-10-12 23:38:55,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-12 23:38:55,240 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 3.9107142857142856) internal successors, (219), 55 states have internal predecessors, (219), 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 76 [2024-10-12 23:38:55,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:38:55,242 INFO L225 Difference]: With dead ends: 720 [2024-10-12 23:38:55,242 INFO L226 Difference]: Without dead ends: 416 [2024-10-12 23:38:55,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2230 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=910, Invalid=6230, Unknown=0, NotChecked=0, Total=7140 [2024-10-12 23:38:55,244 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 225 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 23:38:55,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 226 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1310 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 23:38:55,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-10-12 23:38:55,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 412. [2024-10-12 23:38:55,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.2141119221411192) internal successors, (499), 411 states have internal predecessors, (499), 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-10-12 23:38:55,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 499 transitions. [2024-10-12 23:38:55,257 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 499 transitions. Word has length 76 [2024-10-12 23:38:55,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:38:55,257 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 499 transitions. [2024-10-12 23:38:55,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 3.9107142857142856) internal successors, (219), 55 states have internal predecessors, (219), 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-10-12 23:38:55,257 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 499 transitions. [2024-10-12 23:38:55,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 23:38:55,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:38:55,259 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] [2024-10-12 23:38:55,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-12 23:38:55,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-12 23:38:55,459 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:38:55,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:38:55,460 INFO L85 PathProgramCache]: Analyzing trace with hash 324327930, now seen corresponding path program 2 times [2024-10-12 23:38:55,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:38:55,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042934820] [2024-10-12 23:38:55,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:38:55,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:38:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:38:55,551 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 23:38:55,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:38:55,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 23:38:55,687 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 23:38:55,688 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 23:38:55,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 23:38:55,694 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:38:55,745 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 23:38:55,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 11:38:55 BoogieIcfgContainer [2024-10-12 23:38:55,748 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 23:38:55,749 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 23:38:55,749 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 23:38:55,749 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 23:38:55,749 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:38:05" (3/4) ... [2024-10-12 23:38:55,751 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 23:38:55,752 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 23:38:55,754 INFO L158 Benchmark]: Toolchain (without parser) took 51274.79ms. Allocated memory was 146.8MB in the beginning and 648.0MB in the end (delta: 501.2MB). Free memory was 119.3MB in the beginning and 236.3MB in the end (delta: -117.0MB). Peak memory consumption was 385.3MB. Max. memory is 16.1GB. [2024-10-12 23:38:55,754 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:38:55,755 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.78ms. Allocated memory is still 146.8MB. Free memory was 118.3MB in the beginning and 105.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 23:38:55,755 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.30ms. Allocated memory is still 146.8MB. Free memory was 105.7MB in the beginning and 101.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 23:38:55,755 INFO L158 Benchmark]: Boogie Preprocessor took 77.76ms. Allocated memory is still 146.8MB. Free memory was 101.6MB in the beginning and 98.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 23:38:55,755 INFO L158 Benchmark]: RCFGBuilder took 534.78ms. Allocated memory is still 146.8MB. Free memory was 98.5MB in the beginning and 74.3MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-12 23:38:55,756 INFO L158 Benchmark]: TraceAbstraction took 50309.52ms. Allocated memory was 146.8MB in the beginning and 648.0MB in the end (delta: 501.2MB). Free memory was 73.3MB in the beginning and 236.3MB in the end (delta: -163.0MB). Peak memory consumption was 339.1MB. Max. memory is 16.1GB. [2024-10-12 23:38:55,756 INFO L158 Benchmark]: Witness Printer took 3.60ms. Allocated memory is still 648.0MB. Free memory is still 236.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:38:55,757 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.19ms. Allocated memory is still 109.1MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.78ms. Allocated memory is still 146.8MB. Free memory was 118.3MB in the beginning and 105.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.30ms. Allocated memory is still 146.8MB. Free memory was 105.7MB in the beginning and 101.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.76ms. Allocated memory is still 146.8MB. Free memory was 101.6MB in the beginning and 98.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 534.78ms. Allocated memory is still 146.8MB. Free memory was 98.5MB in the beginning and 74.3MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 50309.52ms. Allocated memory was 146.8MB in the beginning and 648.0MB in the end (delta: 501.2MB). Free memory was 73.3MB in the beginning and 236.3MB in the end (delta: -163.0MB). Peak memory consumption was 339.1MB. Max. memory is 16.1GB. * Witness Printer took 3.60ms. Allocated memory is still 648.0MB. Free memory is still 236.3MB. 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, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 50.2s, OverallIterations: 18, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1968 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1968 mSDsluCounter, 2948 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2504 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6967 IncrementalHoareTripleChecker+Invalid, 7054 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 444 mSDtfsCounter, 6967 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1321 GetRequests, 858 SyntacticMatches, 3 SemanticMatches, 460 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6562 ImplicationChecksByTransitivity, 13.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=412occurred in iteration=17, InterpolantAutomatonStates: 267, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 476 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 36.0s InterpolantComputationTime, 1307 NumberOfCodeBlocks, 1307 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1716 ConstructedInterpolants, 0 QuantifiedInterpolants, 31566 SizeOfPredicates, 60 NumberOfNonLiveVariables, 2744 ConjunctsInSsa, 661 ConjunctsInUnsatCore, 37 InterpolantComputations, 7 PerfectInterpolantSequences, 674/1154 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-10-12 23:38:55,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- 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/current/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 /storage/repos/ultimate/releaseScripts/default/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.dk.eval-mul-div-a046e57-m [2024-10-12 23:38:57,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:38:58,051 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-12 23:38:58,058 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:38:58,060 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:38:58,092 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:38:58,095 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:38:58,095 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:38:58,095 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:38:58,096 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:38:58,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:38:58,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:38:58,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:38:58,098 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:38:58,098 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:38:58,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:38:58,099 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:38:58,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:38:58,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:38:58,100 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:38:58,100 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:38:58,104 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-12 23:38:58,105 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-12 23:38:58,105 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:38:58,105 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-12 23:38:58,105 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:38:58,105 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:38:58,106 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:38:58,106 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:38:58,107 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:38:58,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:38:58,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:38:58,108 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:38:58,108 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:38:58,109 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:38:58,109 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-12 23:38:58,109 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-12 23:38:58,109 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:38:58,109 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:38:58,109 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:38:58,110 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:38:58,110 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-12 23:38:58,111 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-10-12 23:38:58,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:38:58,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:38:58,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:38:58,447 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:38:58,447 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:38:58,448 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c [2024-10-12 23:39:00,067 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:39:00,277 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:39:00,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c [2024-10-12 23:39:00,291 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d9f12a4d/01c3d58746244ef1a5eccbb153d89c7c/FLAGdc59b98ef [2024-10-12 23:39:00,310 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d9f12a4d/01c3d58746244ef1a5eccbb153d89c7c [2024-10-12 23:39:00,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:39:00,314 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:39:00,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:39:00,316 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:39:00,322 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:39:00,322 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:39:00" (1/1) ... [2024-10-12 23:39:00,323 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f2d0e92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:00, skipping insertion in model container [2024-10-12 23:39:00,323 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:39:00" (1/1) ... [2024-10-12 23:39:00,348 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:39:00,559 WARN L248 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-10-12 23:39:00,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:39:00,609 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:39:00,620 WARN L248 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-10-12 23:39:00,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:39:00,661 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:39:00,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:00 WrapperNode [2024-10-12 23:39:00,662 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:39:00,663 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:39:00,664 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:39:00,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:39:00,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:00" (1/1) ... [2024-10-12 23:39:00,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:00" (1/1) ... [2024-10-12 23:39:00,702 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2024-10-12 23:39:00,702 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:39:00,703 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:39:00,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:39:00,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:39:00,714 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:00" (1/1) ... [2024-10-12 23:39:00,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:00" (1/1) ... [2024-10-12 23:39:00,716 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:00" (1/1) ... [2024-10-12 23:39:00,731 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-10-12 23:39:00,732 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:00" (1/1) ... [2024-10-12 23:39:00,732 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:00" (1/1) ... [2024-10-12 23:39:00,738 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:00" (1/1) ... [2024-10-12 23:39:00,745 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:00" (1/1) ... [2024-10-12 23:39:00,747 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:00" (1/1) ... [2024-10-12 23:39:00,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:00" (1/1) ... [2024-10-12 23:39:00,752 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:39:00,757 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:39:00,757 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:39:00,757 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:39:00,758 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:00" (1/1) ... [2024-10-12 23:39:00,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:39:00,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:39:00,791 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-10-12 23:39:00,798 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-10-12 23:39:00,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:39:00,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-12 23:39:00,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:39:00,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:39:00,949 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:39:00,953 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:39:01,147 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-12 23:39:01,147 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:39:01,193 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:39:01,193 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:39:01,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:39:01 BoogieIcfgContainer [2024-10-12 23:39:01,194 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:39:01,197 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:39:01,197 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:39:01,200 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:39:01,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:39:00" (1/3) ... [2024-10-12 23:39:01,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd00a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:39:01, skipping insertion in model container [2024-10-12 23:39:01,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:39:00" (2/3) ... [2024-10-12 23:39:01,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd00a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:39:01, skipping insertion in model container [2024-10-12 23:39:01,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:39:01" (3/3) ... [2024-10-12 23:39:01,203 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.twocount2.c [2024-10-12 23:39:01,220 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:39:01,220 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:39:01,282 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:39:01,289 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;@4307b102, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:39:01,289 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:39:01,295 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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-10-12 23:39:01,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-12 23:39:01,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:39:01,302 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-12 23:39:01,303 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:39:01,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:39:01,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-12 23:39:01,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:39:01,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485541774] [2024-10-12 23:39:01,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:39:01,322 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-10-12 23:39:01,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:39:01,326 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-10-12 23:39:01,327 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-10-12 23:39:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:39:01,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-12 23:39:01,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:39:01,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:39:01,594 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 23:39:01,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:39:01,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485541774] [2024-10-12 23:39:01,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485541774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:39:01,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:39:01,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 23:39:01,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726600942] [2024-10-12 23:39:01,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:39:01,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:39:01,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:39:01,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:39:01,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:39:01,631 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-12 23:39:01,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:39:01,689 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-12 23:39:01,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:39:01,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-10-12 23:39:01,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:39:01,701 INFO L225 Difference]: With dead ends: 15 [2024-10-12 23:39:01,701 INFO L226 Difference]: Without dead ends: 9 [2024-10-12 23:39:01,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-12 23:39:01,709 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:39:01,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:39:01,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-12 23:39:01,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-12 23:39:01,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-10-12 23:39:01,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-12 23:39:01,737 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-12 23:39:01,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:39:01,738 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-12 23:39:01,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-12 23:39:01,739 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-12 23:39:01,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-12 23:39:01,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:39:01,740 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-12 23:39:01,743 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-10-12 23:39:01,943 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-10-12 23:39:01,943 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:39:01,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:39:01,944 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-12 23:39:01,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:39:01,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830878513] [2024-10-12 23:39:01,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:39:01,946 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-10-12 23:39:01,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:39:01,948 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-10-12 23:39:01,949 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-10-12 23:39:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:39:02,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-12 23:39:02,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:39:02,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:39:02,368 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:39:02,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:39:02,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:39:02,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830878513] [2024-10-12 23:39:02,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830878513] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:39:02,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 23:39:02,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-12 23:39:02,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993384814] [2024-10-12 23:39:02,652 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 23:39:02,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 23:39:02,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:39:02,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 23:39:02,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-12 23:39:02,657 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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-10-12 23:39:02,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:39:02,855 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2024-10-12 23:39:02,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 23:39:02,856 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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 7 [2024-10-12 23:39:02,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:39:02,856 INFO L225 Difference]: With dead ends: 17 [2024-10-12 23:39:02,856 INFO L226 Difference]: Without dead ends: 15 [2024-10-12 23:39:02,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 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-10-12 23:39:02,858 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:39:02,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 11 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:39:02,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-12 23:39:02,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2024-10-12 23:39:02,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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-10-12 23:39:02,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-10-12 23:39:02,863 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2024-10-12 23:39:02,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:39:02,864 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-10-12 23:39:02,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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-10-12 23:39:02,864 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-10-12 23:39:02,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-12 23:39:02,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:39:02,865 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2024-10-12 23:39:02,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-12 23:39:03,067 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-10-12 23:39:03,068 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:39:03,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:39:03,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1748931734, now seen corresponding path program 2 times [2024-10-12 23:39:03,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:39:03,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512118582] [2024-10-12 23:39:03,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 23:39:03,070 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-10-12 23:39:03,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:39:03,073 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-10-12 23:39:03,074 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-10-12 23:39:03,162 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 23:39:03,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 23:39:03,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-12 23:39:03,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:39:04,314 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:39:04,316 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:39:11,268 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:39:11,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:39:11,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512118582] [2024-10-12 23:39:11,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1512118582] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:39:11,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 23:39:11,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-12 23:39:11,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228300295] [2024-10-12 23:39:11,269 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 23:39:11,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-12 23:39:11,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:39:11,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 23:39:11,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-10-12 23:39:11,271 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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-10-12 23:39:12,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:39:12,468 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2024-10-12 23:39:12,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 23:39:12,469 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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) Word has length 13 [2024-10-12 23:39:12,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:39:12,470 INFO L225 Difference]: With dead ends: 26 [2024-10-12 23:39:12,470 INFO L226 Difference]: Without dead ends: 24 [2024-10-12 23:39:12,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2024-10-12 23:39:12,472 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 10 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 23:39:12,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 17 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 23:39:12,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-12 23:39:12,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2024-10-12 23:39:12,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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-10-12 23:39:12,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2024-10-12 23:39:12,483 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 13 [2024-10-12 23:39:12,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:39:12,483 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2024-10-12 23:39:12,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 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-10-12 23:39:12,483 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2024-10-12 23:39:12,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-12 23:39:12,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:39:12,484 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1] [2024-10-12 23:39:12,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-12 23:39:12,684 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-10-12 23:39:12,685 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:39:12,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:39:12,685 INFO L85 PathProgramCache]: Analyzing trace with hash -986749902, now seen corresponding path program 3 times [2024-10-12 23:39:12,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:39:12,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827538853] [2024-10-12 23:39:12,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 23:39:12,686 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-10-12 23:39:12,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:39:12,689 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-10-12 23:39:12,690 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-10-12 23:39:12,822 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-10-12 23:39:12,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-12 23:39:12,823 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 23:39:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:39:12,972 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-12 23:39:12,975 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 23:39:12,976 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 23:39:12,984 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 (5)] Ended with exit code 0 [2024-10-12 23:39:13,178 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-10-12 23:39:13,181 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-10-12 23:39:13,217 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 23:39:13,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 11:39:13 BoogieIcfgContainer [2024-10-12 23:39:13,220 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 23:39:13,221 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 23:39:13,221 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 23:39:13,224 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 23:39:13,225 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:39:01" (3/4) ... [2024-10-12 23:39:13,226 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-12 23:39:13,303 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 23:39:13,303 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 23:39:13,304 INFO L158 Benchmark]: Toolchain (without parser) took 12990.20ms. Allocated memory was 60.8MB in the beginning and 270.5MB in the end (delta: 209.7MB). Free memory was 30.2MB in the beginning and 96.4MB in the end (delta: -66.2MB). Peak memory consumption was 145.2MB. Max. memory is 16.1GB. [2024-10-12 23:39:13,304 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 44.0MB. Free memory was 23.2MB in the beginning and 23.2MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:39:13,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.39ms. Allocated memory is still 60.8MB. Free memory was 30.1MB in the beginning and 32.7MB in the end (delta: -2.6MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2024-10-12 23:39:13,305 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.62ms. Allocated memory is still 60.8MB. Free memory was 32.7MB in the beginning and 30.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 23:39:13,305 INFO L158 Benchmark]: Boogie Preprocessor took 48.87ms. Allocated memory is still 60.8MB. Free memory was 30.9MB in the beginning and 28.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 23:39:13,305 INFO L158 Benchmark]: RCFGBuilder took 437.37ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 28.8MB in the beginning and 44.1MB in the end (delta: -15.4MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2024-10-12 23:39:13,306 INFO L158 Benchmark]: TraceAbstraction took 12023.69ms. Allocated memory was 75.5MB in the beginning and 270.5MB in the end (delta: 195.0MB). Free memory was 43.4MB in the beginning and 101.6MB in the end (delta: -58.2MB). Peak memory consumption was 136.8MB. Max. memory is 16.1GB. [2024-10-12 23:39:13,306 INFO L158 Benchmark]: Witness Printer took 82.48ms. Allocated memory is still 270.5MB. Free memory was 101.6MB in the beginning and 96.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 23:39:13,308 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 44.0MB. Free memory was 23.2MB in the beginning and 23.2MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.39ms. Allocated memory is still 60.8MB. Free memory was 30.1MB in the beginning and 32.7MB in the end (delta: -2.6MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.62ms. Allocated memory is still 60.8MB. Free memory was 32.7MB in the beginning and 30.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.87ms. Allocated memory is still 60.8MB. Free memory was 30.9MB in the beginning and 28.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 437.37ms. Allocated memory was 60.8MB in the beginning and 75.5MB in the end (delta: 14.7MB). Free memory was 28.8MB in the beginning and 44.1MB in the end (delta: -15.4MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12023.69ms. Allocated memory was 75.5MB in the beginning and 270.5MB in the end (delta: 195.0MB). Free memory was 43.4MB in the beginning and 101.6MB in the end (delta: -58.2MB). Peak memory consumption was 136.8MB. Max. memory is 16.1GB. * Witness Printer took 82.48ms. Allocated memory is still 270.5MB. Free memory was 101.6MB in the beginning and 96.4MB in the end (delta: 5.2MB). 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, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.9s, 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, 34 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 109 IncrementalHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 6 mSDtfsCounter, 109 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred 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, 8.8s InterpolantComputationTime, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 39 ConstructedInterpolants, 17 QuantifiedInterpolants, 8556 SizeOfPredicates, 17 NumberOfNonLiveVariables, 163 ConjunctsInSsa, 55 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-10-12 23:39:13,351 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