./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.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 927306cfdb34082f032dbe87a24c6d688e2dda4e8fb165835d54bffc8f03e27e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 10:53:44,640 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 10:53:44,676 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-16 10:53:44,679 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 10:53:44,679 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 10:53:44,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 10:53:44,695 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 10:53:44,695 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 10:53:44,695 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 10:53:44,695 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 10:53:44,696 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 10:53:44,696 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 10:53:44,696 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 10:53:44,696 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 10:53:44,697 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 10:53:44,697 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 10:53:44,697 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 10:53:44,698 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 10:53:44,698 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 10:53:44,698 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 10:53:44,698 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 10:53:44,699 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 10:53:44,699 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 10:53:44,699 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 10:53:44,699 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 10:53:44,699 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 10:53:44,700 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 10:53:44,700 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 10:53:44,700 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 10:53:44,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:53:44,701 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 10:53:44,701 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 10:53:44,701 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 10:53:44,701 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 10:53:44,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 10:53:44,701 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 10:53:44,701 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 10:53:44,702 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 10:53:44,702 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 10:53:44,702 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 -> 927306cfdb34082f032dbe87a24c6d688e2dda4e8fb165835d54bffc8f03e27e [2024-11-16 10:53:44,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 10:53:44,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 10:53:44,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 10:53:44,918 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 10:53:44,919 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 10:53:44,920 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c [2024-11-16 10:53:46,279 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 10:53:46,449 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 10:53:46,449 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c [2024-11-16 10:53:46,456 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b68d04f3/57bc09d7447c495ab5e57a011308fe29/FLAG6dfc9c4a4 [2024-11-16 10:53:46,856 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b68d04f3/57bc09d7447c495ab5e57a011308fe29 [2024-11-16 10:53:46,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 10:53:46,860 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 10:53:46,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 10:53:46,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 10:53:46,866 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 10:53:46,867 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:53:46" (1/1) ... [2024-11-16 10:53:46,868 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10dea279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:46, skipping insertion in model container [2024-11-16 10:53:46,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:53:46" (1/1) ... [2024-11-16 10:53:46,887 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 10:53:47,025 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c[1250,1263] [2024-11-16 10:53:47,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:53:47,083 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 10:53:47,092 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c[1250,1263] [2024-11-16 10:53:47,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:53:47,132 INFO L204 MainTranslator]: Completed translation [2024-11-16 10:53:47,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:47 WrapperNode [2024-11-16 10:53:47,132 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 10:53:47,133 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 10:53:47,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 10:53:47,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 10:53:47,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:47" (1/1) ... [2024-11-16 10:53:47,150 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:47" (1/1) ... [2024-11-16 10:53:47,189 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 294 [2024-11-16 10:53:47,189 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 10:53:47,190 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 10:53:47,190 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 10:53:47,190 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 10:53:47,198 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:47" (1/1) ... [2024-11-16 10:53:47,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:47" (1/1) ... [2024-11-16 10:53:47,206 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:47" (1/1) ... [2024-11-16 10:53:47,227 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 10:53:47,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:47" (1/1) ... [2024-11-16 10:53:47,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:47" (1/1) ... [2024-11-16 10:53:47,238 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:47" (1/1) ... [2024-11-16 10:53:47,240 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:47" (1/1) ... [2024-11-16 10:53:47,243 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:47" (1/1) ... [2024-11-16 10:53:47,245 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:47" (1/1) ... [2024-11-16 10:53:47,251 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 10:53:47,251 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 10:53:47,252 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 10:53:47,252 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 10:53:47,252 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:47" (1/1) ... [2024-11-16 10:53:47,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:53:47,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:53:47,282 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 10:53:47,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 10:53:47,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 10:53:47,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 10:53:47,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 10:53:47,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 10:53:47,408 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 10:53:47,410 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 10:53:47,790 INFO L? ?]: Removed 168 outVars from TransFormulas that were not future-live. [2024-11-16 10:53:47,790 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 10:53:47,814 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 10:53:47,814 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-16 10:53:47,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:53:47 BoogieIcfgContainer [2024-11-16 10:53:47,815 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 10:53:47,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 10:53:47,816 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 10:53:47,819 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 10:53:47,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:53:46" (1/3) ... [2024-11-16 10:53:47,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56cc267d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:53:47, skipping insertion in model container [2024-11-16 10:53:47,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:47" (2/3) ... [2024-11-16 10:53:47,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56cc267d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:53:47, skipping insertion in model container [2024-11-16 10:53:47,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:53:47" (3/3) ... [2024-11-16 10:53:47,821 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.diagonal_v.c [2024-11-16 10:53:47,833 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 10:53:47,833 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 10:53:47,889 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 10:53:47,894 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;@73e57022, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 10:53:47,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 10:53:47,899 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 81 states have (on average 1.4567901234567902) internal successors, (118), 82 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:47,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-16 10:53:47,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:53:47,907 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:53:47,907 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:53:47,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:53:47,911 INFO L85 PathProgramCache]: Analyzing trace with hash -983629777, now seen corresponding path program 1 times [2024-11-16 10:53:47,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:53:47,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116788935] [2024-11-16 10:53:47,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:53:47,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:53:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:53:48,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:53:48,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:53:48,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116788935] [2024-11-16 10:53:48,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116788935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:53:48,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:53:48,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:53:48,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960383270] [2024-11-16 10:53:48,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:53:48,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:53:48,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:53:48,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:53:48,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:53:48,280 INFO L87 Difference]: Start difference. First operand has 83 states, 81 states have (on average 1.4567901234567902) internal successors, (118), 82 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-11-16 10:53:48,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:53:48,363 INFO L93 Difference]: Finished difference Result 153 states and 221 transitions. [2024-11-16 10:53:48,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:53:48,365 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-11-16 10:53:48,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:53:48,370 INFO L225 Difference]: With dead ends: 153 [2024-11-16 10:53:48,371 INFO L226 Difference]: Without dead ends: 80 [2024-11-16 10:53:48,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:53:48,376 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:53:48,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 271 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:53:48,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-16 10:53:48,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-16 10:53:48,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 79 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:48,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2024-11-16 10:53:48,405 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 14 [2024-11-16 10:53:48,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:53:48,405 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2024-11-16 10:53:48,405 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-11-16 10:53:48,405 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2024-11-16 10:53:48,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-16 10:53:48,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:53:48,406 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:53:48,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 10:53:48,407 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:53:48,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:53:48,407 INFO L85 PathProgramCache]: Analyzing trace with hash -282698544, now seen corresponding path program 1 times [2024-11-16 10:53:48,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:53:48,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158372117] [2024-11-16 10:53:48,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:53:48,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:53:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:53:48,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:53:48,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:53:48,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158372117] [2024-11-16 10:53:48,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158372117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:53:48,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:53:48,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:53:48,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928121457] [2024-11-16 10:53:48,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:53:48,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:53:48,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:53:48,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:53:48,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:53:48,521 INFO L87 Difference]: Start difference. First operand 80 states and 114 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-11-16 10:53:48,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:53:48,588 INFO L93 Difference]: Finished difference Result 152 states and 217 transitions. [2024-11-16 10:53:48,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:53:48,588 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-11-16 10:53:48,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:53:48,589 INFO L225 Difference]: With dead ends: 152 [2024-11-16 10:53:48,590 INFO L226 Difference]: Without dead ends: 82 [2024-11-16 10:53:48,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:53:48,592 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:53:48,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 268 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:53:48,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-16 10:53:48,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-16 10:53:48,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:48,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 116 transitions. [2024-11-16 10:53:48,598 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 116 transitions. Word has length 15 [2024-11-16 10:53:48,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:53:48,598 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 116 transitions. [2024-11-16 10:53:48,600 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-11-16 10:53:48,600 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 116 transitions. [2024-11-16 10:53:48,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-16 10:53:48,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:53:48,601 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:53:48,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 10:53:48,601 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:53:48,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:53:48,601 INFO L85 PathProgramCache]: Analyzing trace with hash -426476620, now seen corresponding path program 1 times [2024-11-16 10:53:48,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:53:48,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625932520] [2024-11-16 10:53:48,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:53:48,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:53:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:53:48,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:53:48,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:53:48,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625932520] [2024-11-16 10:53:48,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625932520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:53:48,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:53:48,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:53:48,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208507094] [2024-11-16 10:53:48,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:53:48,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:53:48,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:53:48,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:53:48,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:53:48,870 INFO L87 Difference]: Start difference. First operand 82 states and 116 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:48,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:53:48,981 INFO L93 Difference]: Finished difference Result 211 states and 300 transitions. [2024-11-16 10:53:48,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 10:53:48,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-16 10:53:48,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:53:48,983 INFO L225 Difference]: With dead ends: 211 [2024-11-16 10:53:48,984 INFO L226 Difference]: Without dead ends: 139 [2024-11-16 10:53:48,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 10:53:48,985 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 88 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:53:48,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 320 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:53:48,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-16 10:53:48,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 84. [2024-11-16 10:53:48,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.4216867469879517) internal successors, (118), 83 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:48,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 118 transitions. [2024-11-16 10:53:48,995 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 118 transitions. Word has length 16 [2024-11-16 10:53:48,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:53:48,995 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 118 transitions. [2024-11-16 10:53:48,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:48,995 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 118 transitions. [2024-11-16 10:53:48,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-16 10:53:48,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:53:48,999 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:53:48,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 10:53:48,999 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:53:48,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:53:48,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1366748936, now seen corresponding path program 1 times [2024-11-16 10:53:48,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:53:49,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017905364] [2024-11-16 10:53:49,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:53:49,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:53:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:53:49,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:53:49,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:53:49,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017905364] [2024-11-16 10:53:49,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017905364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:53:49,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:53:49,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:53:49,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785543590] [2024-11-16 10:53:49,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:53:49,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:53:49,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:53:49,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:53:49,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:53:49,316 INFO L87 Difference]: Start difference. First operand 84 states and 118 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:49,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:53:49,400 INFO L93 Difference]: Finished difference Result 156 states and 220 transitions. [2024-11-16 10:53:49,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:53:49,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 51 [2024-11-16 10:53:49,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:53:49,401 INFO L225 Difference]: With dead ends: 156 [2024-11-16 10:53:49,401 INFO L226 Difference]: Without dead ends: 84 [2024-11-16 10:53:49,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:53:49,402 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 97 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:53:49,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 133 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:53:49,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-16 10:53:49,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-16 10:53:49,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 83 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:49,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 117 transitions. [2024-11-16 10:53:49,407 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 117 transitions. Word has length 51 [2024-11-16 10:53:49,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:53:49,407 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 117 transitions. [2024-11-16 10:53:49,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:49,408 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 117 transitions. [2024-11-16 10:53:49,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-16 10:53:49,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:53:49,409 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:53:49,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 10:53:49,409 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:53:49,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:53:49,410 INFO L85 PathProgramCache]: Analyzing trace with hash 2126167949, now seen corresponding path program 1 times [2024-11-16 10:53:49,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:53:49,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978753606] [2024-11-16 10:53:49,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:53:49,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:53:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:53:49,657 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:53:49,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:53:49,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978753606] [2024-11-16 10:53:49,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978753606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:53:49,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:53:49,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 10:53:49,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463045070] [2024-11-16 10:53:49,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:53:49,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 10:53:49,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:53:49,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 10:53:49,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 10:53:49,668 INFO L87 Difference]: Start difference. First operand 84 states and 117 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:49,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:53:49,845 INFO L93 Difference]: Finished difference Result 211 states and 296 transitions. [2024-11-16 10:53:49,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 10:53:49,845 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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 52 [2024-11-16 10:53:49,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:53:49,846 INFO L225 Difference]: With dead ends: 211 [2024-11-16 10:53:49,846 INFO L226 Difference]: Without dead ends: 139 [2024-11-16 10:53:49,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-16 10:53:49,847 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 305 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:53:49,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 232 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:53:49,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-16 10:53:49,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 105. [2024-11-16 10:53:49,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:49,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 144 transitions. [2024-11-16 10:53:49,853 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 144 transitions. Word has length 52 [2024-11-16 10:53:49,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:53:49,853 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 144 transitions. [2024-11-16 10:53:49,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:49,853 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 144 transitions. [2024-11-16 10:53:49,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-16 10:53:49,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:53:49,854 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:53:49,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 10:53:49,855 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:53:49,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:53:49,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1535619056, now seen corresponding path program 1 times [2024-11-16 10:53:49,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:53:49,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734597230] [2024-11-16 10:53:49,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:53:49,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:53:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:53:50,103 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:53:50,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:53:50,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734597230] [2024-11-16 10:53:50,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734597230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:53:50,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:53:50,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:53:50,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585896829] [2024-11-16 10:53:50,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:53:50,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:53:50,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:53:50,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:53:50,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:53:50,106 INFO L87 Difference]: Start difference. First operand 105 states and 144 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:50,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:53:50,237 INFO L93 Difference]: Finished difference Result 211 states and 295 transitions. [2024-11-16 10:53:50,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 10:53:50,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-11-16 10:53:50,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:53:50,238 INFO L225 Difference]: With dead ends: 211 [2024-11-16 10:53:50,238 INFO L226 Difference]: Without dead ends: 139 [2024-11-16 10:53:50,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 10:53:50,239 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 247 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:53:50,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 180 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:53:50,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-16 10:53:50,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 106. [2024-11-16 10:53:50,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.380952380952381) internal successors, (145), 105 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:50,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 145 transitions. [2024-11-16 10:53:50,251 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 145 transitions. Word has length 53 [2024-11-16 10:53:50,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:53:50,251 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 145 transitions. [2024-11-16 10:53:50,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:50,251 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 145 transitions. [2024-11-16 10:53:50,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-16 10:53:50,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:53:50,256 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:53:50,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 10:53:50,256 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:53:50,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:53:50,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1150739448, now seen corresponding path program 1 times [2024-11-16 10:53:50,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:53:50,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135750442] [2024-11-16 10:53:50,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:53:50,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:53:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:53:50,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:53:50,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:53:50,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135750442] [2024-11-16 10:53:50,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135750442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:53:50,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:53:50,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 10:53:50,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149255] [2024-11-16 10:53:50,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:53:50,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 10:53:50,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:53:50,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 10:53:50,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 10:53:50,530 INFO L87 Difference]: Start difference. First operand 106 states and 145 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:50,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:53:50,708 INFO L93 Difference]: Finished difference Result 241 states and 336 transitions. [2024-11-16 10:53:50,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 10:53:50,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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-11-16 10:53:50,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:53:50,710 INFO L225 Difference]: With dead ends: 241 [2024-11-16 10:53:50,711 INFO L226 Difference]: Without dead ends: 110 [2024-11-16 10:53:50,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-16 10:53:50,712 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 72 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:53:50,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 571 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:53:50,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-16 10:53:50,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2024-11-16 10:53:50,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.3738317757009346) internal successors, (147), 107 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-11-16 10:53:50,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 147 transitions. [2024-11-16 10:53:50,723 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 147 transitions. Word has length 54 [2024-11-16 10:53:50,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:53:50,723 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 147 transitions. [2024-11-16 10:53:50,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:50,724 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 147 transitions. [2024-11-16 10:53:50,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-16 10:53:50,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:53:50,725 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:53:50,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 10:53:50,725 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:53:50,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:53:50,725 INFO L85 PathProgramCache]: Analyzing trace with hash -532282913, now seen corresponding path program 1 times [2024-11-16 10:53:50,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:53:50,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858846918] [2024-11-16 10:53:50,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:53:50,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:53:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:53:51,211 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:53:51,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:53:51,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858846918] [2024-11-16 10:53:51,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858846918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:53:51,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:53:51,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 10:53:51,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536725951] [2024-11-16 10:53:51,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:53:51,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 10:53:51,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:53:51,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 10:53:51,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 10:53:51,214 INFO L87 Difference]: Start difference. First operand 108 states and 147 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:51,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:53:51,477 INFO L93 Difference]: Finished difference Result 284 states and 394 transitions. [2024-11-16 10:53:51,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 10:53:51,477 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-16 10:53:51,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:53:51,478 INFO L225 Difference]: With dead ends: 284 [2024-11-16 10:53:51,478 INFO L226 Difference]: Without dead ends: 210 [2024-11-16 10:53:51,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-16 10:53:51,479 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 122 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:53:51,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 698 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:53:51,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-16 10:53:51,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 131. [2024-11-16 10:53:51,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.376923076923077) internal successors, (179), 130 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:51,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 179 transitions. [2024-11-16 10:53:51,489 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 179 transitions. Word has length 55 [2024-11-16 10:53:51,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:53:51,489 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 179 transitions. [2024-11-16 10:53:51,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:51,489 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 179 transitions. [2024-11-16 10:53:51,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-16 10:53:51,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:53:51,490 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:53:51,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 10:53:51,490 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:53:51,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:53:51,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1319409971, now seen corresponding path program 1 times [2024-11-16 10:53:51,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:53:51,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435476457] [2024-11-16 10:53:51,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:53:51,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:53:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:53:51,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:53:51,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:53:51,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435476457] [2024-11-16 10:53:51,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435476457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:53:51,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:53:51,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 10:53:51,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263368606] [2024-11-16 10:53:51,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:53:51,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 10:53:51,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:53:51,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 10:53:51,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 10:53:51,836 INFO L87 Difference]: Start difference. First operand 131 states and 179 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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-11-16 10:53:51,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:53:51,864 INFO L93 Difference]: Finished difference Result 228 states and 314 transitions. [2024-11-16 10:53:51,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 10:53:51,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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) Word has length 56 [2024-11-16 10:53:51,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:53:51,868 INFO L225 Difference]: With dead ends: 228 [2024-11-16 10:53:51,868 INFO L226 Difference]: Without dead ends: 131 [2024-11-16 10:53:51,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 10:53:51,868 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 2 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 10:53:51,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 175 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 10:53:51,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-16 10:53:51,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-16 10:53:51,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.3615384615384616) internal successors, (177), 130 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:51,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 177 transitions. [2024-11-16 10:53:51,875 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 177 transitions. Word has length 56 [2024-11-16 10:53:51,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:53:51,875 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 177 transitions. [2024-11-16 10:53:51,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 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-11-16 10:53:51,875 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 177 transitions. [2024-11-16 10:53:51,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-16 10:53:51,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:53:51,876 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:53:51,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 10:53:51,876 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:53:51,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:53:51,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1215068545, now seen corresponding path program 1 times [2024-11-16 10:53:51,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:53:51,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615477230] [2024-11-16 10:53:51,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:53:51,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:53:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:53:52,152 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:53:52,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:53:52,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615477230] [2024-11-16 10:53:52,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615477230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:53:52,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:53:52,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:53:52,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310682191] [2024-11-16 10:53:52,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:53:52,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:53:52,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:53:52,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:53:52,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:53:52,154 INFO L87 Difference]: Start difference. First operand 131 states and 177 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:52,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:53:52,242 INFO L93 Difference]: Finished difference Result 278 states and 381 transitions. [2024-11-16 10:53:52,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 10:53:52,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-16 10:53:52,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:53:52,243 INFO L225 Difference]: With dead ends: 278 [2024-11-16 10:53:52,243 INFO L226 Difference]: Without dead ends: 181 [2024-11-16 10:53:52,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 10:53:52,244 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 226 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:53:52,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 238 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:53:52,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-16 10:53:52,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 169. [2024-11-16 10:53:52,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.369047619047619) internal successors, (230), 168 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:52,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 230 transitions. [2024-11-16 10:53:52,250 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 230 transitions. Word has length 57 [2024-11-16 10:53:52,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:53:52,250 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 230 transitions. [2024-11-16 10:53:52,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:52,250 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 230 transitions. [2024-11-16 10:53:52,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-16 10:53:52,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:53:52,252 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:53:52,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 10:53:52,252 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:53:52,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:53:52,252 INFO L85 PathProgramCache]: Analyzing trace with hash -974531328, now seen corresponding path program 1 times [2024-11-16 10:53:52,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:53:52,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61532547] [2024-11-16 10:53:52,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:53:52,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:53:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:53:52,720 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:53:52,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:53:52,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61532547] [2024-11-16 10:53:52,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61532547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:53:52,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:53:52,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 10:53:52,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162187775] [2024-11-16 10:53:52,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:53:52,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 10:53:52,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:53:52,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 10:53:52,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 10:53:52,722 INFO L87 Difference]: Start difference. First operand 169 states and 230 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:52,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:53:52,921 INFO L93 Difference]: Finished difference Result 302 states and 410 transitions. [2024-11-16 10:53:52,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 10:53:52,921 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-16 10:53:52,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:53:52,922 INFO L225 Difference]: With dead ends: 302 [2024-11-16 10:53:52,923 INFO L226 Difference]: Without dead ends: 205 [2024-11-16 10:53:52,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-16 10:53:52,924 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 250 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:53:52,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 313 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:53:52,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-16 10:53:52,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 186. [2024-11-16 10:53:52,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.3567567567567567) internal successors, (251), 185 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:52,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 251 transitions. [2024-11-16 10:53:52,928 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 251 transitions. Word has length 57 [2024-11-16 10:53:52,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:53:52,928 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 251 transitions. [2024-11-16 10:53:52,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:52,929 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 251 transitions. [2024-11-16 10:53:52,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-16 10:53:52,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:53:52,929 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:53:52,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 10:53:52,929 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:53:52,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:53:52,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1399419475, now seen corresponding path program 1 times [2024-11-16 10:53:52,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:53:52,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502468252] [2024-11-16 10:53:52,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:53:52,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:53:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:53:53,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:53:53,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:53:53,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502468252] [2024-11-16 10:53:53,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502468252] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 10:53:53,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391588981] [2024-11-16 10:53:53,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:53:53,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 10:53:53,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:53:53,262 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 10:53:53,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 10:53:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:53:53,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-16 10:53:53,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:53:53,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:53:53,901 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 10:53:53,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391588981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:53:53,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 10:53:53,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 16 [2024-11-16 10:53:53,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557694569] [2024-11-16 10:53:53,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:53:53,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 10:53:53,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:53:53,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 10:53:53,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-11-16 10:53:53,903 INFO L87 Difference]: Start difference. First operand 186 states and 251 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:54,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:53:54,385 INFO L93 Difference]: Finished difference Result 418 states and 565 transitions. [2024-11-16 10:53:54,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 10:53:54,385 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-16 10:53:54,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:53:54,386 INFO L225 Difference]: With dead ends: 418 [2024-11-16 10:53:54,386 INFO L226 Difference]: Without dead ends: 274 [2024-11-16 10:53:54,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2024-11-16 10:53:54,387 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 354 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 10:53:54,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 272 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 10:53:54,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-16 10:53:54,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 189. [2024-11-16 10:53:54,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.3457446808510638) internal successors, (253), 188 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:54,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 253 transitions. [2024-11-16 10:53:54,391 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 253 transitions. Word has length 57 [2024-11-16 10:53:54,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:53:54,391 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 253 transitions. [2024-11-16 10:53:54,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:54,391 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 253 transitions. [2024-11-16 10:53:54,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-16 10:53:54,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:53:54,392 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:53:54,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 10:53:54,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-16 10:53:54,597 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:53:54,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:53:54,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1754100659, now seen corresponding path program 1 times [2024-11-16 10:53:54,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:53:54,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077881623] [2024-11-16 10:53:54,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:53:54,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:53:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:53:55,279 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:53:55,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:53:55,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077881623] [2024-11-16 10:53:55,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077881623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:53:55,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:53:55,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 10:53:55,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096605640] [2024-11-16 10:53:55,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:53:55,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 10:53:55,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:53:55,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 10:53:55,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-16 10:53:55,281 INFO L87 Difference]: Start difference. First operand 189 states and 253 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:55,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:53:55,475 INFO L93 Difference]: Finished difference Result 349 states and 467 transitions. [2024-11-16 10:53:55,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 10:53:55,476 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 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) Word has length 58 [2024-11-16 10:53:55,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:53:55,477 INFO L225 Difference]: With dead ends: 349 [2024-11-16 10:53:55,477 INFO L226 Difference]: Without dead ends: 232 [2024-11-16 10:53:55,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-16 10:53:55,478 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 202 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:53:55,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 273 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:53:55,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-16 10:53:55,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 216. [2024-11-16 10:53:55,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.3348837209302327) internal successors, (287), 215 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:55,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 287 transitions. [2024-11-16 10:53:55,482 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 287 transitions. Word has length 58 [2024-11-16 10:53:55,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:53:55,482 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 287 transitions. [2024-11-16 10:53:55,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:55,483 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 287 transitions. [2024-11-16 10:53:55,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-16 10:53:55,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:53:55,483 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:53:55,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 10:53:55,483 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:53:55,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:53:55,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1660294003, now seen corresponding path program 1 times [2024-11-16 10:53:55,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:53:55,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482390097] [2024-11-16 10:53:55,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:53:55,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:53:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:53:55,982 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:53:55,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:53:55,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482390097] [2024-11-16 10:53:55,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482390097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:53:55,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:53:55,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 10:53:55,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133354054] [2024-11-16 10:53:55,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:53:55,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 10:53:55,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:53:55,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 10:53:55,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 10:53:55,984 INFO L87 Difference]: Start difference. First operand 216 states and 287 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:56,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:53:56,151 INFO L93 Difference]: Finished difference Result 335 states and 451 transitions. [2024-11-16 10:53:56,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 10:53:56,151 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 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 59 [2024-11-16 10:53:56,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:53:56,153 INFO L225 Difference]: With dead ends: 335 [2024-11-16 10:53:56,153 INFO L226 Difference]: Without dead ends: 238 [2024-11-16 10:53:56,153 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-11-16 10:53:56,153 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 54 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:53:56,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 333 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:53:56,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-16 10:53:56,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 214. [2024-11-16 10:53:56,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 1.3474178403755868) internal successors, (287), 213 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:56,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 287 transitions. [2024-11-16 10:53:56,157 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 287 transitions. Word has length 59 [2024-11-16 10:53:56,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:53:56,158 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 287 transitions. [2024-11-16 10:53:56,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:56,158 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 287 transitions. [2024-11-16 10:53:56,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-16 10:53:56,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:53:56,158 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:53:56,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 10:53:56,159 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:53:56,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:53:56,159 INFO L85 PathProgramCache]: Analyzing trace with hash -302970909, now seen corresponding path program 1 times [2024-11-16 10:53:56,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:53:56,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540868553] [2024-11-16 10:53:56,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:53:56,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:53:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:53:56,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:53:56,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:53:56,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540868553] [2024-11-16 10:53:56,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540868553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:53:56,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:53:56,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 10:53:56,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002076363] [2024-11-16 10:53:56,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:53:56,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 10:53:56,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:53:56,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 10:53:56,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 10:53:56,400 INFO L87 Difference]: Start difference. First operand 214 states and 287 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:56,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:53:56,480 INFO L93 Difference]: Finished difference Result 396 states and 533 transitions. [2024-11-16 10:53:56,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 10:53:56,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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 59 [2024-11-16 10:53:56,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:53:56,481 INFO L225 Difference]: With dead ends: 396 [2024-11-16 10:53:56,482 INFO L226 Difference]: Without dead ends: 220 [2024-11-16 10:53:56,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-16 10:53:56,482 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 97 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:53:56,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 327 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:53:56,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-16 10:53:56,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2024-11-16 10:53:56,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 1.3378995433789955) internal successors, (293), 219 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:56,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 293 transitions. [2024-11-16 10:53:56,486 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 293 transitions. Word has length 59 [2024-11-16 10:53:56,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:53:56,486 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 293 transitions. [2024-11-16 10:53:56,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:56,486 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 293 transitions. [2024-11-16 10:53:56,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-16 10:53:56,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:53:56,487 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:53:56,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 10:53:56,487 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:53:56,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:53:56,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1252720514, now seen corresponding path program 1 times [2024-11-16 10:53:56,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:53:56,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494868035] [2024-11-16 10:53:56,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:53:56,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:53:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:53:57,328 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:53:57,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:53:57,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494868035] [2024-11-16 10:53:57,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494868035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:53:57,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:53:57,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 10:53:57,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601952878] [2024-11-16 10:53:57,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:53:57,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 10:53:57,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:53:57,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 10:53:57,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-16 10:53:57,330 INFO L87 Difference]: Start difference. First operand 220 states and 293 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:57,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:53:57,610 INFO L93 Difference]: Finished difference Result 342 states and 458 transitions. [2024-11-16 10:53:57,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 10:53:57,610 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-16 10:53:57,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:53:57,611 INFO L225 Difference]: With dead ends: 342 [2024-11-16 10:53:57,611 INFO L226 Difference]: Without dead ends: 224 [2024-11-16 10:53:57,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-16 10:53:57,612 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 117 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:53:57,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 490 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:53:57,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-16 10:53:57,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 220. [2024-11-16 10:53:57,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 1.3333333333333333) internal successors, (292), 219 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:57,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 292 transitions. [2024-11-16 10:53:57,616 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 292 transitions. Word has length 60 [2024-11-16 10:53:57,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:53:57,617 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 292 transitions. [2024-11-16 10:53:57,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:57,617 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 292 transitions. [2024-11-16 10:53:57,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-16 10:53:57,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:53:57,617 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:53:57,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 10:53:57,618 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:53:57,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:53:57,618 INFO L85 PathProgramCache]: Analyzing trace with hash 615305418, now seen corresponding path program 1 times [2024-11-16 10:53:57,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:53:57,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832518350] [2024-11-16 10:53:57,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:53:57,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:53:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:53:58,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:53:58,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:53:58,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832518350] [2024-11-16 10:53:58,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832518350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:53:58,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:53:58,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 10:53:58,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306115105] [2024-11-16 10:53:58,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:53:58,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 10:53:58,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:53:58,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 10:53:58,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-16 10:53:58,131 INFO L87 Difference]: Start difference. First operand 220 states and 292 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:58,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:53:58,414 INFO L93 Difference]: Finished difference Result 354 states and 474 transitions. [2024-11-16 10:53:58,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 10:53:58,415 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-16 10:53:58,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:53:58,416 INFO L225 Difference]: With dead ends: 354 [2024-11-16 10:53:58,416 INFO L226 Difference]: Without dead ends: 250 [2024-11-16 10:53:58,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-16 10:53:58,417 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 103 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:53:58,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 549 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:53:58,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-16 10:53:58,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2024-11-16 10:53:58,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 1.3279352226720649) internal successors, (328), 247 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:58,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 328 transitions. [2024-11-16 10:53:58,420 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 328 transitions. Word has length 60 [2024-11-16 10:53:58,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:53:58,421 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 328 transitions. [2024-11-16 10:53:58,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:58,421 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 328 transitions. [2024-11-16 10:53:58,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-16 10:53:58,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:53:58,421 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:53:58,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 10:53:58,421 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:53:58,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:53:58,422 INFO L85 PathProgramCache]: Analyzing trace with hash -891217853, now seen corresponding path program 1 times [2024-11-16 10:53:58,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:53:58,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535513764] [2024-11-16 10:53:58,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:53:58,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:53:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:53:58,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:53:58,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:53:58,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535513764] [2024-11-16 10:53:58,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535513764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:53:58,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:53:58,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:53:58,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467790620] [2024-11-16 10:53:58,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:53:58,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:53:58,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:53:58,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:53:58,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:53:58,694 INFO L87 Difference]: Start difference. First operand 248 states and 328 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:58,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:53:58,774 INFO L93 Difference]: Finished difference Result 391 states and 521 transitions. [2024-11-16 10:53:58,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 10:53:58,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-16 10:53:58,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:53:58,775 INFO L225 Difference]: With dead ends: 391 [2024-11-16 10:53:58,775 INFO L226 Difference]: Without dead ends: 209 [2024-11-16 10:53:58,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 10:53:58,776 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 53 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:53:58,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 313 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:53:58,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-16 10:53:58,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2024-11-16 10:53:58,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.3125) internal successors, (273), 208 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:58,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 273 transitions. [2024-11-16 10:53:58,780 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 273 transitions. Word has length 60 [2024-11-16 10:53:58,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:53:58,780 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 273 transitions. [2024-11-16 10:53:58,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:58,780 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 273 transitions. [2024-11-16 10:53:58,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-16 10:53:58,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:53:58,781 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:53:58,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 10:53:58,781 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:53:58,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:53:58,781 INFO L85 PathProgramCache]: Analyzing trace with hash 49131341, now seen corresponding path program 1 times [2024-11-16 10:53:58,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:53:58,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95380784] [2024-11-16 10:53:58,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:53:58,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:53:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:53:59,136 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:53:59,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:53:59,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95380784] [2024-11-16 10:53:59,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95380784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:53:59,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:53:59,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 10:53:59,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082457521] [2024-11-16 10:53:59,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:53:59,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 10:53:59,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:53:59,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 10:53:59,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 10:53:59,138 INFO L87 Difference]: Start difference. First operand 209 states and 273 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:59,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:53:59,272 INFO L93 Difference]: Finished difference Result 389 states and 519 transitions. [2024-11-16 10:53:59,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 10:53:59,273 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 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 61 [2024-11-16 10:53:59,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:53:59,274 INFO L225 Difference]: With dead ends: 389 [2024-11-16 10:53:59,274 INFO L226 Difference]: Without dead ends: 290 [2024-11-16 10:53:59,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-16 10:53:59,274 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 96 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:53:59,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 619 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:53:59,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-16 10:53:59,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 171. [2024-11-16 10:53:59,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.3) internal successors, (221), 170 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:59,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 221 transitions. [2024-11-16 10:53:59,278 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 221 transitions. Word has length 61 [2024-11-16 10:53:59,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:53:59,278 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 221 transitions. [2024-11-16 10:53:59,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:59,279 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 221 transitions. [2024-11-16 10:53:59,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-16 10:53:59,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:53:59,279 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:53:59,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 10:53:59,279 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:53:59,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:53:59,280 INFO L85 PathProgramCache]: Analyzing trace with hash 2085057745, now seen corresponding path program 1 times [2024-11-16 10:53:59,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:53:59,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235464576] [2024-11-16 10:53:59,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:53:59,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:53:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:53:59,413 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:53:59,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:53:59,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235464576] [2024-11-16 10:53:59,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235464576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:53:59,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:53:59,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:53:59,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472488128] [2024-11-16 10:53:59,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:53:59,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:53:59,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:53:59,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:53:59,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:53:59,415 INFO L87 Difference]: Start difference. First operand 171 states and 221 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:59,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:53:59,475 INFO L93 Difference]: Finished difference Result 300 states and 392 transitions. [2024-11-16 10:53:59,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:53:59,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-16 10:53:59,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:53:59,476 INFO L225 Difference]: With dead ends: 300 [2024-11-16 10:53:59,476 INFO L226 Difference]: Without dead ends: 175 [2024-11-16 10:53:59,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:53:59,477 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:53:59,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 327 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:53:59,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-16 10:53:59,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2024-11-16 10:53:59,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 1.293103448275862) internal successors, (225), 174 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:59,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 225 transitions. [2024-11-16 10:53:59,481 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 225 transitions. Word has length 62 [2024-11-16 10:53:59,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:53:59,481 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 225 transitions. [2024-11-16 10:53:59,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:59,481 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 225 transitions. [2024-11-16 10:53:59,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-16 10:53:59,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:53:59,481 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:53:59,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-16 10:53:59,482 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:53:59,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:53:59,482 INFO L85 PathProgramCache]: Analyzing trace with hash 850818642, now seen corresponding path program 1 times [2024-11-16 10:53:59,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:53:59,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067194108] [2024-11-16 10:53:59,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:53:59,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:53:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:53:59,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:53:59,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:53:59,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067194108] [2024-11-16 10:53:59,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067194108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:53:59,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:53:59,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 10:53:59,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969951950] [2024-11-16 10:53:59,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:53:59,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 10:53:59,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:53:59,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 10:53:59,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 10:53:59,784 INFO L87 Difference]: Start difference. First operand 175 states and 225 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:59,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:53:59,869 INFO L93 Difference]: Finished difference Result 259 states and 338 transitions. [2024-11-16 10:53:59,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 10:53:59,870 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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 63 [2024-11-16 10:53:59,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:53:59,871 INFO L225 Difference]: With dead ends: 259 [2024-11-16 10:53:59,871 INFO L226 Difference]: Without dead ends: 175 [2024-11-16 10:53:59,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 10:53:59,872 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 62 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:53:59,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 266 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:53:59,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-16 10:53:59,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2024-11-16 10:53:59,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 1.2816091954022988) internal successors, (223), 174 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:59,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 223 transitions. [2024-11-16 10:53:59,875 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 223 transitions. Word has length 63 [2024-11-16 10:53:59,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:53:59,875 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 223 transitions. [2024-11-16 10:53:59,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:59,875 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 223 transitions. [2024-11-16 10:53:59,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-16 10:53:59,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:53:59,876 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:53:59,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-16 10:53:59,876 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:53:59,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:53:59,876 INFO L85 PathProgramCache]: Analyzing trace with hash 2048648152, now seen corresponding path program 1 times [2024-11-16 10:53:59,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:53:59,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119422101] [2024-11-16 10:53:59,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:53:59,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:53:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:54:00,477 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:54:00,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:54:00,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119422101] [2024-11-16 10:54:00,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119422101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:54:00,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:54:00,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 10:54:00,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456776232] [2024-11-16 10:54:00,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:54:00,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 10:54:00,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:54:00,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 10:54:00,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-16 10:54:00,481 INFO L87 Difference]: Start difference. First operand 175 states and 223 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:54:00,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:54:00,668 INFO L93 Difference]: Finished difference Result 300 states and 383 transitions. [2024-11-16 10:54:00,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 10:54:00,669 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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 64 [2024-11-16 10:54:00,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:54:00,670 INFO L225 Difference]: With dead ends: 300 [2024-11-16 10:54:00,670 INFO L226 Difference]: Without dead ends: 204 [2024-11-16 10:54:00,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-16 10:54:00,671 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 86 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:54:00,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 510 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:54:00,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-16 10:54:00,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 202. [2024-11-16 10:54:00,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 1.2587064676616915) internal successors, (253), 201 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:54:00,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 253 transitions. [2024-11-16 10:54:00,675 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 253 transitions. Word has length 64 [2024-11-16 10:54:00,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:54:00,675 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 253 transitions. [2024-11-16 10:54:00,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:54:00,675 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 253 transitions. [2024-11-16 10:54:00,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-16 10:54:00,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:54:00,676 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:54:00,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-16 10:54:00,676 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:54:00,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:54:00,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1639553780, now seen corresponding path program 1 times [2024-11-16 10:54:00,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:54:00,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40241638] [2024-11-16 10:54:00,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:54:00,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:54:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:54:00,952 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:54:00,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:54:00,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40241638] [2024-11-16 10:54:00,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40241638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:54:00,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:54:00,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:54:00,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15818578] [2024-11-16 10:54:00,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:54:00,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:54:00,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:54:00,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:54:00,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:54:00,954 INFO L87 Difference]: Start difference. First operand 202 states and 253 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:54:01,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:54:01,017 INFO L93 Difference]: Finished difference Result 351 states and 438 transitions. [2024-11-16 10:54:01,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:54:01,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2024-11-16 10:54:01,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:54:01,018 INFO L225 Difference]: With dead ends: 351 [2024-11-16 10:54:01,018 INFO L226 Difference]: Without dead ends: 190 [2024-11-16 10:54:01,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:54:01,019 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 90 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:54:01,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 127 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:54:01,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-16 10:54:01,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-11-16 10:54:01,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 1.2328042328042328) internal successors, (233), 189 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:54:01,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 233 transitions. [2024-11-16 10:54:01,022 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 233 transitions. Word has length 64 [2024-11-16 10:54:01,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:54:01,022 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 233 transitions. [2024-11-16 10:54:01,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:54:01,023 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 233 transitions. [2024-11-16 10:54:01,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-16 10:54:01,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:54:01,024 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:54:01,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-16 10:54:01,025 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:54:01,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:54:01,025 INFO L85 PathProgramCache]: Analyzing trace with hash 391751496, now seen corresponding path program 1 times [2024-11-16 10:54:01,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:54:01,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729850415] [2024-11-16 10:54:01,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:54:01,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:54:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 10:54:01,103 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 10:54:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 10:54:01,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 10:54:01,193 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 10:54:01,193 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 10:54:01,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-16 10:54:01,197 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:54:01,243 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 10:54:01,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 10:54:01 BoogieIcfgContainer [2024-11-16 10:54:01,246 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 10:54:01,247 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 10:54:01,247 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 10:54:01,247 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 10:54:01,248 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:53:47" (3/4) ... [2024-11-16 10:54:01,250 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 10:54:01,251 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 10:54:01,253 INFO L158 Benchmark]: Toolchain (without parser) took 14391.91ms. Allocated memory was 169.9MB in the beginning and 564.1MB in the end (delta: 394.3MB). Free memory was 133.5MB in the beginning and 246.8MB in the end (delta: -113.4MB). Peak memory consumption was 280.8MB. Max. memory is 16.1GB. [2024-11-16 10:54:01,253 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 113.2MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 10:54:01,253 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.22ms. Allocated memory is still 169.9MB. Free memory was 132.5MB in the beginning and 116.7MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 10:54:01,253 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.92ms. Allocated memory is still 169.9MB. Free memory was 116.7MB in the beginning and 109.3MB in the end (delta: 7.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 10:54:01,253 INFO L158 Benchmark]: Boogie Preprocessor took 61.03ms. Allocated memory is still 169.9MB. Free memory was 109.3MB in the beginning and 105.3MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 10:54:01,254 INFO L158 Benchmark]: IcfgBuilder took 563.40ms. Allocated memory is still 169.9MB. Free memory was 105.1MB in the beginning and 61.2MB in the end (delta: 43.9MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-16 10:54:01,254 INFO L158 Benchmark]: TraceAbstraction took 13429.96ms. Allocated memory was 169.9MB in the beginning and 564.1MB in the end (delta: 394.3MB). Free memory was 60.1MB in the beginning and 247.9MB in the end (delta: -187.8MB). Peak memory consumption was 205.3MB. Max. memory is 16.1GB. [2024-11-16 10:54:01,254 INFO L158 Benchmark]: Witness Printer took 3.94ms. Allocated memory is still 564.1MB. Free memory was 247.9MB in the beginning and 246.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 10:54:01,254 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.15ms. Allocated memory is still 113.2MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.22ms. Allocated memory is still 169.9MB. Free memory was 132.5MB in the beginning and 116.7MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.92ms. Allocated memory is still 169.9MB. Free memory was 116.7MB in the beginning and 109.3MB in the end (delta: 7.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.03ms. Allocated memory is still 169.9MB. Free memory was 109.3MB in the beginning and 105.3MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 563.40ms. Allocated memory is still 169.9MB. Free memory was 105.1MB in the beginning and 61.2MB in the end (delta: 43.9MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 13429.96ms. Allocated memory was 169.9MB in the beginning and 564.1MB in the end (delta: 394.3MB). Free memory was 60.1MB in the beginning and 247.9MB in the end (delta: -187.8MB). Peak memory consumption was 205.3MB. Max. memory is 16.1GB. * Witness Printer took 3.94ms. Allocated memory is still 564.1MB. Free memory was 247.9MB in the beginning and 246.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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: 21]: 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 shiftRight at line 85, overapproximation of bitwiseOr at line 148, overapproximation of bitwiseAnd at line 161. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 4); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (4 - 1); [L32] const SORT_28 mask_SORT_28 = (SORT_28)-1 >> (sizeof(SORT_28) * 8 - 32); [L33] const SORT_28 msb_SORT_28 = (SORT_28)1 << (32 - 1); [L35] const SORT_4 var_5 = 1; [L36] const SORT_4 var_8 = 0; [L37] const SORT_1 var_15 = 1; [L38] const SORT_4 var_22 = 15; [L39] const SORT_28 var_30 = 1; [L41] SORT_1 input_2; [L42] SORT_1 input_3; [L44] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, var_15=1, var_22=15, var_30=1, var_5=1, var_8=0] [L44] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L45] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, var_15=1, var_22=15, var_30=1, var_5=1, var_8=0] [L45] SORT_4 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L47] SORT_4 init_7_arg_1 = var_5; [L48] state_6 = init_7_arg_1 [L49] SORT_4 init_10_arg_1 = var_8; [L50] state_9 = init_10_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L53] input_2 = __VERIFIER_nondet_uchar() [L54] input_3 = __VERIFIER_nondet_uchar() [L57] SORT_4 var_11_arg_0 = state_6; [L58] SORT_4 var_11_arg_1 = state_9; [L59] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L60] SORT_1 var_12_arg_0 = var_11; [L61] SORT_1 var_12 = ~var_12_arg_0; [L62] SORT_1 var_16_arg_0 = var_12; [L63] SORT_1 var_16 = ~var_16_arg_0; [L64] SORT_1 var_17_arg_0 = var_15; [L65] SORT_1 var_17_arg_1 = var_16; VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_17_arg_0=1, var_17_arg_1=-256, var_22=15, var_30=1, var_5=1] [L66] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L66] SORT_1 var_17 = var_17_arg_0 & var_17_arg_1; [L67] EXPR var_17 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L67] var_17 = var_17 & mask_SORT_1 [L68] SORT_1 bad_18_arg_0 = var_17; [L69] CALL __VERIFIER_assert(!(bad_18_arg_0)) [L21] COND FALSE !(!(cond)) [L69] RET __VERIFIER_assert(!(bad_18_arg_0)) [L71] SORT_1 var_37_arg_0 = input_3; [L72] SORT_1 var_37 = ~var_37_arg_0; [L73] SORT_4 var_38_arg_0 = state_6; [L74] SORT_4 var_38_arg_1 = state_9; [L75] SORT_1 var_38 = var_38_arg_0 > var_38_arg_1; [L76] SORT_1 var_39_arg_0 = var_37; [L77] SORT_1 var_39_arg_1 = var_38; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_39_arg_0=-256, var_39_arg_1=1, var_5=1] [L78] EXPR var_39_arg_0 & var_39_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L78] SORT_1 var_39 = var_39_arg_0 & var_39_arg_1; [L79] EXPR var_39 & mask_SORT_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L79] var_39 = var_39 & mask_SORT_1 [L80] SORT_4 var_29_arg_0 = var_22; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_29_arg_0=15, var_30=1, var_39=0, var_5=1] [L81] EXPR var_29_arg_0 & mask_SORT_4 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_39=0, var_5=1] [L81] var_29_arg_0 = var_29_arg_0 & mask_SORT_4 [L82] SORT_28 var_29 = var_29_arg_0; [L83] SORT_28 var_31_arg_0 = var_29; [L84] SORT_28 var_31_arg_1 = var_30; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_31_arg_0=15, var_31_arg_1=1, var_39=0, var_5=1] [L85] EXPR var_31_arg_0 >> var_31_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_39=0, var_5=1] [L85] SORT_28 var_31 = var_31_arg_0 >> var_31_arg_1; [L86] SORT_28 var_32_arg_0 = var_31; [L87] SORT_4 var_32 = var_32_arg_0 >> 0; [L88] SORT_4 var_33_arg_0 = state_6; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_32=258, var_33_arg_0=1, var_39=0, var_5=1] [L89] EXPR var_33_arg_0 & mask_SORT_4 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_32=258, var_39=0, var_5=1] [L89] var_33_arg_0 = var_33_arg_0 & mask_SORT_4 [L90] SORT_28 var_33 = var_33_arg_0; [L91] SORT_28 var_34_arg_0 = var_33; [L92] SORT_28 var_34_arg_1 = var_30; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_32=258, var_34_arg_0=0, var_34_arg_1=1, var_39=0, var_5=1] [L93] EXPR var_34_arg_0 >> var_34_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_32=258, var_39=0, var_5=1] [L93] SORT_28 var_34 = var_34_arg_0 >> var_34_arg_1; [L94] SORT_28 var_35_arg_0 = var_34; [L95] SORT_4 var_35 = var_35_arg_0 >> 0; [L96] SORT_4 var_36_arg_0 = var_32; [L97] SORT_4 var_36_arg_1 = var_35; [L98] SORT_4 var_36 = var_36_arg_0 + var_36_arg_1; [L99] SORT_4 var_26_arg_0 = state_6; [L100] SORT_4 var_26_arg_1 = state_9; [L101] SORT_1 var_26 = var_26_arg_0 < var_26_arg_1; [L102] SORT_4 var_21_arg_0 = state_9; [L103] SORT_4 var_21_arg_1 = state_6; [L104] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L105] SORT_4 var_23_arg_0 = state_6; [L106] SORT_4 var_23_arg_1 = var_22; [L107] SORT_1 var_23 = var_23_arg_0 != var_23_arg_1; [L108] SORT_1 var_24_arg_0 = var_21; [L109] SORT_1 var_24_arg_1 = var_23; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_24_arg_0=0, var_24_arg_1=1, var_26=0, var_30=1, var_36=2, var_39=0, var_5=1] [L110] EXPR var_24_arg_0 | var_24_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_26=0, var_30=1, var_36=2, var_39=0, var_5=1] [L110] SORT_1 var_24 = var_24_arg_0 | var_24_arg_1; [L111] EXPR var_24 & mask_SORT_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_26=0, var_30=1, var_36=2, var_39=0, var_5=1] [L111] var_24 = var_24 & mask_SORT_1 [L112] SORT_4 var_20_arg_0 = state_6; [L113] SORT_4 var_20_arg_1 = var_5; [L114] SORT_4 var_20 = var_20_arg_0 + var_20_arg_1; [L115] SORT_1 var_25_arg_0 = var_24; [L116] SORT_4 var_25_arg_1 = var_20; [L117] SORT_4 var_25_arg_2 = state_9; [L118] SORT_4 var_25 = var_25_arg_0 ? var_25_arg_1 : var_25_arg_2; [L119] SORT_1 var_27_arg_0 = var_26; [L120] SORT_4 var_27_arg_1 = state_6; [L121] SORT_4 var_27_arg_2 = var_25; [L122] SORT_4 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L123] SORT_1 var_40_arg_0 = var_39; [L124] SORT_4 var_40_arg_1 = var_36; [L125] SORT_4 var_40_arg_2 = var_27; [L126] SORT_4 var_40 = var_40_arg_0 ? var_40_arg_1 : var_40_arg_2; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_40=2, var_5=1] [L127] EXPR var_40 & mask_SORT_4 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L127] var_40 = var_40 & mask_SORT_4 [L128] SORT_4 next_41_arg_1 = var_40; [L129] SORT_1 var_48_arg_0 = input_3; [L130] SORT_1 var_48 = ~var_48_arg_0; [L131] SORT_4 var_49_arg_0 = state_6; [L132] SORT_4 var_49_arg_1 = state_9; [L133] SORT_1 var_49 = var_49_arg_0 > var_49_arg_1; [L134] SORT_1 var_50_arg_0 = var_48; [L135] SORT_1 var_50_arg_1 = var_49; VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_50_arg_0=-256, var_50_arg_1=1, var_5=1] [L136] EXPR var_50_arg_0 & var_50_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L136] SORT_1 var_50 = var_50_arg_0 & var_50_arg_1; [L137] EXPR var_50 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L137] var_50 = var_50 & mask_SORT_1 [L138] SORT_4 var_43_arg_0 = state_6; [L139] SORT_4 var_43_arg_1 = state_9; [L140] SORT_1 var_43 = var_43_arg_0 > var_43_arg_1; [L141] SORT_1 var_44_arg_0 = var_43; [L142] SORT_1 var_44 = ~var_44_arg_0; [L143] SORT_4 var_45_arg_0 = state_6; [L144] SORT_4 var_45_arg_1 = var_22; [L145] SORT_1 var_45 = var_45_arg_0 != var_45_arg_1; [L146] SORT_1 var_46_arg_0 = var_44; [L147] SORT_1 var_46_arg_1 = var_45; VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_46_arg_0=-2, var_46_arg_1=1, var_50=0, var_5=1] [L148] EXPR var_46_arg_0 | var_46_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_50=0, var_5=1] [L148] SORT_1 var_46 = var_46_arg_0 | var_46_arg_1; [L149] EXPR var_46 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_50=0, var_5=1] [L149] var_46 = var_46 & mask_SORT_1 [L150] SORT_4 var_42_arg_0 = state_9; [L151] SORT_4 var_42_arg_1 = var_5; [L152] SORT_4 var_42 = var_42_arg_0 + var_42_arg_1; [L153] SORT_1 var_47_arg_0 = var_46; [L154] SORT_4 var_47_arg_1 = var_42; [L155] SORT_4 var_47_arg_2 = state_6; [L156] SORT_4 var_47 = var_47_arg_0 ? var_47_arg_1 : var_47_arg_2; [L157] SORT_1 var_51_arg_0 = var_50; [L158] SORT_4 var_51_arg_1 = state_9; [L159] SORT_4 var_51_arg_2 = var_47; [L160] SORT_4 var_51 = var_51_arg_0 ? var_51_arg_1 : var_51_arg_2; VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, var_15=1, var_22=15, var_30=1, var_51=1, var_5=1] [L161] EXPR var_51 & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, var_15=1, var_22=15, var_30=1, var_5=1] [L161] var_51 = var_51 & mask_SORT_4 [L162] SORT_4 next_52_arg_1 = var_51; [L164] state_6 = next_41_arg_1 [L165] state_9 = next_52_arg_1 [L53] input_2 = __VERIFIER_nondet_uchar() [L54] input_3 = __VERIFIER_nondet_uchar() [L57] SORT_4 var_11_arg_0 = state_6; [L58] SORT_4 var_11_arg_1 = state_9; [L59] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L60] SORT_1 var_12_arg_0 = var_11; [L61] SORT_1 var_12 = ~var_12_arg_0; [L62] SORT_1 var_16_arg_0 = var_12; [L63] SORT_1 var_16 = ~var_16_arg_0; [L64] SORT_1 var_17_arg_0 = var_15; [L65] SORT_1 var_17_arg_1 = var_16; VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_9=1, var_15=1, var_17_arg_0=1, var_17_arg_1=-255, var_22=15, var_30=1, var_5=1] [L66] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_9=1, var_15=1, var_22=15, var_30=1, var_5=1] [L66] SORT_1 var_17 = var_17_arg_0 & var_17_arg_1; [L67] EXPR var_17 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_9=1, var_15=1, var_22=15, var_30=1, var_5=1] [L67] var_17 = var_17 & mask_SORT_1 [L68] SORT_1 bad_18_arg_0 = var_17; [L69] CALL __VERIFIER_assert(!(bad_18_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 83 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.3s, OverallIterations: 24, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2723 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2723 mSDsluCounter, 7805 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5869 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4211 IncrementalHoareTripleChecker+Invalid, 4233 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 1936 mSDtfsCounter, 4211 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 275 GetRequests, 119 SyntacticMatches, 2 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=248occurred in iteration=17, InterpolantAutomatonStates: 154, 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, 23 MinimizatonAttempts, 486 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 1328 NumberOfCodeBlocks, 1328 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1240 ConstructedInterpolants, 0 QuantifiedInterpolants, 5975 SizeOfPredicates, 3 NumberOfNonLiveVariables, 378 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 24 InterpolantComputations, 23 PerfectInterpolantSequences, 122/126 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 10:54:01,283 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.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 927306cfdb34082f032dbe87a24c6d688e2dda4e8fb165835d54bffc8f03e27e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 10:54:03,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 10:54:03,665 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-16 10:54:03,670 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 10:54:03,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 10:54:03,703 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 10:54:03,706 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 10:54:03,706 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 10:54:03,707 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 10:54:03,707 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 10:54:03,707 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 10:54:03,708 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 10:54:03,708 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 10:54:03,710 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 10:54:03,710 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 10:54:03,711 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 10:54:03,711 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 10:54:03,711 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 10:54:03,711 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 10:54:03,714 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 10:54:03,714 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 10:54:03,715 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 10:54:03,715 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 10:54:03,715 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 10:54:03,715 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 10:54:03,715 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 10:54:03,715 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 10:54:03,715 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 10:54:03,716 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 10:54:03,716 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 10:54:03,717 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 10:54:03,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:54:03,717 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 10:54:03,718 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 10:54:03,718 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 10:54:03,718 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 10:54:03,718 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 10:54:03,719 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 10:54:03,719 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 10:54:03,719 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 10:54:03,719 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 10:54:03,719 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 -> 927306cfdb34082f032dbe87a24c6d688e2dda4e8fb165835d54bffc8f03e27e [2024-11-16 10:54:03,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 10:54:03,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 10:54:03,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 10:54:03,976 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 10:54:03,977 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 10:54:03,978 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c [2024-11-16 10:54:05,332 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 10:54:05,518 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 10:54:05,519 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c [2024-11-16 10:54:05,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e583fdac3/1eb0d99d612a4534aa33019fe46d579f/FLAGee69b6bc3 [2024-11-16 10:54:05,540 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e583fdac3/1eb0d99d612a4534aa33019fe46d579f [2024-11-16 10:54:05,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 10:54:05,543 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 10:54:05,545 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 10:54:05,545 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 10:54:05,552 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 10:54:05,554 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:54:05" (1/1) ... [2024-11-16 10:54:05,554 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c721bb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:05, skipping insertion in model container [2024-11-16 10:54:05,554 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:54:05" (1/1) ... [2024-11-16 10:54:05,578 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 10:54:05,708 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c[1250,1263] [2024-11-16 10:54:05,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:54:05,762 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 10:54:05,773 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c[1250,1263] [2024-11-16 10:54:05,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:54:05,809 INFO L204 MainTranslator]: Completed translation [2024-11-16 10:54:05,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:05 WrapperNode [2024-11-16 10:54:05,810 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 10:54:05,811 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 10:54:05,811 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 10:54:05,811 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 10:54:05,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:05" (1/1) ... [2024-11-16 10:54:05,822 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:05" (1/1) ... [2024-11-16 10:54:05,842 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 154 [2024-11-16 10:54:05,842 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 10:54:05,842 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 10:54:05,842 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 10:54:05,842 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 10:54:05,857 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:05" (1/1) ... [2024-11-16 10:54:05,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:05" (1/1) ... [2024-11-16 10:54:05,861 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:05" (1/1) ... [2024-11-16 10:54:05,869 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 10:54:05,869 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:05" (1/1) ... [2024-11-16 10:54:05,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:05" (1/1) ... [2024-11-16 10:54:05,873 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:05" (1/1) ... [2024-11-16 10:54:05,874 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:05" (1/1) ... [2024-11-16 10:54:05,875 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:05" (1/1) ... [2024-11-16 10:54:05,876 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:05" (1/1) ... [2024-11-16 10:54:05,878 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 10:54:05,878 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 10:54:05,878 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 10:54:05,878 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 10:54:05,879 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:05" (1/1) ... [2024-11-16 10:54:05,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:54:05,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:54:05,913 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 10:54:05,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 10:54:05,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 10:54:05,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 10:54:05,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 10:54:05,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 10:54:06,054 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 10:54:06,055 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 10:54:06,263 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-16 10:54:06,263 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 10:54:06,280 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 10:54:06,281 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 10:54:06,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:54:06 BoogieIcfgContainer [2024-11-16 10:54:06,282 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 10:54:06,284 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 10:54:06,284 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 10:54:06,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 10:54:06,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:54:05" (1/3) ... [2024-11-16 10:54:06,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63fd56b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:54:06, skipping insertion in model container [2024-11-16 10:54:06,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:54:05" (2/3) ... [2024-11-16 10:54:06,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63fd56b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:54:06, skipping insertion in model container [2024-11-16 10:54:06,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:54:06" (3/3) ... [2024-11-16 10:54:06,289 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.diagonal_v.c [2024-11-16 10:54:06,302 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 10:54:06,303 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 10:54:06,348 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 10:54:06,353 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;@414c6c39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 10:54:06,354 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 10:54:06,357 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:54:06,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-16 10:54:06,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:54:06,362 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-16 10:54:06,362 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:54:06,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:54:06,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-16 10:54:06,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 10:54:06,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475764740] [2024-11-16 10:54:06,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:54:06,375 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 10:54:06,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 10:54:06,379 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 10:54:06,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 10:54:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:54:06,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-16 10:54:06,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:54:06,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:54:06,636 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 10:54:06,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 10:54:06,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475764740] [2024-11-16 10:54:06,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [475764740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:54:06,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:54:06,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:54:06,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876760409] [2024-11-16 10:54:06,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:54:06,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:54:06,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 10:54:06,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:54:06,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:54:06,660 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:54:06,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:54:06,690 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2024-11-16 10:54:06,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:54:06,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-16 10:54:06,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:54:06,697 INFO L225 Difference]: With dead ends: 22 [2024-11-16 10:54:06,697 INFO L226 Difference]: Without dead ends: 11 [2024-11-16 10:54:06,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:54:06,702 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 10:54:06,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 10:54:06,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-16 10:54:06,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2024-11-16 10:54:06,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:54:06,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-16 10:54:06,723 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-16 10:54:06,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:54:06,723 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-16 10:54:06,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:54:06,723 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-16 10:54:06,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-16 10:54:06,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:54:06,724 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:54:06,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-16 10:54:06,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 10:54:06,927 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:54:06,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:54:06,928 INFO L85 PathProgramCache]: Analyzing trace with hash 2061110753, now seen corresponding path program 1 times [2024-11-16 10:54:06,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 10:54:06,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922506929] [2024-11-16 10:54:06,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:54:06,930 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 10:54:06,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 10:54:06,932 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 10:54:06,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 10:54:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:54:07,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-16 10:54:07,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:54:07,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:54:07,312 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 10:54:10,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:54:10,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 10:54:10,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922506929] [2024-11-16 10:54:10,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922506929] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 10:54:10,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 10:54:10,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-16 10:54:10,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052988328] [2024-11-16 10:54:10,697 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 10:54:10,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 10:54:10,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 10:54:10,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 10:54:10,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 10:54:10,699 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:54:11,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:54:11,030 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2024-11-16 10:54:11,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 10:54:11,031 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-16 10:54:11,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:54:11,031 INFO L225 Difference]: With dead ends: 20 [2024-11-16 10:54:11,031 INFO L226 Difference]: Without dead ends: 17 [2024-11-16 10:54:11,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-16 10:54:11,033 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 6 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:54:11,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:54:11,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-16 10:54:11,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2024-11-16 10:54:11,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:54:11,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2024-11-16 10:54:11,040 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2024-11-16 10:54:11,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:54:11,040 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2024-11-16 10:54:11,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:54:11,040 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2024-11-16 10:54:11,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-16 10:54:11,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:54:11,041 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2024-11-16 10:54:11,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 10:54:11,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 10:54:11,244 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:54:11,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:54:11,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1989777505, now seen corresponding path program 2 times [2024-11-16 10:54:11,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 10:54:11,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026389885] [2024-11-16 10:54:11,248 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 10:54:11,249 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 10:54:11,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 10:54:11,251 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 10:54:11,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 10:54:11,396 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 10:54:11,397 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 10:54:11,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-16 10:54:11,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:54:12,820 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:54:12,821 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 10:55:15,684 WARN L286 SmtUtils]: Spent 14.00s on a formula simplification. DAG size of input: 1600 DAG size of output: 1470 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)