./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/copy-partial-3-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/copy-partial-3-u.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 32bit --witnessprinter.graph.data.programhash 52a248b2b2cf395cf0c12ea6447af889ed3691d7fa3d2de2504a7728d19c705b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:10:39,609 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:10:39,693 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:10:39,700 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:10:39,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:10:39,735 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:10:39,737 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:10:39,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:10:39,738 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:10:39,739 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:10:39,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:10:39,740 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:10:39,740 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:10:39,743 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:10:39,743 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:10:39,743 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:10:39,744 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:10:39,744 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:10:39,744 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:10:39,744 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:10:39,745 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:10:39,745 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:10:39,749 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:10:39,749 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:10:39,749 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:10:39,750 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:10:39,750 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:10:39,750 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:10:39,750 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:10:39,751 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:10:39,751 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:10:39,751 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:10:39,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:10:39,751 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:10:39,752 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:10:39,752 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:10:39,752 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:10:39,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:10:39,752 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:10:39,753 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:10:39,753 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:10:39,754 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:10:39,754 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-clean/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-clean/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 52a248b2b2cf395cf0c12ea6447af889ed3691d7fa3d2de2504a7728d19c705b [2024-10-10 22:10:40,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:10:40,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:10:40,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:10:40,040 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:10:40,040 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:10:40,042 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/copy-partial-3-u.c [2024-10-10 22:10:41,527 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:10:41,744 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:10:41,744 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/copy-partial-3-u.c [2024-10-10 22:10:41,753 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fab3a5d4d/963c0e8f433d4a8d9840987cc8747911/FLAG943f914b8 [2024-10-10 22:10:41,764 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fab3a5d4d/963c0e8f433d4a8d9840987cc8747911 [2024-10-10 22:10:41,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:10:41,771 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:10:41,773 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:10:41,773 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:10:41,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:10:41,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:10:41" (1/1) ... [2024-10-10 22:10:41,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b94a59c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:10:41, skipping insertion in model container [2024-10-10 22:10:41,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:10:41" (1/1) ... [2024-10-10 22:10:41,799 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:10:41,978 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/copy-partial-3-u.c[414,427] [2024-10-10 22:10:42,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:10:42,020 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:10:42,031 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/copy-partial-3-u.c[414,427] [2024-10-10 22:10:42,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:10:42,075 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:10:42,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:10:42 WrapperNode [2024-10-10 22:10:42,076 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:10:42,078 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:10:42,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:10:42,079 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:10:42,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:10:42" (1/1) ... [2024-10-10 22:10:42,093 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:10:42" (1/1) ... [2024-10-10 22:10:42,114 INFO L138 Inliner]: procedures = 15, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 132 [2024-10-10 22:10:42,115 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:10:42,116 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:10:42,116 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:10:42,116 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:10:42,131 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:10:42" (1/1) ... [2024-10-10 22:10:42,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:10:42" (1/1) ... [2024-10-10 22:10:42,134 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:10:42" (1/1) ... [2024-10-10 22:10:42,148 INFO L175 MemorySlicer]: Split 9 memory accesses to 3 slices as follows [2, 4, 3]. 44 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2024-10-10 22:10:42,149 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:10:42" (1/1) ... [2024-10-10 22:10:42,149 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:10:42" (1/1) ... [2024-10-10 22:10:42,160 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:10:42" (1/1) ... [2024-10-10 22:10:42,171 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:10:42" (1/1) ... [2024-10-10 22:10:42,172 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:10:42" (1/1) ... [2024-10-10 22:10:42,173 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:10:42" (1/1) ... [2024-10-10 22:10:42,178 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:10:42,181 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:10:42,181 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:10:42,181 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:10:42,182 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:10:42" (1/1) ... [2024-10-10 22:10:42,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:10:42,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:10:42,214 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:10:42,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:10:42,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:10:42,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:10:42,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-10 22:10:42,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-10 22:10:42,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-10 22:10:42,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-10 22:10:42,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-10 22:10:42,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-10 22:10:42,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:10:42,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:10:42,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-10 22:10:42,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-10 22:10:42,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-10 22:10:42,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-10 22:10:42,363 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:10:42,365 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:10:42,603 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-10-10 22:10:42,603 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:10:42,637 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:10:42,638 INFO L314 CfgBuilder]: Removed 12 assume(true) statements. [2024-10-10 22:10:42,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:10:42 BoogieIcfgContainer [2024-10-10 22:10:42,639 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:10:42,641 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:10:42,641 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:10:42,645 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:10:42,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:10:41" (1/3) ... [2024-10-10 22:10:42,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa018e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:10:42, skipping insertion in model container [2024-10-10 22:10:42,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:10:42" (2/3) ... [2024-10-10 22:10:42,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa018e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:10:42, skipping insertion in model container [2024-10-10 22:10:42,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:10:42" (3/3) ... [2024-10-10 22:10:42,649 INFO L112 eAbstractionObserver]: Analyzing ICFG copy-partial-3-u.c [2024-10-10 22:10:42,665 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:10:42,665 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:10:42,721 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:10:42,729 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;@4c344246, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:10:42,730 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:10:42,734 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 30 states have (on average 1.9) internal successors, (57), 31 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-10-10 22:10:42,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-10 22:10:42,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:10:42,741 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:10:42,741 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:10:42,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:10:42,745 INFO L85 PathProgramCache]: Analyzing trace with hash -35672779, now seen corresponding path program 1 times [2024-10-10 22:10:42,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:10:42,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706446788] [2024-10-10 22:10:42,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:10:42,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:10:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:10:42,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:10:42,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:10:42,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706446788] [2024-10-10 22:10:42,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706446788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:10:42,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:10:42,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:10:42,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027666544] [2024-10-10 22:10:42,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:10:42,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 22:10:42,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:10:42,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 22:10:42,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:10:42,961 INFO L87 Difference]: Start difference. First operand has 32 states, 30 states have (on average 1.9) internal successors, (57), 31 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) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:42,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:10:42,994 INFO L93 Difference]: Finished difference Result 62 states and 111 transitions. [2024-10-10 22:10:42,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 22:10:42,997 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-10 22:10:42,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:10:43,005 INFO L225 Difference]: With dead ends: 62 [2024-10-10 22:10:43,005 INFO L226 Difference]: Without dead ends: 30 [2024-10-10 22:10:43,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:10:43,013 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:10:43,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:10:43,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-10 22:10:43,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-10 22:10:43,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:43,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2024-10-10 22:10:43,082 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 14 [2024-10-10 22:10:43,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:10:43,083 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2024-10-10 22:10:43,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:43,083 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2024-10-10 22:10:43,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-10 22:10:43,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:10:43,084 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:10:43,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:10:43,084 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:10:43,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:10:43,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1206240891, now seen corresponding path program 1 times [2024-10-10 22:10:43,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:10:43,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29461467] [2024-10-10 22:10:43,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:10:43,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:10:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:10:43,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:10:43,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:10:43,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29461467] [2024-10-10 22:10:43,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29461467] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:10:43,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:10:43,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:10:43,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829742164] [2024-10-10 22:10:43,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:10:43,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:10:43,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:10:43,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:10:43,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:10:43,316 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:43,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:10:43,423 INFO L93 Difference]: Finished difference Result 71 states and 98 transitions. [2024-10-10 22:10:43,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:10:43,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-10 22:10:43,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:10:43,425 INFO L225 Difference]: With dead ends: 71 [2024-10-10 22:10:43,425 INFO L226 Difference]: Without dead ends: 49 [2024-10-10 22:10:43,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:10:43,426 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 62 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:10:43,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 29 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:10:43,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-10 22:10:43,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 31. [2024-10-10 22:10:43,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:43,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2024-10-10 22:10:43,435 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 14 [2024-10-10 22:10:43,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:10:43,435 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2024-10-10 22:10:43,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:43,435 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2024-10-10 22:10:43,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-10 22:10:43,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:10:43,436 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:10:43,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:10:43,437 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:10:43,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:10:43,442 INFO L85 PathProgramCache]: Analyzing trace with hash 2139015076, now seen corresponding path program 1 times [2024-10-10 22:10:43,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:10:43,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580415177] [2024-10-10 22:10:43,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:10:43,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:10:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:10:43,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:10:43,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:10:43,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580415177] [2024-10-10 22:10:43,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580415177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:10:43,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:10:43,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:10:43,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031189053] [2024-10-10 22:10:43,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:10:43,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:10:43,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:10:43,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:10:43,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:10:43,588 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:43,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:10:43,700 INFO L93 Difference]: Finished difference Result 71 states and 99 transitions. [2024-10-10 22:10:43,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:10:43,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-10 22:10:43,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:10:43,703 INFO L225 Difference]: With dead ends: 71 [2024-10-10 22:10:43,703 INFO L226 Difference]: Without dead ends: 44 [2024-10-10 22:10:43,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:10:43,705 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 52 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:10:43,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 32 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:10:43,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-10 22:10:43,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2024-10-10 22:10:43,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:43,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2024-10-10 22:10:43,716 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 17 [2024-10-10 22:10:43,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:10:43,716 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2024-10-10 22:10:43,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:43,717 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2024-10-10 22:10:43,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-10 22:10:43,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:10:43,718 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:10:43,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:10:43,718 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:10:43,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:10:43,719 INFO L85 PathProgramCache]: Analyzing trace with hash 527282873, now seen corresponding path program 1 times [2024-10-10 22:10:43,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:10:43,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694529397] [2024-10-10 22:10:43,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:10:43,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:10:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:10:43,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:10:43,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:10:43,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694529397] [2024-10-10 22:10:43,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694529397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:10:43,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:10:43,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:10:43,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715735796] [2024-10-10 22:10:43,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:10:43,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:10:43,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:10:43,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:10:43,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:10:43,799 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:43,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:10:43,863 INFO L93 Difference]: Finished difference Result 69 states and 94 transitions. [2024-10-10 22:10:43,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:10:43,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-10-10 22:10:43,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:10:43,864 INFO L225 Difference]: With dead ends: 69 [2024-10-10 22:10:43,864 INFO L226 Difference]: Without dead ends: 40 [2024-10-10 22:10:43,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:10:43,866 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 48 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:10:43,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 39 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:10:43,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-10 22:10:43,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2024-10-10 22:10:43,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:43,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2024-10-10 22:10:43,881 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 20 [2024-10-10 22:10:43,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:10:43,881 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2024-10-10 22:10:43,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:43,882 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2024-10-10 22:10:43,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-10 22:10:43,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:10:43,882 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:10:43,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 22:10:43,883 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:10:43,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:10:43,886 INFO L85 PathProgramCache]: Analyzing trace with hash 2131150869, now seen corresponding path program 1 times [2024-10-10 22:10:43,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:10:43,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076823296] [2024-10-10 22:10:43,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:10:43,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:10:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:10:44,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-10 22:10:44,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:10:44,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076823296] [2024-10-10 22:10:44,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076823296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:10:44,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:10:44,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:10:44,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664059558] [2024-10-10 22:10:44,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:10:44,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:10:44,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:10:44,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:10:44,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:10:44,022 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:44,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:10:44,091 INFO L93 Difference]: Finished difference Result 75 states and 98 transitions. [2024-10-10 22:10:44,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:10:44,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-10 22:10:44,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:10:44,094 INFO L225 Difference]: With dead ends: 75 [2024-10-10 22:10:44,094 INFO L226 Difference]: Without dead ends: 57 [2024-10-10 22:10:44,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:10:44,095 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 52 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:10:44,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 41 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:10:44,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-10 22:10:44,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2024-10-10 22:10:44,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:44,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2024-10-10 22:10:44,114 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 21 [2024-10-10 22:10:44,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:10:44,114 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2024-10-10 22:10:44,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:44,118 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2024-10-10 22:10:44,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-10 22:10:44,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:10:44,119 INFO L215 NwaCegarLoop]: trace 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-10-10 22:10:44,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 22:10:44,119 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:10:44,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:10:44,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1215531875, now seen corresponding path program 1 times [2024-10-10 22:10:44,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:10:44,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904361496] [2024-10-10 22:10:44,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:10:44,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:10:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:10:44,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-10 22:10:44,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:10:44,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904361496] [2024-10-10 22:10:44,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904361496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:10:44,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:10:44,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:10:44,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587359889] [2024-10-10 22:10:44,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:10:44,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:10:44,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:10:44,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:10:44,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:10:44,226 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:44,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:10:44,311 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2024-10-10 22:10:44,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:10:44,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-10-10 22:10:44,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:10:44,315 INFO L225 Difference]: With dead ends: 72 [2024-10-10 22:10:44,315 INFO L226 Difference]: Without dead ends: 49 [2024-10-10 22:10:44,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:10:44,317 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 53 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:10:44,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 41 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:10:44,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-10 22:10:44,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37. [2024-10-10 22:10:44,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 36 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:44,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2024-10-10 22:10:44,330 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 24 [2024-10-10 22:10:44,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:10:44,330 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2024-10-10 22:10:44,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:44,331 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2024-10-10 22:10:44,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-10 22:10:44,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:10:44,331 INFO L215 NwaCegarLoop]: trace 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, 1, 1, 1] [2024-10-10 22:10:44,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 22:10:44,332 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:10:44,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:10:44,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1815143859, now seen corresponding path program 1 times [2024-10-10 22:10:44,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:10:44,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138874200] [2024-10-10 22:10:44,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:10:44,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:10:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:10:44,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-10 22:10:44,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:10:44,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138874200] [2024-10-10 22:10:44,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138874200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:10:44,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:10:44,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:10:44,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599708308] [2024-10-10 22:10:44,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:10:44,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:10:44,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:10:44,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:10:44,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:10:44,440 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:44,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:10:44,486 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2024-10-10 22:10:44,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:10:44,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-10-10 22:10:44,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:10:44,487 INFO L225 Difference]: With dead ends: 66 [2024-10-10 22:10:44,487 INFO L226 Difference]: Without dead ends: 42 [2024-10-10 22:10:44,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:10:44,490 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 32 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:10:44,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 50 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:10:44,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-10 22:10:44,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2024-10-10 22:10:44,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:44,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2024-10-10 22:10:44,506 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 27 [2024-10-10 22:10:44,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:10:44,506 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2024-10-10 22:10:44,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:44,507 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2024-10-10 22:10:44,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-10 22:10:44,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:10:44,508 INFO L215 NwaCegarLoop]: trace 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, 1, 1, 1, 1] [2024-10-10 22:10:44,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 22:10:44,508 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:10:44,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:10:44,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1487991508, now seen corresponding path program 1 times [2024-10-10 22:10:44,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:10:44,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662535725] [2024-10-10 22:10:44,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:10:44,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:10:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:10:44,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:10:44,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:10:44,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662535725] [2024-10-10 22:10:44,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662535725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:10:44,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:10:44,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:10:44,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291735233] [2024-10-10 22:10:44,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:10:44,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:10:44,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:10:44,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:10:44,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:10:44,614 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:44,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:10:44,686 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2024-10-10 22:10:44,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:10:44,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-10-10 22:10:44,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:10:44,688 INFO L225 Difference]: With dead ends: 55 [2024-10-10 22:10:44,689 INFO L226 Difference]: Without dead ends: 43 [2024-10-10 22:10:44,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:10:44,690 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 39 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:10:44,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 22 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:10:44,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-10 22:10:44,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2024-10-10 22:10:44,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:44,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2024-10-10 22:10:44,705 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 28 [2024-10-10 22:10:44,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:10:44,705 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2024-10-10 22:10:44,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:44,707 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2024-10-10 22:10:44,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-10 22:10:44,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:10:44,709 INFO L215 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:10:44,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 22:10:44,710 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:10:44,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:10:44,710 INFO L85 PathProgramCache]: Analyzing trace with hash -478582243, now seen corresponding path program 1 times [2024-10-10 22:10:44,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:10:44,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049133362] [2024-10-10 22:10:44,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:10:44,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:10:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:10:44,788 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:10:44,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:10:44,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049133362] [2024-10-10 22:10:44,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049133362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:10:44,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:10:44,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:10:44,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245719283] [2024-10-10 22:10:44,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:10:44,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:10:44,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:10:44,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:10:44,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:10:44,790 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:44,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:10:44,855 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2024-10-10 22:10:44,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:10:44,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-10 22:10:44,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:10:44,857 INFO L225 Difference]: With dead ends: 59 [2024-10-10 22:10:44,858 INFO L226 Difference]: Without dead ends: 42 [2024-10-10 22:10:44,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:10:44,859 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 29 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:10:44,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 26 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:10:44,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-10 22:10:44,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2024-10-10 22:10:44,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 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-10-10 22:10:44,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2024-10-10 22:10:44,874 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 31 [2024-10-10 22:10:44,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:10:44,875 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2024-10-10 22:10:44,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:44,875 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2024-10-10 22:10:44,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-10 22:10:44,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:10:44,876 INFO L215 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:10:44,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 22:10:44,877 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:10:44,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:10:44,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1991166482, now seen corresponding path program 1 times [2024-10-10 22:10:44,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:10:44,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497497373] [2024-10-10 22:10:44,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:10:44,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:10:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:10:44,956 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:10:44,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:10:44,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497497373] [2024-10-10 22:10:44,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497497373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:10:44,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:10:44,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:10:44,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132286851] [2024-10-10 22:10:44,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:10:44,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:10:44,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:10:44,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:10:44,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:10:44,959 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:45,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:10:45,028 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2024-10-10 22:10:45,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:10:45,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-10 22:10:45,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:10:45,029 INFO L225 Difference]: With dead ends: 59 [2024-10-10 22:10:45,037 INFO L226 Difference]: Without dead ends: 41 [2024-10-10 22:10:45,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:10:45,038 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 20 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:10:45,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 31 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:10:45,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-10 22:10:45,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-10 22:10:45,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.3) internal successors, (52), 40 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-10-10 22:10:45,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2024-10-10 22:10:45,058 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 34 [2024-10-10 22:10:45,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:10:45,058 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2024-10-10 22:10:45,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:45,058 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2024-10-10 22:10:45,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-10 22:10:45,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:10:45,059 INFO L215 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:10:45,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 22:10:45,059 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:10:45,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:10:45,060 INFO L85 PathProgramCache]: Analyzing trace with hash -261758194, now seen corresponding path program 1 times [2024-10-10 22:10:45,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:10:45,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509792558] [2024-10-10 22:10:45,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:10:45,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:10:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:10:45,172 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:10:45,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:10:45,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509792558] [2024-10-10 22:10:45,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509792558] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:10:45,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602407036] [2024-10-10 22:10:45,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:10:45,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:10:45,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:10:45,175 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:10:45,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 22:10:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:10:45,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 22:10:45,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:10:45,327 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:10:45,328 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:10:45,363 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:10:45,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602407036] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:10:45,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:10:45,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-10-10 22:10:45,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750607114] [2024-10-10 22:10:45,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:10:45,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-10 22:10:45,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:10:45,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-10 22:10:45,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-10-10 22:10:45,367 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:45,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:10:45,478 INFO L93 Difference]: Finished difference Result 99 states and 130 transitions. [2024-10-10 22:10:45,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 22:10:45,478 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-10-10 22:10:45,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:10:45,480 INFO L225 Difference]: With dead ends: 99 [2024-10-10 22:10:45,480 INFO L226 Difference]: Without dead ends: 62 [2024-10-10 22:10:45,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2024-10-10 22:10:45,482 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 70 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:10:45,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 83 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:10:45,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-10 22:10:45,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2024-10-10 22:10:45,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 52 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:45,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2024-10-10 22:10:45,494 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 35 [2024-10-10 22:10:45,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:10:45,494 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2024-10-10 22:10:45,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:45,495 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2024-10-10 22:10:45,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-10 22:10:45,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:10:45,495 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:10:45,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 22:10:45,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-10 22:10:45,696 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:10:45,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:10:45,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1901619790, now seen corresponding path program 2 times [2024-10-10 22:10:45,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:10:45,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100573534] [2024-10-10 22:10:45,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:10:45,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:10:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:10:45,829 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:10:45,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:10:45,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100573534] [2024-10-10 22:10:45,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100573534] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:10:45,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618810918] [2024-10-10 22:10:45,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 22:10:45,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:10:45,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:10:45,832 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:10:45,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 22:10:45,922 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 22:10:45,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:10:45,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-10 22:10:45,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:10:46,011 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:10:46,013 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:10:46,103 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:10:46,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618810918] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:10:46,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:10:46,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2024-10-10 22:10:46,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894812180] [2024-10-10 22:10:46,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:10:46,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-10 22:10:46,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:10:46,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-10 22:10:46,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2024-10-10 22:10:46,107 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 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-10-10 22:10:46,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:10:46,350 INFO L93 Difference]: Finished difference Result 153 states and 199 transitions. [2024-10-10 22:10:46,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-10 22:10:46,350 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 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 38 [2024-10-10 22:10:46,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:10:46,351 INFO L225 Difference]: With dead ends: 153 [2024-10-10 22:10:46,351 INFO L226 Difference]: Without dead ends: 104 [2024-10-10 22:10:46,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2024-10-10 22:10:46,353 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 161 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:10:46,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 120 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:10:46,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-10 22:10:46,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 77. [2024-10-10 22:10:46,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 76 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:46,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 97 transitions. [2024-10-10 22:10:46,375 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 97 transitions. Word has length 38 [2024-10-10 22:10:46,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:10:46,376 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 97 transitions. [2024-10-10 22:10:46,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 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-10-10 22:10:46,376 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2024-10-10 22:10:46,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-10 22:10:46,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:10:46,377 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:10:46,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 22:10:46,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:10:46,581 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:10:46,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:10:46,581 INFO L85 PathProgramCache]: Analyzing trace with hash 808278066, now seen corresponding path program 3 times [2024-10-10 22:10:46,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:10:46,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952280608] [2024-10-10 22:10:46,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:10:46,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:10:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:10:46,845 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:10:46,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:10:46,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952280608] [2024-10-10 22:10:46,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952280608] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:10:46,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468408562] [2024-10-10 22:10:46,846 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-10 22:10:46,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:10:46,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:10:46,849 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:10:46,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 22:10:46,930 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-10 22:10:46,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:10:46,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 22:10:46,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:10:47,032 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-10 22:10:47,032 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:10:47,101 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-10 22:10:47,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468408562] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:10:47,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:10:47,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 4, 4] total 18 [2024-10-10 22:10:47,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220164801] [2024-10-10 22:10:47,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:10:47,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-10 22:10:47,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:10:47,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-10 22:10:47,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-10-10 22:10:47,104 INFO L87 Difference]: Start difference. First operand 77 states and 97 transitions. Second operand has 19 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 18 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-10-10 22:10:48,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:10:48,768 INFO L93 Difference]: Finished difference Result 502 states and 617 transitions. [2024-10-10 22:10:48,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-10-10 22:10:48,769 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 18 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 44 [2024-10-10 22:10:48,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:10:48,771 INFO L225 Difference]: With dead ends: 502 [2024-10-10 22:10:48,771 INFO L226 Difference]: Without dead ends: 429 [2024-10-10 22:10:48,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1695 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1772, Invalid=3778, Unknown=0, NotChecked=0, Total=5550 [2024-10-10 22:10:48,774 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 1745 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1745 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:10:48,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1745 Valid, 109 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:10:48,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-10-10 22:10:48,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 132. [2024-10-10 22:10:48,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.213740458015267) internal successors, (159), 131 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:48,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 159 transitions. [2024-10-10 22:10:48,810 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 159 transitions. Word has length 44 [2024-10-10 22:10:48,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:10:48,810 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 159 transitions. [2024-10-10 22:10:48,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 18 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-10-10 22:10:48,810 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 159 transitions. [2024-10-10 22:10:48,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-10 22:10:48,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:10:48,814 INFO L215 NwaCegarLoop]: trace histogram [44, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:10:48,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 22:10:49,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:10:49,016 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:10:49,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:10:49,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1432390284, now seen corresponding path program 4 times [2024-10-10 22:10:49,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:10:49,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322734413] [2024-10-10 22:10:49,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:10:49,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:10:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:10:49,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 443 proven. 66 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2024-10-10 22:10:49,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:10:49,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322734413] [2024-10-10 22:10:49,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322734413] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:10:49,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411599162] [2024-10-10 22:10:49,519 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-10 22:10:49,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:10:49,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:10:49,521 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:10:49,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 22:10:49,637 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-10 22:10:49,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:10:49,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 22:10:49,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:10:49,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 457 proven. 1 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2024-10-10 22:10:49,767 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:10:49,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1184 backedges. 456 proven. 2 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2024-10-10 22:10:49,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411599162] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:10:49,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:10:49,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 24 [2024-10-10 22:10:49,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087160888] [2024-10-10 22:10:49,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:10:49,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-10 22:10:49,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:10:49,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-10 22:10:49,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2024-10-10 22:10:49,869 INFO L87 Difference]: Start difference. First operand 132 states and 159 transitions. Second operand has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:50,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:10:50,955 INFO L93 Difference]: Finished difference Result 581 states and 691 transitions. [2024-10-10 22:10:50,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-10-10 22:10:50,955 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-10-10 22:10:50,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:10:50,957 INFO L225 Difference]: With dead ends: 581 [2024-10-10 22:10:50,957 INFO L226 Difference]: Without dead ends: 454 [2024-10-10 22:10:50,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1101, Invalid=2805, Unknown=0, NotChecked=0, Total=3906 [2024-10-10 22:10:50,960 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 983 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:10:50,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [983 Valid, 83 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:10:50,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-10-10 22:10:51,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 238. [2024-10-10 22:10:51,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.1940928270042195) internal successors, (283), 237 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:51,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 283 transitions. [2024-10-10 22:10:51,017 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 283 transitions. Word has length 96 [2024-10-10 22:10:51,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:10:51,017 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 283 transitions. [2024-10-10 22:10:51,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:51,018 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 283 transitions. [2024-10-10 22:10:51,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-10 22:10:51,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:10:51,022 INFO L215 NwaCegarLoop]: trace histogram [96, 8, 8, 8, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:10:51,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-10 22:10:51,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-10 22:10:51,223 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:10:51,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:10:51,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1522460980, now seen corresponding path program 5 times [2024-10-10 22:10:51,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:10:51,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689445637] [2024-10-10 22:10:51,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:10:51,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:10:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:10:52,036 INFO L134 CoverageAnalysis]: Checked inductivity of 5472 backedges. 1198 proven. 78 refuted. 0 times theorem prover too weak. 4196 trivial. 0 not checked. [2024-10-10 22:10:52,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:10:52,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689445637] [2024-10-10 22:10:52,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689445637] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:10:52,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441375612] [2024-10-10 22:10:52,037 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-10 22:10:52,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:10:52,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:10:52,039 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:10:52,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-10 22:10:55,003 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2024-10-10 22:10:55,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:10:55,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-10 22:10:55,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:10:55,297 INFO L134 CoverageAnalysis]: Checked inductivity of 5472 backedges. 3520 proven. 185 refuted. 0 times theorem prover too weak. 1767 trivial. 0 not checked. [2024-10-10 22:10:55,297 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:10:55,569 INFO L134 CoverageAnalysis]: Checked inductivity of 5472 backedges. 3520 proven. 185 refuted. 0 times theorem prover too weak. 1767 trivial. 0 not checked. [2024-10-10 22:10:55,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441375612] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:10:55,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:10:55,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 18] total 48 [2024-10-10 22:10:55,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687211019] [2024-10-10 22:10:55,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:10:55,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-10-10 22:10:55,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:10:55,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-10-10 22:10:55,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=1758, Unknown=0, NotChecked=0, Total=2256 [2024-10-10 22:10:55,573 INFO L87 Difference]: Start difference. First operand 238 states and 283 transitions. Second operand has 48 states, 48 states have (on average 2.125) internal successors, (102), 48 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:59,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:10:59,927 INFO L93 Difference]: Finished difference Result 1333 states and 1593 transitions. [2024-10-10 22:10:59,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2024-10-10 22:10:59,928 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.125) internal successors, (102), 48 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2024-10-10 22:10:59,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:10:59,932 INFO L225 Difference]: With dead ends: 1333 [2024-10-10 22:10:59,932 INFO L226 Difference]: Without dead ends: 1113 [2024-10-10 22:10:59,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9040 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=6066, Invalid=20340, Unknown=0, NotChecked=0, Total=26406 [2024-10-10 22:10:59,939 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 4087 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 1095 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4087 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 1994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1095 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:10:59,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4087 Valid, 490 Invalid, 1994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1095 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 22:10:59,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2024-10-10 22:11:00,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 782. [2024-10-10 22:11:00,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 781 states have (on average 1.176696542893726) internal successors, (919), 781 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:11:00,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 919 transitions. [2024-10-10 22:11:00,099 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 919 transitions. Word has length 160 [2024-10-10 22:11:00,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:11:00,100 INFO L471 AbstractCegarLoop]: Abstraction has 782 states and 919 transitions. [2024-10-10 22:11:00,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.125) internal successors, (102), 48 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:11:00,100 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 919 transitions. [2024-10-10 22:11:00,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2024-10-10 22:11:00,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:11:00,106 INFO L215 NwaCegarLoop]: trace histogram [364, 28, 28, 28, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:11:00,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-10 22:11:00,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-10 22:11:00,308 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:11:00,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:11:00,308 INFO L85 PathProgramCache]: Analyzing trace with hash 114632436, now seen corresponding path program 6 times [2024-10-10 22:11:00,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:11:00,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771041558] [2024-10-10 22:11:00,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:11:00,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:11:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:11:02,633 INFO L134 CoverageAnalysis]: Checked inductivity of 77532 backedges. 5327 proven. 91 refuted. 0 times theorem prover too weak. 72114 trivial. 0 not checked. [2024-10-10 22:11:02,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:11:02,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771041558] [2024-10-10 22:11:02,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771041558] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:11:02,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460023075] [2024-10-10 22:11:02,635 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-10 22:11:02,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:11:02,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:11:02,636 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:11:02,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-10 22:11:03,076 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-10-10 22:11:03,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:11:03,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 22:11:03,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:11:04,289 INFO L134 CoverageAnalysis]: Checked inductivity of 77532 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 77531 trivial. 0 not checked. [2024-10-10 22:11:04,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:11:04,835 INFO L134 CoverageAnalysis]: Checked inductivity of 77532 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 77531 trivial. 0 not checked. [2024-10-10 22:11:04,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460023075] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:11:04,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:11:04,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 4, 4] total 22 [2024-10-10 22:11:04,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011162676] [2024-10-10 22:11:04,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:11:04,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-10 22:11:04,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:11:04,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-10 22:11:04,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2024-10-10 22:11:04,839 INFO L87 Difference]: Start difference. First operand 782 states and 919 transitions. Second operand has 23 states, 23 states have (on average 4.739130434782608) internal successors, (109), 22 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:11:06,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:11:06,578 INFO L93 Difference]: Finished difference Result 2757 states and 3402 transitions. [2024-10-10 22:11:06,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-10-10 22:11:06,579 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.739130434782608) internal successors, (109), 22 states have internal predecessors, (109), 0 states have call successors, (0), 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 488 [2024-10-10 22:11:06,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:11:06,587 INFO L225 Difference]: With dead ends: 2757 [2024-10-10 22:11:06,588 INFO L226 Difference]: Without dead ends: 1994 [2024-10-10 22:11:06,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1050 GetRequests, 969 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1905 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2155, Invalid=4651, Unknown=0, NotChecked=0, Total=6806 [2024-10-10 22:11:06,591 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 2118 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2118 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:11:06,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2118 Valid, 97 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:11:06,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2024-10-10 22:11:06,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 852. [2024-10-10 22:11:06,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 851 states have (on average 1.1774383078730906) internal successors, (1002), 851 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:11:06,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1002 transitions. [2024-10-10 22:11:06,765 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1002 transitions. Word has length 488 [2024-10-10 22:11:06,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:11:06,766 INFO L471 AbstractCegarLoop]: Abstraction has 852 states and 1002 transitions. [2024-10-10 22:11:06,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.739130434782608) internal successors, (109), 22 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:11:06,766 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1002 transitions. [2024-10-10 22:11:06,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2024-10-10 22:11:06,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:11:06,774 INFO L215 NwaCegarLoop]: trace histogram [392, 28, 28, 28, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:11:06,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-10 22:11:06,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-10 22:11:06,975 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:11:06,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:11:06,975 INFO L85 PathProgramCache]: Analyzing trace with hash -577488202, now seen corresponding path program 7 times [2024-10-10 22:11:06,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:11:06,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046502210] [2024-10-10 22:11:06,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:11:06,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:11:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:11:09,415 INFO L134 CoverageAnalysis]: Checked inductivity of 88961 backedges. 6110 proven. 105 refuted. 0 times theorem prover too weak. 82746 trivial. 0 not checked. [2024-10-10 22:11:09,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:11:09,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046502210] [2024-10-10 22:11:09,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046502210] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:11:09,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829880498] [2024-10-10 22:11:09,416 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-10 22:11:09,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:11:09,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:11:09,418 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:11:09,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-10 22:11:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:11:10,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 3918 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-10 22:11:10,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:11:10,660 INFO L134 CoverageAnalysis]: Checked inductivity of 88961 backedges. 6110 proven. 105 refuted. 0 times theorem prover too weak. 82746 trivial. 0 not checked. [2024-10-10 22:11:10,660 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:11:11,036 INFO L134 CoverageAnalysis]: Checked inductivity of 88961 backedges. 6110 proven. 105 refuted. 0 times theorem prover too weak. 82746 trivial. 0 not checked. [2024-10-10 22:11:11,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829880498] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:11:11,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:11:11,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 48 [2024-10-10 22:11:11,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330874646] [2024-10-10 22:11:11,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:11:11,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-10-10 22:11:11,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:11:11,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-10 22:11:11,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1027, Invalid=1325, Unknown=0, NotChecked=0, Total=2352 [2024-10-10 22:11:11,040 INFO L87 Difference]: Start difference. First operand 852 states and 1002 transitions. Second operand has 49 states, 49 states have (on average 1.7959183673469388) internal successors, (88), 48 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:11:12,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:11:12,018 INFO L93 Difference]: Finished difference Result 2555 states and 3526 transitions. [2024-10-10 22:11:12,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-10 22:11:12,019 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.7959183673469388) internal successors, (88), 48 states have internal predecessors, (88), 0 states have call successors, (0), 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 537 [2024-10-10 22:11:12,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:11:12,027 INFO L225 Difference]: With dead ends: 2555 [2024-10-10 22:11:12,028 INFO L226 Difference]: Without dead ends: 1723 [2024-10-10 22:11:12,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1104 GetRequests, 1042 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1552, Invalid=2480, Unknown=0, NotChecked=0, Total=4032 [2024-10-10 22:11:12,031 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 696 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:11:12,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 304 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:11:12,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2024-10-10 22:11:12,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1636. [2024-10-10 22:11:12,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1635 states have (on average 1.1608562691131499) internal successors, (1898), 1635 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:11:12,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 1898 transitions. [2024-10-10 22:11:12,273 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 1898 transitions. Word has length 537 [2024-10-10 22:11:12,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:11:12,274 INFO L471 AbstractCegarLoop]: Abstraction has 1636 states and 1898 transitions. [2024-10-10 22:11:12,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.7959183673469388) internal successors, (88), 48 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:11:12,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 1898 transitions. [2024-10-10 22:11:12,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 986 [2024-10-10 22:11:12,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:11:12,297 INFO L215 NwaCegarLoop]: trace histogram [840, 28, 28, 28, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:11:12,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-10 22:11:12,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:11:12,498 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:11:12,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:11:12,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1614767434, now seen corresponding path program 8 times [2024-10-10 22:11:12,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:11:12,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116392611] [2024-10-10 22:11:12,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:11:12,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:11:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:11:18,748 INFO L134 CoverageAnalysis]: Checked inductivity of 377249 backedges. 25982 proven. 465 refuted. 0 times theorem prover too weak. 350802 trivial. 0 not checked. [2024-10-10 22:11:18,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:11:18,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116392611] [2024-10-10 22:11:18,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116392611] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:11:18,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802287991] [2024-10-10 22:11:18,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 22:11:18,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:11:18,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:11:18,752 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:11:18,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-10 22:11:20,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 22:11:20,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:11:20,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 7950 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-10 22:11:20,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:11:21,299 INFO L134 CoverageAnalysis]: Checked inductivity of 377249 backedges. 25982 proven. 465 refuted. 0 times theorem prover too weak. 350802 trivial. 0 not checked. [2024-10-10 22:11:21,300 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:11:22,536 INFO L134 CoverageAnalysis]: Checked inductivity of 377249 backedges. 25982 proven. 465 refuted. 0 times theorem prover too weak. 350802 trivial. 0 not checked. [2024-10-10 22:11:22,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802287991] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:11:22,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:11:22,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 96 [2024-10-10 22:11:22,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282056120] [2024-10-10 22:11:22,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:11:22,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2024-10-10 22:11:22,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:11:22,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2024-10-10 22:11:22,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4099, Invalid=5213, Unknown=0, NotChecked=0, Total=9312 [2024-10-10 22:11:22,543 INFO L87 Difference]: Start difference. First operand 1636 states and 1898 transitions. Second operand has 97 states, 97 states have (on average 1.402061855670103) internal successors, (136), 96 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:11:25,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:11:25,254 INFO L93 Difference]: Finished difference Result 4987 states and 6854 transitions. [2024-10-10 22:11:25,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-10-10 22:11:25,254 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 1.402061855670103) internal successors, (136), 96 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 985 [2024-10-10 22:11:25,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:11:25,268 INFO L225 Difference]: With dead ends: 4987 [2024-10-10 22:11:25,268 INFO L226 Difference]: Without dead ends: 3387 [2024-10-10 22:11:25,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2032 GetRequests, 1906 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5825 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=6176, Invalid=10080, Unknown=0, NotChecked=0, Total=16256 [2024-10-10 22:11:25,274 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 1966 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 610 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1966 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 610 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:11:25,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1966 Valid, 347 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [610 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:11:25,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3387 states. [2024-10-10 22:11:25,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3387 to 3204. [2024-10-10 22:11:25,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3204 states, 3203 states have (on average 1.1520449578520138) internal successors, (3690), 3203 states have internal predecessors, (3690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:11:25,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3204 states to 3204 states and 3690 transitions. [2024-10-10 22:11:25,856 INFO L78 Accepts]: Start accepts. Automaton has 3204 states and 3690 transitions. Word has length 985 [2024-10-10 22:11:25,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:11:25,858 INFO L471 AbstractCegarLoop]: Abstraction has 3204 states and 3690 transitions. [2024-10-10 22:11:25,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 1.402061855670103) internal successors, (136), 96 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:11:25,858 INFO L276 IsEmpty]: Start isEmpty. Operand 3204 states and 3690 transitions. [2024-10-10 22:11:25,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1882 [2024-10-10 22:11:25,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:11:25,881 INFO L215 NwaCegarLoop]: trace histogram [1736, 28, 28, 28, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:11:25,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-10 22:11:26,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-10 22:11:26,082 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:11:26,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:11:26,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1445550774, now seen corresponding path program 9 times [2024-10-10 22:11:26,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:11:26,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779950790] [2024-10-10 22:11:26,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:11:26,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:11:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:11:46,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1555937 backedges. 107198 proven. 1953 refuted. 0 times theorem prover too weak. 1446786 trivial. 0 not checked. [2024-10-10 22:11:46,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:11:46,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779950790] [2024-10-10 22:11:46,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779950790] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:11:46,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84992643] [2024-10-10 22:11:46,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-10 22:11:46,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:11:46,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:11:46,831 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:11:46,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-10 22:11:48,558 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-10 22:11:48,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:11:48,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 22:11:48,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:11:50,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1555937 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1555936 trivial. 0 not checked. [2024-10-10 22:11:50,379 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:11:52,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1555937 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1555936 trivial. 0 not checked. [2024-10-10 22:11:52,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84992643] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:11:52,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:11:52,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 4, 4] total 71 [2024-10-10 22:11:52,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692145529] [2024-10-10 22:11:52,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:11:52,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2024-10-10 22:11:52,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:11:52,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2024-10-10 22:11:52,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2106, Invalid=3006, Unknown=0, NotChecked=0, Total=5112 [2024-10-10 22:11:52,136 INFO L87 Difference]: Start difference. First operand 3204 states and 3690 transitions. Second operand has 72 states, 72 states have (on average 1.9444444444444444) internal successors, (140), 71 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)