./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 20:42:42,647 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 20:42:42,704 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 20:42:42,709 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 20:42:42,710 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 20:42:42,740 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 20:42:42,740 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 20:42:42,740 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 20:42:42,741 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 20:42:42,741 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 20:42:42,741 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 20:42:42,741 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 20:42:42,742 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 20:42:42,742 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 20:42:42,742 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 20:42:42,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 20:42:42,743 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 20:42:42,743 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 20:42:42,743 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 20:42:42,743 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 20:42:42,743 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 20:42:42,744 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 20:42:42,744 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 20:42:42,744 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 20:42:42,745 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 20:42:42,745 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 20:42:42,745 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 20:42:42,745 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 20:42:42,746 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 20:42:42,746 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 20:42:42,746 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 20:42:42,746 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 20:42:42,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:42:42,747 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 20:42:42,747 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 20:42:42,747 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 20:42:42,748 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 20:42:42,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 20:42:42,748 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 20:42:42,748 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 20:42:42,748 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 20:42:42,749 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 20:42:42,749 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a [2024-11-19 20:42:42,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 20:42:43,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 20:42:43,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 20:42:43,026 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 20:42:43,027 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 20:42:43,028 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i [2024-11-19 20:42:44,399 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 20:42:44,564 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 20:42:44,565 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i [2024-11-19 20:42:44,576 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa23f90f4/2455a5e7280046b79c6468cb36814b23/FLAGbcdd4df29 [2024-11-19 20:42:44,586 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa23f90f4/2455a5e7280046b79c6468cb36814b23 [2024-11-19 20:42:44,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 20:42:44,589 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 20:42:44,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 20:42:44,590 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 20:42:44,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 20:42:44,596 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:42:44" (1/1) ... [2024-11-19 20:42:44,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d67a47d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:44, skipping insertion in model container [2024-11-19 20:42:44,597 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:42:44" (1/1) ... [2024-11-19 20:42:44,620 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 20:42:44,746 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2024-11-19 20:42:44,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:42:44,824 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 20:42:44,839 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] [2024-11-19 20:42:44,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:42:44,898 INFO L204 MainTranslator]: Completed translation [2024-11-19 20:42:44,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:44 WrapperNode [2024-11-19 20:42:44,899 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 20:42:44,899 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 20:42:44,899 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 20:42:44,899 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 20:42:44,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:44" (1/1) ... [2024-11-19 20:42:44,914 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:44" (1/1) ... [2024-11-19 20:42:44,934 INFO L138 Inliner]: procedures = 124, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 88 [2024-11-19 20:42:44,934 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 20:42:44,935 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 20:42:44,935 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 20:42:44,935 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 20:42:44,942 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:44" (1/1) ... [2024-11-19 20:42:44,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:44" (1/1) ... [2024-11-19 20:42:44,945 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:44" (1/1) ... [2024-11-19 20:42:44,967 INFO L175 MemorySlicer]: Split 23 memory accesses to 2 slices as follows [2, 21]. 91 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2024-11-19 20:42:44,967 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:44" (1/1) ... [2024-11-19 20:42:44,968 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:44" (1/1) ... [2024-11-19 20:42:44,976 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:44" (1/1) ... [2024-11-19 20:42:44,983 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:44" (1/1) ... [2024-11-19 20:42:44,985 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:44" (1/1) ... [2024-11-19 20:42:44,986 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:44" (1/1) ... [2024-11-19 20:42:44,988 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 20:42:44,989 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 20:42:44,989 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 20:42:44,989 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 20:42:44,990 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:44" (1/1) ... [2024-11-19 20:42:44,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:42:45,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:42:45,031 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 20:42:45,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 20:42:45,097 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2024-11-19 20:42:45,098 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2024-11-19 20:42:45,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 20:42:45,099 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 20:42:45,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 20:42:45,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 20:42:45,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 20:42:45,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 20:42:45,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 20:42:45,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 20:42:45,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 20:42:45,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 20:42:45,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 20:42:45,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 20:42:45,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 20:42:45,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 20:42:45,192 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 20:42:45,194 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 20:42:45,386 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-11-19 20:42:45,386 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 20:42:45,402 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 20:42:45,403 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 20:42:45,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:42:45 BoogieIcfgContainer [2024-11-19 20:42:45,404 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 20:42:45,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 20:42:45,407 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 20:42:45,409 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 20:42:45,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:42:44" (1/3) ... [2024-11-19 20:42:45,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@167ecfd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:42:45, skipping insertion in model container [2024-11-19 20:42:45,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:42:44" (2/3) ... [2024-11-19 20:42:45,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@167ecfd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:42:45, skipping insertion in model container [2024-11-19 20:42:45,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:42:45" (3/3) ... [2024-11-19 20:42:45,412 INFO L112 eAbstractionObserver]: Analyzing ICFG dancing.i [2024-11-19 20:42:45,434 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 20:42:45,435 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 20:42:45,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 20:42:45,492 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;@4e710955, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 20:42:45,492 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 20:42:45,495 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 20:42:45,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 20:42:45,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:42:45,501 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-11-19 20:42:45,502 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:42:45,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:42:45,506 INFO L85 PathProgramCache]: Analyzing trace with hash 329443655, now seen corresponding path program 1 times [2024-11-19 20:42:45,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:42:45,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240559717] [2024-11-19 20:42:45,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:45,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:42:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:45,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:42:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:45,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:42:45,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:42:45,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240559717] [2024-11-19 20:42:45,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240559717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:42:45,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:42:45,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 20:42:45,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235738815] [2024-11-19 20:42:45,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:42:45,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 20:42:45,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:42:45,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 20:42:45,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 20:42:45,758 INFO L87 Difference]: Start difference. First operand has 43 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:42:45,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:42:45,773 INFO L93 Difference]: Finished difference Result 79 states and 109 transitions. [2024-11-19 20:42:45,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 20:42:45,775 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-11-19 20:42:45,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:42:45,780 INFO L225 Difference]: With dead ends: 79 [2024-11-19 20:42:45,780 INFO L226 Difference]: Without dead ends: 39 [2024-11-19 20:42:45,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 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-11-19 20:42:45,785 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:42:45,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:42:45,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-19 20:42:45,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-19 20:42:45,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 31 states have internal predecessors, (41), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 20:42:45,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2024-11-19 20:42:45,813 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 20 [2024-11-19 20:42:45,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:42:45,814 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2024-11-19 20:42:45,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:42:45,814 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2024-11-19 20:42:45,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 20:42:45,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:42:45,815 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-11-19 20:42:45,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 20:42:45,816 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:42:45,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:42:45,816 INFO L85 PathProgramCache]: Analyzing trace with hash -654440058, now seen corresponding path program 1 times [2024-11-19 20:42:45,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:42:45,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209005596] [2024-11-19 20:42:45,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:45,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:42:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:46,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 20:42:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:46,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:42:46,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:42:46,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209005596] [2024-11-19 20:42:46,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209005596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:42:46,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:42:46,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 20:42:46,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784529748] [2024-11-19 20:42:46,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:42:46,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 20:42:46,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:42:46,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 20:42:46,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 20:42:46,027 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:42:46,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:42:46,070 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2024-11-19 20:42:46,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 20:42:46,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-19 20:42:46,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:42:46,071 INFO L225 Difference]: With dead ends: 47 [2024-11-19 20:42:46,072 INFO L226 Difference]: Without dead ends: 45 [2024-11-19 20:42:46,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 20:42:46,073 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 3 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:42:46,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 189 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:42:46,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-19 20:42:46,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2024-11-19 20:42:46,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 35 states have internal predecessors, (44), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 20:42:46,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2024-11-19 20:42:46,079 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 57 transitions. Word has length 21 [2024-11-19 20:42:46,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:42:46,080 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 57 transitions. [2024-11-19 20:42:46,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:42:46,080 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2024-11-19 20:42:46,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 20:42:46,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:42:46,081 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:42:46,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 20:42:46,082 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:42:46,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:42:46,084 INFO L85 PathProgramCache]: Analyzing trace with hash -698021828, now seen corresponding path program 1 times [2024-11-19 20:42:46,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:42:46,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577237839] [2024-11-19 20:42:46,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:46,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:42:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:46,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 20:42:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:46,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 20:42:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:46,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 20:42:46,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:42:46,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577237839] [2024-11-19 20:42:46,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577237839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:42:46,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:42:46,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 20:42:46,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839118229] [2024-11-19 20:42:46,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:42:46,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 20:42:46,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:42:46,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 20:42:46,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:42:46,241 INFO L87 Difference]: Start difference. First operand 44 states and 57 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:42:46,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:42:46,283 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2024-11-19 20:42:46,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 20:42:46,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2024-11-19 20:42:46,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:42:46,285 INFO L225 Difference]: With dead ends: 90 [2024-11-19 20:42:46,287 INFO L226 Difference]: Without dead ends: 67 [2024-11-19 20:42:46,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 20:42:46,288 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 17 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:42:46,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 142 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:42:46,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-19 20:42:46,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2024-11-19 20:42:46,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 48 states have internal predecessors, (62), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-19 20:42:46,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2024-11-19 20:42:46,303 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 77 transitions. Word has length 27 [2024-11-19 20:42:46,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:42:46,303 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 77 transitions. [2024-11-19 20:42:46,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:42:46,303 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2024-11-19 20:42:46,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 20:42:46,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:42:46,305 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:42:46,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 20:42:46,306 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:42:46,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:42:46,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1050140346, now seen corresponding path program 1 times [2024-11-19 20:42:46,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:42:46,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946245756] [2024-11-19 20:42:46,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:46,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:42:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:46,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 20:42:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:46,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 20:42:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:46,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 20:42:46,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:42:46,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946245756] [2024-11-19 20:42:46,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946245756] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:42:46,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816459477] [2024-11-19 20:42:46,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:46,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:42:46,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:42:46,477 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:42:46,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 20:42:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:46,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 20:42:46,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:42:46,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:42:46,695 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:42:46,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 20:42:46,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816459477] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:42:46,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:42:46,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-11-19 20:42:46,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563432620] [2024-11-19 20:42:46,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:42:46,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 20:42:46,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:42:46,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 20:42:46,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-19 20:42:46,832 INFO L87 Difference]: Start difference. First operand 58 states and 77 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 20:42:47,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:42:47,164 INFO L93 Difference]: Finished difference Result 107 states and 149 transitions. [2024-11-19 20:42:47,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 20:42:47,164 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) Word has length 32 [2024-11-19 20:42:47,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:42:47,166 INFO L225 Difference]: With dead ends: 107 [2024-11-19 20:42:47,166 INFO L226 Difference]: Without dead ends: 71 [2024-11-19 20:42:47,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2024-11-19 20:42:47,168 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 81 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 20:42:47,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 521 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 20:42:47,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-19 20:42:47,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2024-11-19 20:42:47,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 56 states have internal predecessors, (70), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-19 20:42:47,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 92 transitions. [2024-11-19 20:42:47,176 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 92 transitions. Word has length 32 [2024-11-19 20:42:47,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:42:47,176 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 92 transitions. [2024-11-19 20:42:47,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 1 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 20:42:47,177 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 92 transitions. [2024-11-19 20:42:47,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 20:42:47,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:42:47,178 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:42:47,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 20:42:47,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:42:47,382 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:42:47,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:42:47,383 INFO L85 PathProgramCache]: Analyzing trace with hash 94816722, now seen corresponding path program 1 times [2024-11-19 20:42:47,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:42:47,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661614640] [2024-11-19 20:42:47,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:47,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:42:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:47,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 20:42:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:47,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 20:42:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:47,509 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 20:42:47,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:42:47,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661614640] [2024-11-19 20:42:47,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661614640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:42:47,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:42:47,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 20:42:47,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959005239] [2024-11-19 20:42:47,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:42:47,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 20:42:47,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:42:47,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 20:42:47,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 20:42:47,512 INFO L87 Difference]: Start difference. First operand 67 states and 92 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 20:42:47,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:42:47,543 INFO L93 Difference]: Finished difference Result 78 states and 108 transitions. [2024-11-19 20:42:47,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 20:42:47,544 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-11-19 20:42:47,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:42:47,544 INFO L225 Difference]: With dead ends: 78 [2024-11-19 20:42:47,545 INFO L226 Difference]: Without dead ends: 76 [2024-11-19 20:42:47,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 20:42:47,545 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 3 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:42:47,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 300 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:42:47,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-19 20:42:47,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2024-11-19 20:42:47,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 62 states have internal predecessors, (75), 11 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (19), 8 states have call predecessors, (19), 10 states have call successors, (19) [2024-11-19 20:42:47,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 105 transitions. [2024-11-19 20:42:47,553 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 105 transitions. Word has length 34 [2024-11-19 20:42:47,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:42:47,554 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 105 transitions. [2024-11-19 20:42:47,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 20:42:47,554 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 105 transitions. [2024-11-19 20:42:47,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 20:42:47,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:42:47,555 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:42:47,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 20:42:47,555 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:42:47,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:42:47,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1911567681, now seen corresponding path program 1 times [2024-11-19 20:42:47,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:42:47,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836880640] [2024-11-19 20:42:47,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:47,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:42:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:47,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 20:42:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:47,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 20:42:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:47,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-19 20:42:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:47,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 20:42:47,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:42:47,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836880640] [2024-11-19 20:42:47,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836880640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:42:47,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:42:47,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 20:42:47,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592702911] [2024-11-19 20:42:47,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:42:47,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 20:42:47,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:42:47,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 20:42:47,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 20:42:47,874 INFO L87 Difference]: Start difference. First operand 75 states and 105 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 20:42:47,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:42:47,972 INFO L93 Difference]: Finished difference Result 126 states and 175 transitions. [2024-11-19 20:42:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 20:42:47,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2024-11-19 20:42:47,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:42:47,973 INFO L225 Difference]: With dead ends: 126 [2024-11-19 20:42:47,973 INFO L226 Difference]: Without dead ends: 95 [2024-11-19 20:42:47,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 20:42:47,974 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 19 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:42:47,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 170 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 20:42:47,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-19 20:42:47,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2024-11-19 20:42:47,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 71 states have internal predecessors, (87), 12 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (22), 9 states have call predecessors, (22), 11 states have call successors, (22) [2024-11-19 20:42:47,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 121 transitions. [2024-11-19 20:42:47,984 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 121 transitions. Word has length 36 [2024-11-19 20:42:47,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:42:47,984 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 121 transitions. [2024-11-19 20:42:47,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 20:42:47,984 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2024-11-19 20:42:47,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 20:42:47,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:42:47,985 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:42:47,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 20:42:47,985 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:42:47,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:42:47,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1692712963, now seen corresponding path program 1 times [2024-11-19 20:42:47,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:42:47,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741707640] [2024-11-19 20:42:47,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:47,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:42:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:48,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 20:42:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:48,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 20:42:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:48,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-19 20:42:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:48,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 20:42:48,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:42:48,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741707640] [2024-11-19 20:42:48,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741707640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:42:48,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:42:48,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 20:42:48,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518568828] [2024-11-19 20:42:48,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:42:48,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 20:42:48,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:42:48,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 20:42:48,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 20:42:48,073 INFO L87 Difference]: Start difference. First operand 85 states and 121 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 20:42:48,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:42:48,096 INFO L93 Difference]: Finished difference Result 92 states and 127 transitions. [2024-11-19 20:42:48,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 20:42:48,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-11-19 20:42:48,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:42:48,097 INFO L225 Difference]: With dead ends: 92 [2024-11-19 20:42:48,097 INFO L226 Difference]: Without dead ends: 85 [2024-11-19 20:42:48,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 20:42:48,098 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 3 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:42:48,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 254 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:42:48,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-19 20:42:48,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2024-11-19 20:42:48,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 61 states have internal predecessors, (77), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (17), 8 states have call predecessors, (17), 8 states have call successors, (17) [2024-11-19 20:42:48,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2024-11-19 20:42:48,105 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 103 transitions. Word has length 36 [2024-11-19 20:42:48,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:42:48,106 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 103 transitions. [2024-11-19 20:42:48,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 20:42:48,106 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 103 transitions. [2024-11-19 20:42:48,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 20:42:48,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:42:48,107 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:42:48,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 20:42:48,107 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:42:48,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:42:48,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1295305490, now seen corresponding path program 1 times [2024-11-19 20:42:48,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:42:48,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854346218] [2024-11-19 20:42:48,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:48,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:42:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:48,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 20:42:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:48,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 20:42:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:48,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-19 20:42:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:48,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 20:42:48,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:42:48,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854346218] [2024-11-19 20:42:48,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854346218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:42:48,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:42:48,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 20:42:48,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864652578] [2024-11-19 20:42:48,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:42:48,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 20:42:48,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:42:48,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 20:42:48,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 20:42:48,226 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 20:42:48,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:42:48,278 INFO L93 Difference]: Finished difference Result 123 states and 166 transitions. [2024-11-19 20:42:48,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 20:42:48,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2024-11-19 20:42:48,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:42:48,279 INFO L225 Difference]: With dead ends: 123 [2024-11-19 20:42:48,279 INFO L226 Difference]: Without dead ends: 57 [2024-11-19 20:42:48,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 20:42:48,280 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 14 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:42:48,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 163 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:42:48,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-19 20:42:48,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2024-11-19 20:42:48,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 44 states have internal predecessors, (53), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-19 20:42:48,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 71 transitions. [2024-11-19 20:42:48,286 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 71 transitions. Word has length 37 [2024-11-19 20:42:48,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:42:48,286 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 71 transitions. [2024-11-19 20:42:48,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 20:42:48,286 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 71 transitions. [2024-11-19 20:42:48,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 20:42:48,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:42:48,287 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:42:48,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 20:42:48,287 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:42:48,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:42:48,288 INFO L85 PathProgramCache]: Analyzing trace with hash 569979573, now seen corresponding path program 1 times [2024-11-19 20:42:48,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:42:48,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428571215] [2024-11-19 20:42:48,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:48,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:42:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:48,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 20:42:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:48,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 20:42:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:48,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:42:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:48,397 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 20:42:48,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:42:48,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428571215] [2024-11-19 20:42:48,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428571215] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:42:48,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540023347] [2024-11-19 20:42:48,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:48,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:42:48,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:42:48,399 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:42:48,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 20:42:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:48,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-19 20:42:48,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:42:48,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2024-11-19 20:42:48,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:42:48,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-19 20:42:48,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2024-11-19 20:42:48,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:42:48,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 20:42:48,788 INFO L349 Elim1Store]: treesize reduction 12, result has 77.4 percent of original size [2024-11-19 20:42:48,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 57 [2024-11-19 20:42:48,798 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-19 20:42:48,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2024-11-19 20:42:48,843 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 20:42:48,843 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:42:48,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-11-19 20:42:48,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:42:48,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2024-11-19 20:42:48,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:42:48,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 28 [2024-11-19 20:42:49,000 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-19 20:42:49,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2024-11-19 20:42:49,026 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-19 20:42:49,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540023347] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:42:49,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:42:49,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 7] total 16 [2024-11-19 20:42:49,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191399495] [2024-11-19 20:42:49,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:42:49,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 20:42:49,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:42:49,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 20:42:49,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-11-19 20:42:49,028 INFO L87 Difference]: Start difference. First operand 54 states and 71 transitions. Second operand has 16 states, 16 states have (on average 3.875) internal successors, (62), 15 states have internal predecessors, (62), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-19 20:42:49,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:42:49,564 INFO L93 Difference]: Finished difference Result 162 states and 215 transitions. [2024-11-19 20:42:49,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 20:42:49,565 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 15 states have internal predecessors, (62), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 40 [2024-11-19 20:42:49,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:42:49,567 INFO L225 Difference]: With dead ends: 162 [2024-11-19 20:42:49,567 INFO L226 Difference]: Without dead ends: 119 [2024-11-19 20:42:49,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2024-11-19 20:42:49,568 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 135 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 20:42:49,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 634 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 20:42:49,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-19 20:42:49,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 98. [2024-11-19 20:42:49,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 79 states have internal predecessors, (94), 14 states have call successors, (14), 6 states have call predecessors, (14), 10 states have return successors, (20), 12 states have call predecessors, (20), 12 states have call successors, (20) [2024-11-19 20:42:49,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 128 transitions. [2024-11-19 20:42:49,579 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 128 transitions. Word has length 40 [2024-11-19 20:42:49,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:42:49,580 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 128 transitions. [2024-11-19 20:42:49,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 15 states have internal predecessors, (62), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-19 20:42:49,580 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 128 transitions. [2024-11-19 20:42:49,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 20:42:49,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:42:49,581 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:42:49,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 20:42:49,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-19 20:42:49,782 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:42:49,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:42:49,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1413843308, now seen corresponding path program 1 times [2024-11-19 20:42:49,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:42:49,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161298139] [2024-11-19 20:42:49,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:49,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:42:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:50,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 20:42:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:50,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:42:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:50,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-19 20:42:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:50,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:42:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:50,030 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-19 20:42:50,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:42:50,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161298139] [2024-11-19 20:42:50,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161298139] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:42:50,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913821679] [2024-11-19 20:42:50,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:50,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:42:50,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:42:50,033 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:42:50,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 20:42:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:50,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-19 20:42:50,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:42:50,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:42:50,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2024-11-19 20:42:50,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:42:50,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-19 20:42:50,514 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 20:42:50,514 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:42:50,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913821679] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:42:50,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:42:50,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2024-11-19 20:42:50,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553719956] [2024-11-19 20:42:50,568 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:42:50,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 20:42:50,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:42:50,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 20:42:50,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2024-11-19 20:42:50,569 INFO L87 Difference]: Start difference. First operand 98 states and 128 transitions. Second operand has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-19 20:42:51,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:42:51,382 INFO L93 Difference]: Finished difference Result 182 states and 232 transitions. [2024-11-19 20:42:51,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 20:42:51,384 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 46 [2024-11-19 20:42:51,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:42:51,385 INFO L225 Difference]: With dead ends: 182 [2024-11-19 20:42:51,385 INFO L226 Difference]: Without dead ends: 114 [2024-11-19 20:42:51,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=222, Invalid=900, Unknown=0, NotChecked=0, Total=1122 [2024-11-19 20:42:51,386 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 124 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 20:42:51,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 558 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 20:42:51,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-19 20:42:51,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 72. [2024-11-19 20:42:51,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 59 states have internal predecessors, (70), 9 states have call successors, (9), 4 states have call predecessors, (9), 7 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2024-11-19 20:42:51,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2024-11-19 20:42:51,394 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 46 [2024-11-19 20:42:51,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:42:51,395 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2024-11-19 20:42:51,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-19 20:42:51,395 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2024-11-19 20:42:51,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 20:42:51,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:42:51,396 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:42:51,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 20:42:51,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:42:51,597 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:42:51,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:42:51,597 INFO L85 PathProgramCache]: Analyzing trace with hash -596194858, now seen corresponding path program 1 times [2024-11-19 20:42:51,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:42:51,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014648201] [2024-11-19 20:42:51,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:51,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:42:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:52,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 20:42:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:52,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:42:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:52,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-19 20:42:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:52,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:42:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:52,432 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 20:42:52,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:42:52,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014648201] [2024-11-19 20:42:52,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014648201] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:42:52,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728700382] [2024-11-19 20:42:52,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:42:52,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:42:52,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:42:52,435 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:42:52,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 20:42:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:42:52,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-19 20:42:52,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:42:52,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2024-11-19 20:42:52,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:42:52,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-19 20:42:52,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2024-11-19 20:42:52,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:42:52,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-19 20:42:53,356 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-19 20:42:53,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 31 [2024-11-19 20:42:53,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 20:43:18,156 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 20:43:18,156 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:43:18,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-11-19 20:43:18,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-11-19 20:43:19,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:43:19,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 218 treesize of output 237 [2024-11-19 20:43:19,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:43:19,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 220 treesize of output 154 [2024-11-19 20:43:19,521 INFO L349 Elim1Store]: treesize reduction 68, result has 48.5 percent of original size [2024-11-19 20:43:19,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 774 treesize of output 756 [2024-11-19 20:43:19,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 470 treesize of output 445 [2024-11-19 20:43:19,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 295 treesize of output 285 [2024-11-19 20:43:19,782 INFO L349 Elim1Store]: treesize reduction 44, result has 70.9 percent of original size [2024-11-19 20:43:19,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 862 treesize of output 882 [2024-11-19 20:43:19,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:43:19,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 768 treesize of output 702 [2024-11-19 20:43:19,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 353 treesize of output 321 [2024-11-19 20:43:19,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:43:19,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 489 treesize of output 477 [2024-11-19 20:43:22,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 326 treesize of output 320 [2024-11-19 20:43:23,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 74 [2024-11-19 20:43:24,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 900 treesize of output 882 [2024-11-19 20:43:27,199 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 20:43:27,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:43:27,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 326 treesize of output 306 [2024-11-19 20:43:27,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:43:27,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 287 treesize of output 276 [2024-11-19 20:43:27,514 INFO L349 Elim1Store]: treesize reduction 5, result has 73.7 percent of original size [2024-11-19 20:43:27,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 122 [2024-11-19 20:43:27,544 INFO L349 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2024-11-19 20:43:27,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 116 [2024-11-19 20:43:27,686 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 20:43:27,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:43:27,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 361 treesize of output 359 [2024-11-19 20:43:28,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-19 20:43:28,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-19 20:43:28,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2024-11-19 20:43:28,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 100 [2024-11-19 20:43:28,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-19 20:43:28,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-19 20:43:28,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-19 20:43:28,567 INFO L349 Elim1Store]: treesize reduction 70, result has 1.4 percent of original size [2024-11-19 20:43:28,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 145 treesize of output 1 [2024-11-19 20:43:28,804 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 20:43:28,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728700382] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:43:28,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:43:28,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 15] total 46 [2024-11-19 20:43:28,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146507826] [2024-11-19 20:43:28,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:43:28,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-19 20:43:28,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:43:28,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-19 20:43:28,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1901, Unknown=6, NotChecked=0, Total=2070 [2024-11-19 20:43:28,806 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand has 46 states, 42 states have (on average 2.119047619047619) internal successors, (89), 44 states have internal predecessors, (89), 12 states have call successors, (12), 5 states have call predecessors, (12), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 20:43:34,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:43:43,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:43:47,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:43:55,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:43:59,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:44:03,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:44:15,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:44:19,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 20:44:23,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]