./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound20.c -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 2dec1b2e3c1461164aa09bac8cca047a14ba0fda75d53737804411255b62653a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 22:37:02,318 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 22:37:02,366 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 22:37:02,370 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 22:37:02,371 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 22:37:02,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 22:37:02,401 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 22:37:02,401 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 22:37:02,402 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 22:37:02,403 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 22:37:02,404 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 22:37:02,404 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 22:37:02,404 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 22:37:02,406 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 22:37:02,406 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 22:37:02,406 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 22:37:02,407 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 22:37:02,407 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 22:37:02,407 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 22:37:02,407 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 22:37:02,407 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 22:37:02,408 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 22:37:02,408 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 22:37:02,408 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 22:37:02,408 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 22:37:02,409 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 22:37:02,409 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 22:37:02,409 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 22:37:02,409 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 22:37:02,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 22:37:02,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 22:37:02,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 22:37:02,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:37:02,410 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 22:37:02,411 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 22:37:02,411 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 22:37:02,411 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 22:37:02,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 22:37:02,412 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 22:37:02,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 22:37:02,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 22:37:02,412 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 22:37:02,413 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 -> 2dec1b2e3c1461164aa09bac8cca047a14ba0fda75d53737804411255b62653a [2024-11-09 22:37:02,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 22:37:02,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 22:37:02,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 22:37:02,633 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 22:37:02,633 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 22:37:02,634 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound20.c [2024-11-09 22:37:03,879 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 22:37:04,044 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 22:37:04,045 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound20.c [2024-11-09 22:37:04,053 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02f0be270/8d77ca06d7ad4a1e9a67588a652e6de5/FLAGbc219ada1 [2024-11-09 22:37:04,065 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02f0be270/8d77ca06d7ad4a1e9a67588a652e6de5 [2024-11-09 22:37:04,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 22:37:04,068 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 22:37:04,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 22:37:04,069 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 22:37:04,073 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 22:37:04,074 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:37:04" (1/1) ... [2024-11-09 22:37:04,074 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@544017cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:04, skipping insertion in model container [2024-11-09 22:37:04,075 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:37:04" (1/1) ... [2024-11-09 22:37:04,089 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 22:37:04,226 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/nla-digbench-scaling/fermat1-ll_unwindbound20.c[535,548] [2024-11-09 22:37:04,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:37:04,264 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 22:37:04,274 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/nla-digbench-scaling/fermat1-ll_unwindbound20.c[535,548] [2024-11-09 22:37:04,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:37:04,300 INFO L204 MainTranslator]: Completed translation [2024-11-09 22:37:04,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:04 WrapperNode [2024-11-09 22:37:04,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 22:37:04,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 22:37:04,302 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 22:37:04,302 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 22:37:04,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:04" (1/1) ... [2024-11-09 22:37:04,317 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:04" (1/1) ... [2024-11-09 22:37:04,358 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2024-11-09 22:37:04,360 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 22:37:04,361 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 22:37:04,361 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 22:37:04,361 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 22:37:04,368 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:04" (1/1) ... [2024-11-09 22:37:04,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:04" (1/1) ... [2024-11-09 22:37:04,370 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:04" (1/1) ... [2024-11-09 22:37:04,379 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 22:37:04,379 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:04" (1/1) ... [2024-11-09 22:37:04,380 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:04" (1/1) ... [2024-11-09 22:37:04,382 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:04" (1/1) ... [2024-11-09 22:37:04,382 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:04" (1/1) ... [2024-11-09 22:37:04,383 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:04" (1/1) ... [2024-11-09 22:37:04,383 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:04" (1/1) ... [2024-11-09 22:37:04,384 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 22:37:04,389 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 22:37:04,389 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 22:37:04,389 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 22:37:04,390 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:04" (1/1) ... [2024-11-09 22:37:04,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:37:04,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:04,424 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-09 22:37:04,427 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-09 22:37:04,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 22:37:04,470 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 22:37:04,470 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 22:37:04,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 22:37:04,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 22:37:04,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 22:37:04,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 22:37:04,472 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 22:37:04,527 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 22:37:04,529 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 22:37:04,688 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-09 22:37:04,688 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 22:37:04,698 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 22:37:04,699 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 22:37:04,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:37:04 BoogieIcfgContainer [2024-11-09 22:37:04,700 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 22:37:04,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 22:37:04,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 22:37:04,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 22:37:04,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:37:04" (1/3) ... [2024-11-09 22:37:04,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@606bc30d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:37:04, skipping insertion in model container [2024-11-09 22:37:04,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:04" (2/3) ... [2024-11-09 22:37:04,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@606bc30d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:37:04, skipping insertion in model container [2024-11-09 22:37:04,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:37:04" (3/3) ... [2024-11-09 22:37:04,710 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound20.c [2024-11-09 22:37:04,724 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 22:37:04,725 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 22:37:04,770 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 22:37:04,776 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;@30735c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 22:37:04,777 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 22:37:04,781 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 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-09 22:37:04,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 22:37:04,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:04,787 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:04,787 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:04,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:04,792 INFO L85 PathProgramCache]: Analyzing trace with hash 901631504, now seen corresponding path program 1 times [2024-11-09 22:37:04,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:04,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390854445] [2024-11-09 22:37:04,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:04,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:04,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:04,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:04,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:04,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:04,954 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-09 22:37:04,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:04,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390854445] [2024-11-09 22:37:04,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390854445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:37:04,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:37:04,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 22:37:04,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408948494] [2024-11-09 22:37:04,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:37:04,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 22:37:04,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:04,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 22:37:04,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 22:37:04,984 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 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 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:37:04,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:04,999 INFO L93 Difference]: Finished difference Result 63 states and 96 transitions. [2024-11-09 22:37:05,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 22:37:05,002 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-11-09 22:37:05,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:05,008 INFO L225 Difference]: With dead ends: 63 [2024-11-09 22:37:05,008 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 22:37:05,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-09 22:37:05,013 INFO L432 NwaCegarLoop]: 42 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, 42 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-09 22:37:05,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:37:05,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 22:37:05,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-09 22:37:05,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 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-09 22:37:05,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2024-11-09 22:37:05,043 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 19 [2024-11-09 22:37:05,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:05,043 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-11-09 22:37:05,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 22:37:05,044 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2024-11-09 22:37:05,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 22:37:05,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:05,045 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:05,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 22:37:05,045 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:05,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:05,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1613520884, now seen corresponding path program 1 times [2024-11-09 22:37:05,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:05,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992615824] [2024-11-09 22:37:05,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:05,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:05,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:05,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:05,211 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-09 22:37:05,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:05,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992615824] [2024-11-09 22:37:05,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992615824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:37:05,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:37:05,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 22:37:05,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708787977] [2024-11-09 22:37:05,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:37:05,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 22:37:05,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:05,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 22:37:05,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:37:05,218 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:37:05,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:05,248 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-09 22:37:05,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 22:37:05,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-11-09 22:37:05,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:05,250 INFO L225 Difference]: With dead ends: 39 [2024-11-09 22:37:05,250 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 22:37:05,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:37:05,251 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 5 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:05,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 94 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:37:05,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 22:37:05,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-09 22:37:05,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 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-09 22:37:05,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2024-11-09 22:37:05,260 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 20 [2024-11-09 22:37:05,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:05,271 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2024-11-09 22:37:05,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:37:05,272 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2024-11-09 22:37:05,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 22:37:05,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:05,272 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:05,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 22:37:05,272 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:05,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:05,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1579350607, now seen corresponding path program 1 times [2024-11-09 22:37:05,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:05,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990454255] [2024-11-09 22:37:05,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:05,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:37:05,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [857436066] [2024-11-09 22:37:05,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:05,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:05,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:05,327 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-09 22:37:05,328 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-09 22:37:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:05,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 22:37:05,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:05,573 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-09 22:37:05,573 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:37:05,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:05,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990454255] [2024-11-09 22:37:05,574 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 22:37:05,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857436066] [2024-11-09 22:37:05,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857436066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:37:05,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:37:05,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:37:05,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951219520] [2024-11-09 22:37:05,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:37:05,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:37:05,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:05,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:37:05,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:37:05,576 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:37:06,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:06,522 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2024-11-09 22:37:06,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:37:06,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-11-09 22:37:06,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:06,525 INFO L225 Difference]: With dead ends: 51 [2024-11-09 22:37:06,525 INFO L226 Difference]: Without dead ends: 48 [2024-11-09 22:37:06,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 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-09 22:37:06,527 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 13 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:06,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 108 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 22:37:06,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-09 22:37:06,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-11-09 22:37:06,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 22:37:06,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2024-11-09 22:37:06,542 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 20 [2024-11-09 22:37:06,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:06,542 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2024-11-09 22:37:06,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:37:06,542 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2024-11-09 22:37:06,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 22:37:06,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:06,543 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] [2024-11-09 22:37:06,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 22:37:06,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:06,743 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:06,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:06,744 INFO L85 PathProgramCache]: Analyzing trace with hash 638966704, now seen corresponding path program 1 times [2024-11-09 22:37:06,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:06,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322352499] [2024-11-09 22:37:06,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:06,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:06,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:06,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:06,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:07,002 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:07,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:07,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322352499] [2024-11-09 22:37:07,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322352499] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:07,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515838816] [2024-11-09 22:37:07,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:07,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:07,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:07,006 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-09 22:37:07,007 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-09 22:37:07,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:07,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 22:37:07,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:07,107 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:07,109 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:37:07,215 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:07,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515838816] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:37:07,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:37:07,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 12 [2024-11-09 22:37:07,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225166175] [2024-11-09 22:37:07,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:37:07,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 22:37:07,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:07,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 22:37:07,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-09 22:37:07,218 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 22:37:07,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:07,366 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2024-11-09 22:37:07,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 22:37:07,367 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) Word has length 26 [2024-11-09 22:37:07,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:07,369 INFO L225 Difference]: With dead ends: 55 [2024-11-09 22:37:07,370 INFO L226 Difference]: Without dead ends: 49 [2024-11-09 22:37:07,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-09 22:37:07,372 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:07,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 182 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:37:07,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-09 22:37:07,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2024-11-09 22:37:07,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 6 states have call successors, (6), 3 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-09 22:37:07,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2024-11-09 22:37:07,384 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 26 [2024-11-09 22:37:07,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:07,385 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-11-09 22:37:07,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-09 22:37:07,385 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2024-11-09 22:37:07,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 22:37:07,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:07,386 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:07,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 22:37:07,590 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,SelfDestructingSolverStorable3 [2024-11-09 22:37:07,591 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:07,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:07,591 INFO L85 PathProgramCache]: Analyzing trace with hash 2071350485, now seen corresponding path program 1 times [2024-11-09 22:37:07,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:07,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721706743] [2024-11-09 22:37:07,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:07,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:07,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:07,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:07,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:07,687 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:07,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:07,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721706743] [2024-11-09 22:37:07,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721706743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:37:07,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:37:07,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:37:07,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711990133] [2024-11-09 22:37:07,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:37:07,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:37:07,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:07,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:37:07,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:37:07,689 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 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-09 22:37:07,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:07,735 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2024-11-09 22:37:07,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:37:07,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 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 32 [2024-11-09 22:37:07,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:07,737 INFO L225 Difference]: With dead ends: 63 [2024-11-09 22:37:07,737 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 22:37:07,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:37:07,738 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 12 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:07,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 94 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:37:07,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 22:37:07,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-09 22:37:07,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 22:37:07,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2024-11-09 22:37:07,754 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 32 [2024-11-09 22:37:07,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:07,754 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2024-11-09 22:37:07,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 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-09 22:37:07,754 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2024-11-09 22:37:07,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 22:37:07,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:07,756 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:07,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 22:37:07,756 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:07,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:07,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1300120643, now seen corresponding path program 1 times [2024-11-09 22:37:07,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:07,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504879876] [2024-11-09 22:37:07,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:07,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:07,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:07,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:07,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:07,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 22:37:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:07,846 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 22:37:07,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:07,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504879876] [2024-11-09 22:37:07,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504879876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:37:07,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:37:07,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 22:37:07,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45400186] [2024-11-09 22:37:07,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:37:07,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 22:37:07,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:07,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 22:37:07,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:37:07,847 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 22:37:07,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:07,882 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2024-11-09 22:37:07,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 22:37:07,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2024-11-09 22:37:07,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:07,884 INFO L225 Difference]: With dead ends: 72 [2024-11-09 22:37:07,884 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 22:37:07,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:37:07,885 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 17 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:07,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 113 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:37:07,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 22:37:07,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2024-11-09 22:37:07,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 22:37:07,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2024-11-09 22:37:07,903 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 38 [2024-11-09 22:37:07,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:07,903 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2024-11-09 22:37:07,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 22:37:07,904 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2024-11-09 22:37:07,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 22:37:07,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:07,905 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:07,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 22:37:07,906 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:07,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:07,906 INFO L85 PathProgramCache]: Analyzing trace with hash 727834173, now seen corresponding path program 1 times [2024-11-09 22:37:07,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:07,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126326287] [2024-11-09 22:37:07,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:07,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:07,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:07,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:07,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:07,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 22:37:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:07,979 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 22:37:07,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:07,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126326287] [2024-11-09 22:37:07,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126326287] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:07,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731252937] [2024-11-09 22:37:07,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:07,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:07,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:07,982 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-09 22:37:07,982 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-09 22:37:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:08,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 22:37:08,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:08,066 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:08,066 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:37:08,134 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 22:37:08,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731252937] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:37:08,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:37:08,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2024-11-09 22:37:08,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005892064] [2024-11-09 22:37:08,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:37:08,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 22:37:08,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:08,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 22:37:08,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-09 22:37:08,135 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 7 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 22:37:08,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:08,276 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2024-11-09 22:37:08,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 22:37:08,276 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 7 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 40 [2024-11-09 22:37:08,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:08,277 INFO L225 Difference]: With dead ends: 129 [2024-11-09 22:37:08,277 INFO L226 Difference]: Without dead ends: 107 [2024-11-09 22:37:08,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-09 22:37:08,278 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 65 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:08,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 183 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:37:08,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-09 22:37:08,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 92. [2024-11-09 22:37:08,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 69 states have internal predecessors, (83), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 22:37:08,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 114 transitions. [2024-11-09 22:37:08,297 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 114 transitions. Word has length 40 [2024-11-09 22:37:08,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:08,297 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 114 transitions. [2024-11-09 22:37:08,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 7 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 22:37:08,297 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 114 transitions. [2024-11-09 22:37:08,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 22:37:08,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:08,298 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:08,311 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-09 22:37:08,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:08,502 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:08,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:08,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1932846666, now seen corresponding path program 1 times [2024-11-09 22:37:08,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:08,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961921764] [2024-11-09 22:37:08,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:08,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:08,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:08,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:08,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:08,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 22:37:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:08,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 22:37:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:08,556 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 22:37:08,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:08,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961921764] [2024-11-09 22:37:08,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961921764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:37:08,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:37:08,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 22:37:08,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569924971] [2024-11-09 22:37:08,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:37:08,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 22:37:08,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:08,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 22:37:08,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:37:08,558 INFO L87 Difference]: Start difference. First operand 92 states and 114 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 22:37:08,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:08,610 INFO L93 Difference]: Finished difference Result 156 states and 200 transitions. [2024-11-09 22:37:08,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 22:37:08,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 44 [2024-11-09 22:37:08,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:08,613 INFO L225 Difference]: With dead ends: 156 [2024-11-09 22:37:08,613 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 22:37:08,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 22:37:08,614 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 16 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:08,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 117 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:37:08,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 22:37:08,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 106. [2024-11-09 22:37:08,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 80 states have internal predecessors, (97), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 22:37:08,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 134 transitions. [2024-11-09 22:37:08,652 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 134 transitions. Word has length 44 [2024-11-09 22:37:08,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:08,652 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 134 transitions. [2024-11-09 22:37:08,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 22:37:08,653 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 134 transitions. [2024-11-09 22:37:08,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 22:37:08,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:08,654 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:08,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 22:37:08,654 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:08,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:08,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1799659301, now seen corresponding path program 1 times [2024-11-09 22:37:08,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:08,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202642416] [2024-11-09 22:37:08,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:08,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:08,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:08,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:08,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:08,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 22:37:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:08,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 22:37:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:08,735 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 22:37:08,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:08,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202642416] [2024-11-09 22:37:08,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202642416] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:08,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230089528] [2024-11-09 22:37:08,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:08,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:08,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:08,736 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-09 22:37:08,737 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-09 22:37:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:08,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 22:37:08,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:08,816 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:08,816 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:37:08,892 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 22:37:08,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230089528] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:37:08,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:37:08,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2024-11-09 22:37:08,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449693324] [2024-11-09 22:37:08,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:37:08,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 22:37:08,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:08,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 22:37:08,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-11-09 22:37:08,897 INFO L87 Difference]: Start difference. First operand 106 states and 134 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 9 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2024-11-09 22:37:09,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:09,063 INFO L93 Difference]: Finished difference Result 220 states and 284 transitions. [2024-11-09 22:37:09,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 22:37:09,064 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 9 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) Word has length 46 [2024-11-09 22:37:09,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:09,065 INFO L225 Difference]: With dead ends: 220 [2024-11-09 22:37:09,065 INFO L226 Difference]: Without dead ends: 172 [2024-11-09 22:37:09,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2024-11-09 22:37:09,066 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 104 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:09,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 200 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:37:09,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-09 22:37:09,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 150. [2024-11-09 22:37:09,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 112 states have (on average 1.2410714285714286) internal successors, (139), 113 states have internal predecessors, (139), 28 states have call successors, (28), 10 states have call predecessors, (28), 9 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 22:37:09,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 194 transitions. [2024-11-09 22:37:09,093 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 194 transitions. Word has length 46 [2024-11-09 22:37:09,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:09,093 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 194 transitions. [2024-11-09 22:37:09,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 9 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2024-11-09 22:37:09,093 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 194 transitions. [2024-11-09 22:37:09,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 22:37:09,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:09,094 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:09,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 22:37:09,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:09,298 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:09,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:09,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1232495694, now seen corresponding path program 1 times [2024-11-09 22:37:09,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:09,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548235689] [2024-11-09 22:37:09,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:09,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:09,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:09,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:09,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:09,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 22:37:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:09,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 22:37:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:09,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 22:37:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:09,412 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 22:37:09,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:09,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548235689] [2024-11-09 22:37:09,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548235689] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:09,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584024652] [2024-11-09 22:37:09,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:09,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:09,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:09,415 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:37:09,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 22:37:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:09,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 22:37:09,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:09,515 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:09,516 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:37:09,605 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 22:37:09,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584024652] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:37:09,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:37:09,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 14 [2024-11-09 22:37:09,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089333158] [2024-11-09 22:37:09,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:37:09,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 22:37:09,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:09,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 22:37:09,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-09 22:37:09,608 INFO L87 Difference]: Start difference. First operand 150 states and 194 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 11 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-09 22:37:09,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:09,826 INFO L93 Difference]: Finished difference Result 209 states and 276 transitions. [2024-11-09 22:37:09,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 22:37:09,826 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 11 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) Word has length 52 [2024-11-09 22:37:09,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:09,828 INFO L225 Difference]: With dead ends: 209 [2024-11-09 22:37:09,828 INFO L226 Difference]: Without dead ends: 203 [2024-11-09 22:37:09,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2024-11-09 22:37:09,829 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 109 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:09,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 194 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:37:09,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-09 22:37:09,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 195. [2024-11-09 22:37:09,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 145 states have (on average 1.2344827586206897) internal successors, (179), 149 states have internal predecessors, (179), 38 states have call successors, (38), 12 states have call predecessors, (38), 11 states have return successors, (37), 33 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-09 22:37:09,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 254 transitions. [2024-11-09 22:37:09,865 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 254 transitions. Word has length 52 [2024-11-09 22:37:09,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:09,865 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 254 transitions. [2024-11-09 22:37:09,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 11 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-09 22:37:09,865 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 254 transitions. [2024-11-09 22:37:09,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-09 22:37:09,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:09,866 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:09,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 22:37:10,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 22:37:10,071 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:10,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:10,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1354990665, now seen corresponding path program 1 times [2024-11-09 22:37:10,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:10,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768129649] [2024-11-09 22:37:10,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:10,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:10,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:10,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:10,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:10,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 22:37:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:10,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 22:37:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:10,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 22:37:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:10,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 22:37:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:10,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 22:37:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:10,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 22:37:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:10,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 22:37:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:10,263 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 18 proven. 50 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-09 22:37:10,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:10,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768129649] [2024-11-09 22:37:10,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768129649] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:10,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896313508] [2024-11-09 22:37:10,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:10,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:10,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:10,266 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:37:10,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 22:37:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:10,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 22:37:10,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:10,417 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 62 proven. 110 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-09 22:37:10,418 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:37:10,566 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 18 proven. 50 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-09 22:37:10,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896313508] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:37:10,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:37:10,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 18 [2024-11-09 22:37:10,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249455295] [2024-11-09 22:37:10,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:37:10,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 22:37:10,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:10,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 22:37:10,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2024-11-09 22:37:10,568 INFO L87 Difference]: Start difference. First operand 195 states and 254 transitions. Second operand has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 18 states have internal predecessors, (85), 15 states have call successors, (27), 9 states have call predecessors, (27), 9 states have return successors, (26), 15 states have call predecessors, (26), 15 states have call successors, (26) [2024-11-09 22:37:10,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:10,942 INFO L93 Difference]: Finished difference Result 406 states and 546 transitions. [2024-11-09 22:37:10,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-09 22:37:10,943 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 18 states have internal predecessors, (85), 15 states have call successors, (27), 9 states have call predecessors, (27), 9 states have return successors, (26), 15 states have call predecessors, (26), 15 states have call successors, (26) Word has length 88 [2024-11-09 22:37:10,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:10,945 INFO L225 Difference]: With dead ends: 406 [2024-11-09 22:37:10,945 INFO L226 Difference]: Without dead ends: 347 [2024-11-09 22:37:10,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=311, Invalid=559, Unknown=0, NotChecked=0, Total=870 [2024-11-09 22:37:10,946 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 229 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:10,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 253 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 22:37:10,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-09 22:37:10,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 322. [2024-11-09 22:37:11,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 241 states have (on average 1.2282157676348548) internal successors, (296), 244 states have internal predecessors, (296), 65 states have call successors, (65), 16 states have call predecessors, (65), 15 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-09 22:37:11,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 425 transitions. [2024-11-09 22:37:11,001 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 425 transitions. Word has length 88 [2024-11-09 22:37:11,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:11,002 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 425 transitions. [2024-11-09 22:37:11,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 18 states have internal predecessors, (85), 15 states have call successors, (27), 9 states have call predecessors, (27), 9 states have return successors, (26), 15 states have call predecessors, (26), 15 states have call successors, (26) [2024-11-09 22:37:11,002 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 425 transitions. [2024-11-09 22:37:11,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 22:37:11,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:11,003 INFO L215 NwaCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 8, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:11,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 22:37:11,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:11,207 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:11,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:11,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1926359957, now seen corresponding path program 2 times [2024-11-09 22:37:11,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:11,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048065672] [2024-11-09 22:37:11,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:11,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:11,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:11,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:11,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:11,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 22:37:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:11,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 22:37:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:11,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 22:37:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:11,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 22:37:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:11,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 22:37:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:11,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 22:37:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:11,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 22:37:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:11,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 22:37:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:11,432 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 20 proven. 112 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-09 22:37:11,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:11,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048065672] [2024-11-09 22:37:11,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048065672] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:11,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685235533] [2024-11-09 22:37:11,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 22:37:11,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:11,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:11,434 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:37:11,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 22:37:11,488 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 22:37:11,488 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:37:11,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 22:37:11,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:11,577 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 20 proven. 256 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:11,577 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:37:11,830 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 20 proven. 112 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-09 22:37:11,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685235533] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:37:11,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:37:11,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 24 [2024-11-09 22:37:11,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555223751] [2024-11-09 22:37:11,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:37:11,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 22:37:11,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:11,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 22:37:11,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2024-11-09 22:37:11,832 INFO L87 Difference]: Start difference. First operand 322 states and 425 transitions. Second operand has 24 states, 24 states have (on average 4.416666666666667) internal successors, (106), 24 states have internal predecessors, (106), 21 states have call successors, (34), 12 states have call predecessors, (34), 11 states have return successors, (33), 20 states have call predecessors, (33), 20 states have call successors, (33) [2024-11-09 22:37:12,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:12,387 INFO L93 Difference]: Finished difference Result 629 states and 830 transitions. [2024-11-09 22:37:12,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-09 22:37:12,388 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.416666666666667) internal successors, (106), 24 states have internal predecessors, (106), 21 states have call successors, (34), 12 states have call predecessors, (34), 11 states have return successors, (33), 20 states have call predecessors, (33), 20 states have call successors, (33) Word has length 94 [2024-11-09 22:37:12,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:12,390 INFO L225 Difference]: With dead ends: 629 [2024-11-09 22:37:12,390 INFO L226 Difference]: Without dead ends: 496 [2024-11-09 22:37:12,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=584, Invalid=1056, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 22:37:12,391 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 360 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:12,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 359 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 22:37:12,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-11-09 22:37:12,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 438. [2024-11-09 22:37:12,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 328 states have (on average 1.2347560975609757) internal successors, (405), 329 states have internal predecessors, (405), 88 states have call successors, (88), 22 states have call predecessors, (88), 21 states have return successors, (87), 86 states have call predecessors, (87), 87 states have call successors, (87) [2024-11-09 22:37:12,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 580 transitions. [2024-11-09 22:37:12,449 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 580 transitions. Word has length 94 [2024-11-09 22:37:12,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:12,449 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 580 transitions. [2024-11-09 22:37:12,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.416666666666667) internal successors, (106), 24 states have internal predecessors, (106), 21 states have call successors, (34), 12 states have call predecessors, (34), 11 states have return successors, (33), 20 states have call predecessors, (33), 20 states have call successors, (33) [2024-11-09 22:37:12,449 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 580 transitions. [2024-11-09 22:37:12,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 22:37:12,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:12,459 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 8, 8, 8, 8, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:12,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 22:37:12,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:12,664 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:12,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:12,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1633168350, now seen corresponding path program 2 times [2024-11-09 22:37:12,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:12,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625606264] [2024-11-09 22:37:12,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:12,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:12,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:12,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:12,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:12,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 22:37:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:12,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 22:37:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:12,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 22:37:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:12,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 22:37:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:12,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 22:37:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:12,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 22:37:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:12,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 22:37:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:12,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 22:37:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:12,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 22:37:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:12,917 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 20 proven. 114 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-09 22:37:12,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:12,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625606264] [2024-11-09 22:37:12,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625606264] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:12,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711504129] [2024-11-09 22:37:12,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 22:37:12,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:12,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:12,919 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:37:12,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 22:37:12,972 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 22:37:12,972 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:37:12,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 22:37:12,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:13,070 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 20 proven. 294 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:37:13,070 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:37:13,290 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 20 proven. 114 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-09 22:37:13,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711504129] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:37:13,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:37:13,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 24 [2024-11-09 22:37:13,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608136402] [2024-11-09 22:37:13,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:37:13,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 22:37:13,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:13,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 22:37:13,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2024-11-09 22:37:13,292 INFO L87 Difference]: Start difference. First operand 438 states and 580 transitions. Second operand has 24 states, 24 states have (on average 4.708333333333333) internal successors, (113), 24 states have internal predecessors, (113), 21 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (36), 20 states have call predecessors, (36), 20 states have call successors, (36) [2024-11-09 22:37:13,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:13,804 INFO L93 Difference]: Finished difference Result 449 states and 591 transitions. [2024-11-09 22:37:13,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-09 22:37:13,810 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.708333333333333) internal successors, (113), 24 states have internal predecessors, (113), 21 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (36), 20 states have call predecessors, (36), 20 states have call successors, (36) Word has length 100 [2024-11-09 22:37:13,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:13,812 INFO L225 Difference]: With dead ends: 449 [2024-11-09 22:37:13,812 INFO L226 Difference]: Without dead ends: 443 [2024-11-09 22:37:13,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 211 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=551, Invalid=1009, Unknown=0, NotChecked=0, Total=1560 [2024-11-09 22:37:13,813 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 342 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:13,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 299 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 22:37:13,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-09 22:37:13,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 440. [2024-11-09 22:37:13,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 330 states have (on average 1.206060606060606) internal successors, (398), 331 states have internal predecessors, (398), 88 states have call successors, (88), 22 states have call predecessors, (88), 21 states have return successors, (87), 86 states have call predecessors, (87), 87 states have call successors, (87) [2024-11-09 22:37:13,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 573 transitions. [2024-11-09 22:37:13,867 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 573 transitions. Word has length 100 [2024-11-09 22:37:13,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:13,867 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 573 transitions. [2024-11-09 22:37:13,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.708333333333333) internal successors, (113), 24 states have internal predecessors, (113), 21 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (36), 20 states have call predecessors, (36), 20 states have call successors, (36) [2024-11-09 22:37:13,868 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 573 transitions. [2024-11-09 22:37:13,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-09 22:37:13,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:13,881 INFO L215 NwaCegarLoop]: trace histogram [19, 18, 18, 15, 13, 13, 13, 13, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:13,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 22:37:14,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 22:37:14,085 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:14,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:14,085 INFO L85 PathProgramCache]: Analyzing trace with hash 306393645, now seen corresponding path program 1 times [2024-11-09 22:37:14,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:14,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109874701] [2024-11-09 22:37:14,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:14,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 22:37:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 22:37:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 22:37:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 22:37:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 22:37:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 22:37:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 22:37:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 22:37:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 22:37:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 22:37:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 22:37:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 22:37:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 22:37:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-09 22:37:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-09 22:37:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-09 22:37:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-09 22:37:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2024-11-09 22:37:14,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:14,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109874701] [2024-11-09 22:37:14,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109874701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:37:14,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:37:14,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 22:37:14,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125023630] [2024-11-09 22:37:14,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:37:14,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 22:37:14,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:14,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 22:37:14,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 22:37:14,152 INFO L87 Difference]: Start difference. First operand 440 states and 573 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-09 22:37:14,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:14,216 INFO L93 Difference]: Finished difference Result 778 states and 1028 transitions. [2024-11-09 22:37:14,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 22:37:14,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 168 [2024-11-09 22:37:14,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:14,219 INFO L225 Difference]: With dead ends: 778 [2024-11-09 22:37:14,219 INFO L226 Difference]: Without dead ends: 427 [2024-11-09 22:37:14,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 22:37:14,220 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:14,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 84 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:37:14,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-09 22:37:14,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 426. [2024-11-09 22:37:14,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 320 states have (on average 1.1875) internal successors, (380), 321 states have internal predecessors, (380), 84 states have call successors, (84), 22 states have call predecessors, (84), 21 states have return successors, (83), 82 states have call predecessors, (83), 83 states have call successors, (83) [2024-11-09 22:37:14,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 547 transitions. [2024-11-09 22:37:14,292 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 547 transitions. Word has length 168 [2024-11-09 22:37:14,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:14,292 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 547 transitions. [2024-11-09 22:37:14,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-09 22:37:14,293 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 547 transitions. [2024-11-09 22:37:14,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-09 22:37:14,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:14,294 INFO L215 NwaCegarLoop]: trace histogram [19, 18, 18, 16, 14, 14, 14, 14, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:14,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 22:37:14,295 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:14,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:14,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1727151896, now seen corresponding path program 1 times [2024-11-09 22:37:14,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:14,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192015165] [2024-11-09 22:37:14,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:14,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 22:37:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 22:37:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 22:37:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 22:37:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 22:37:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 22:37:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 22:37:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 22:37:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 22:37:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 22:37:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 22:37:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 22:37:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 22:37:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-09 22:37:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-09 22:37:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-09 22:37:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-09 22:37:14,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1086 backedges. 124 proven. 338 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2024-11-09 22:37:14,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:14,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192015165] [2024-11-09 22:37:14,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192015165] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:14,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127723321] [2024-11-09 22:37:14,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:14,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:14,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:14,786 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:37:14,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 22:37:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:14,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 22:37:14,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:14,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1086 backedges. 340 proven. 702 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-09 22:37:14,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:37:15,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1086 backedges. 124 proven. 338 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2024-11-09 22:37:15,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127723321] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:37:15,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:37:15,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 24 [2024-11-09 22:37:15,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684814010] [2024-11-09 22:37:15,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:37:15,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 22:37:15,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:15,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 22:37:15,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2024-11-09 22:37:15,299 INFO L87 Difference]: Start difference. First operand 426 states and 547 transitions. Second operand has 24 states, 24 states have (on average 5.75) internal successors, (138), 24 states have internal predecessors, (138), 21 states have call successors, (47), 17 states have call predecessors, (47), 17 states have return successors, (46), 21 states have call predecessors, (46), 21 states have call successors, (46) [2024-11-09 22:37:15,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:15,816 INFO L93 Difference]: Finished difference Result 550 states and 713 transitions. [2024-11-09 22:37:15,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-09 22:37:15,817 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.75) internal successors, (138), 24 states have internal predecessors, (138), 21 states have call successors, (47), 17 states have call predecessors, (47), 17 states have return successors, (46), 21 states have call predecessors, (46), 21 states have call successors, (46) Word has length 168 [2024-11-09 22:37:15,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:15,819 INFO L225 Difference]: With dead ends: 550 [2024-11-09 22:37:15,819 INFO L226 Difference]: Without dead ends: 413 [2024-11-09 22:37:15,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 359 SyntacticMatches, 10 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=628, Invalid=1094, Unknown=0, NotChecked=0, Total=1722 [2024-11-09 22:37:15,820 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 323 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:15,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 312 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 22:37:15,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-09 22:37:15,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2024-11-09 22:37:15,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 311 states have (on average 1.1607717041800643) internal successors, (361), 311 states have internal predecessors, (361), 80 states have call successors, (80), 22 states have call predecessors, (80), 21 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-09 22:37:15,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 520 transitions. [2024-11-09 22:37:15,875 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 520 transitions. Word has length 168 [2024-11-09 22:37:15,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:15,875 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 520 transitions. [2024-11-09 22:37:15,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.75) internal successors, (138), 24 states have internal predecessors, (138), 21 states have call successors, (47), 17 states have call predecessors, (47), 17 states have return successors, (46), 21 states have call predecessors, (46), 21 states have call successors, (46) [2024-11-09 22:37:15,876 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 520 transitions. [2024-11-09 22:37:15,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-09 22:37:15,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:15,879 INFO L215 NwaCegarLoop]: trace histogram [21, 20, 20, 18, 18, 18, 18, 17, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:15,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 22:37:16,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 22:37:16,084 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:16,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:16,084 INFO L85 PathProgramCache]: Analyzing trace with hash -429805006, now seen corresponding path program 3 times [2024-11-09 22:37:16,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:16,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406912192] [2024-11-09 22:37:16,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:16,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:16,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:37:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:16,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 22:37:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:16,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 22:37:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:16,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 22:37:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:16,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 22:37:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:16,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 22:37:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:16,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 22:37:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:16,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 22:37:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:16,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 22:37:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:16,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 22:37:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:16,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 22:37:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:16,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 22:37:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:16,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 22:37:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:16,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 22:37:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:16,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 22:37:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:16,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 22:37:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:16,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 22:37:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:16,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-09 22:37:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:16,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-09 22:37:16,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:16,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-09 22:37:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:16,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-09 22:37:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:16,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-09 22:37:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:37:16,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 112 proven. 4 refuted. 0 times theorem prover too weak. 1302 trivial. 0 not checked. [2024-11-09 22:37:16,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:37:16,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406912192] [2024-11-09 22:37:16,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406912192] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:16,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670446802] [2024-11-09 22:37:16,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 22:37:16,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:16,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:16,399 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:37:16,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 22:37:16,467 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 22:37:16,467 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:37:16,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 22:37:16,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:37:16,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 98 proven. 1 refuted. 0 times theorem prover too weak. 1319 trivial. 0 not checked. [2024-11-09 22:37:16,541 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:37:19,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670446802] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:37:19,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:37:19,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2024-11-09 22:37:19,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682430321] [2024-11-09 22:37:19,575 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 22:37:19,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 22:37:19,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:37:19,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 22:37:19,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=143, Unknown=1, NotChecked=0, Total=182 [2024-11-09 22:37:19,576 INFO L87 Difference]: Start difference. First operand 413 states and 520 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-09 22:37:19,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:37:19,883 INFO L93 Difference]: Finished difference Result 1021 states and 1285 transitions. [2024-11-09 22:37:19,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 22:37:19,884 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 180 [2024-11-09 22:37:19,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:37:19,886 INFO L225 Difference]: With dead ends: 1021 [2024-11-09 22:37:19,887 INFO L226 Difference]: Without dead ends: 568 [2024-11-09 22:37:19,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 229 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=63, Invalid=208, Unknown=1, NotChecked=0, Total=272 [2024-11-09 22:37:19,888 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 39 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:37:19,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 318 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:37:19,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-11-09 22:37:19,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 490. [2024-11-09 22:37:19,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 369 states have (on average 1.1382113821138211) internal successors, (420), 372 states have internal predecessors, (420), 98 states have call successors, (98), 23 states have call predecessors, (98), 22 states have return successors, (97), 94 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-09 22:37:19,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 615 transitions. [2024-11-09 22:37:19,986 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 615 transitions. Word has length 180 [2024-11-09 22:37:19,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:37:19,987 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 615 transitions. [2024-11-09 22:37:19,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 9 states have internal predecessors, (34), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-09 22:37:19,987 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 615 transitions. [2024-11-09 22:37:19,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-09 22:37:19,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:37:19,989 INFO L215 NwaCegarLoop]: trace histogram [21, 20, 20, 17, 17, 17, 17, 16, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:19,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 22:37:20,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 22:37:20,190 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:37:20,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:37:20,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1301681801, now seen corresponding path program 1 times [2024-11-09 22:37:20,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:37:20,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403344518] [2024-11-09 22:37:20,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:20,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:37:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 22:37:20,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1926082389] [2024-11-09 22:37:20,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:37:20,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:37:20,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:37:20,248 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 22:37:20,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 22:37:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 22:37:20,333 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 22:37:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 22:37:20,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 22:37:20,413 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 22:37:20,414 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 22:37:20,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 22:37:20,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 22:37:20,619 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:37:20,675 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 22:37:20,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:37:20 BoogieIcfgContainer [2024-11-09 22:37:20,677 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 22:37:20,677 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 22:37:20,677 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 22:37:20,677 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 22:37:20,678 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:37:04" (3/4) ... [2024-11-09 22:37:20,678 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 22:37:20,746 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 22:37:20,748 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 22:37:20,749 INFO L158 Benchmark]: Toolchain (without parser) took 16680.30ms. Allocated memory was 167.8MB in the beginning and 318.8MB in the end (delta: 151.0MB). Free memory was 95.4MB in the beginning and 219.8MB in the end (delta: -124.4MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2024-11-09 22:37:20,749 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 22:37:20,749 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.68ms. Allocated memory is still 167.8MB. Free memory was 95.3MB in the beginning and 82.2MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 22:37:20,750 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.71ms. Allocated memory is still 167.8MB. Free memory was 82.2MB in the beginning and 137.7MB in the end (delta: -55.5MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2024-11-09 22:37:20,750 INFO L158 Benchmark]: Boogie Preprocessor took 23.57ms. Allocated memory is still 167.8MB. Free memory was 137.6MB in the beginning and 136.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 22:37:20,752 INFO L158 Benchmark]: IcfgBuilder took 311.24ms. Allocated memory was 167.8MB in the beginning and 220.2MB in the end (delta: 52.4MB). Free memory was 136.0MB in the beginning and 180.8MB in the end (delta: -44.8MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2024-11-09 22:37:20,752 INFO L158 Benchmark]: TraceAbstraction took 15974.95ms. Allocated memory was 220.2MB in the beginning and 318.8MB in the end (delta: 98.6MB). Free memory was 180.8MB in the beginning and 226.1MB in the end (delta: -45.3MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. [2024-11-09 22:37:20,752 INFO L158 Benchmark]: Witness Printer took 70.79ms. Allocated memory is still 318.8MB. Free memory was 226.1MB in the beginning and 219.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 22:37:20,753 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 231.68ms. Allocated memory is still 167.8MB. Free memory was 95.3MB in the beginning and 82.2MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.71ms. Allocated memory is still 167.8MB. Free memory was 82.2MB in the beginning and 137.7MB in the end (delta: -55.5MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.57ms. Allocated memory is still 167.8MB. Free memory was 137.6MB in the beginning and 136.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 311.24ms. Allocated memory was 167.8MB in the beginning and 220.2MB in the end (delta: 52.4MB). Free memory was 136.0MB in the beginning and 180.8MB in the end (delta: -44.8MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * TraceAbstraction took 15974.95ms. Allocated memory was 220.2MB in the beginning and 318.8MB in the end (delta: 98.6MB). Free memory was 180.8MB in the beginning and 226.1MB in the end (delta: -45.3MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. * Witness Printer took 70.79ms. Allocated memory is still 318.8MB. Free memory was 226.1MB in the beginning and 219.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; VAL [counter=0] [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L25] CALL assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L25] RET assume_abort_if_not((((long long) R - 1) * ((long long) R - 1)) < A) VAL [A=12999, R=115, counter=0] [L27] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L27] RET assume_abort_if_not(A % 2 == 1) VAL [A=12999, R=115, counter=0] [L29] u = ((long long) 2 * R) + 1 [L30] v = 1 [L31] r = ((long long) R * R) - A VAL [A=12999, counter=0, r=226, u=231, v=1] [L34] EXPR counter++ VAL [A=12999, counter=1, r=226, u=231, v=1] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12999, counter=1, r=226, u=231, v=1] [L36] COND FALSE !(!(r != 0)) VAL [A=12999, counter=1, r=226, u=231, v=1] [L39] EXPR counter++ VAL [A=12999, counter=2, r=226, u=231, v=1] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12999, counter=2, r=226, u=231, v=1] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=12999, counter=2, r=225, u=231, v=3] [L39] EXPR counter++ VAL [A=12999, counter=3, r=225, u=231, v=3] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12999, counter=3, r=225, u=231, v=3] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=12999, counter=3, r=222, u=231, v=5] [L39] EXPR counter++ VAL [A=12999, counter=4, r=222, u=231, v=5] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12999, counter=4, r=222, u=231, v=5] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=12999, counter=4, r=217, u=231, v=7] [L39] EXPR counter++ VAL [A=12999, counter=5, r=217, u=231, v=7] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12999, counter=5, r=217, u=231, v=7] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=12999, counter=5, r=210, u=231, v=9] [L39] EXPR counter++ VAL [A=12999, counter=6, r=210, u=231, v=9] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12999, counter=6, r=210, u=231, v=9] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=12999, counter=6, r=201, u=231, v=11] [L39] EXPR counter++ VAL [A=12999, counter=7, r=201, u=231, v=11] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12999, counter=7, r=201, u=231, v=11] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=12999, counter=7, r=190, u=231, v=13] [L39] EXPR counter++ VAL [A=12999, counter=8, r=190, u=231, v=13] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12999, counter=8, r=190, u=231, v=13] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=12999, counter=8, r=177, u=231, v=15] [L39] EXPR counter++ VAL [A=12999, counter=9, r=177, u=231, v=15] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12999, counter=9, r=177, u=231, v=15] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=12999, counter=9, r=162, u=231, v=17] [L39] EXPR counter++ VAL [A=12999, counter=10, r=162, u=231, v=17] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12999, counter=10, r=162, u=231, v=17] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=12999, counter=10, r=145, u=231, v=19] [L39] EXPR counter++ VAL [A=12999, counter=11, r=145, u=231, v=19] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=11] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12999, counter=11, r=145, u=231, v=19] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=12999, counter=11, r=126, u=231, v=21] [L39] EXPR counter++ VAL [A=12999, counter=12, r=126, u=231, v=21] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=12] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12999, counter=12, r=126, u=231, v=21] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=12999, counter=12, r=105, u=231, v=23] [L39] EXPR counter++ VAL [A=12999, counter=13, r=105, u=231, v=23] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=13] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12999, counter=13, r=105, u=231, v=23] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=12999, counter=13, r=82, u=231, v=25] [L39] EXPR counter++ VAL [A=12999, counter=14, r=82, u=231, v=25] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=14] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12999, counter=14, r=82, u=231, v=25] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=12999, counter=14, r=57, u=231, v=27] [L39] EXPR counter++ VAL [A=12999, counter=15, r=57, u=231, v=27] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=15] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12999, counter=15, r=57, u=231, v=27] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=12999, counter=15, r=30, u=231, v=29] [L39] EXPR counter++ VAL [A=12999, counter=16, r=30, u=231, v=29] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=16] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12999, counter=16, r=30, u=231, v=29] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=12999, counter=16, r=1, u=231, v=31] [L39] EXPR counter++ VAL [A=12999, counter=17, r=1, u=231, v=31] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=17] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12999, counter=17, r=1, u=231, v=31] [L41] COND FALSE !(!(r > 0)) [L43] r = r - v [L44] v = v + 2 VAL [A=12999, counter=17, r=-30, u=231, v=33] [L39] EXPR counter++ VAL [A=12999, counter=18, r=-30, u=231, v=33] [L39] COND TRUE counter++<20 [L40] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=18] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L40] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12999, counter=18, r=-30, u=231, v=33] [L41] COND TRUE !(r > 0) VAL [A=12999, counter=18, r=-30, u=231, v=33] [L47] EXPR counter++ VAL [A=12999, counter=19, r=-30, u=231, v=33] [L47] COND TRUE counter++<20 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=19] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12999, counter=19, r=-30, u=231, v=33] [L49] COND FALSE !(!(r < 0)) [L51] r = r + u [L52] u = u + 2 VAL [A=12999, counter=19, r=201, u=233, v=33] [L47] EXPR counter++ VAL [A=12999, counter=20, r=201, u=233, v=33] [L47] COND TRUE counter++<20 [L48] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=20] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L48] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=12999, counter=20, r=201, u=233, v=33] [L49] COND TRUE !(r < 0) VAL [A=12999, counter=20, r=201, u=233, v=33] [L34] EXPR counter++ VAL [A=12999, counter=21, r=201, u=233, v=33] [L34] COND FALSE !(counter++<20) [L56] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, counter=21] [L12] COND TRUE !(cond) VAL [\old(cond)=0, counter=21] [L14] reach_error() VAL [\old(cond)=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.9s, OverallIterations: 17, TraceHistogramMax: 21, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1666 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1653 mSDsluCounter, 2952 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2384 mSDsCounter, 593 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1373 IncrementalHoareTripleChecker+Invalid, 1966 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 593 mSolverCounterUnsat, 568 mSDtfsCounter, 1373 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1871 GetRequests, 1623 SyntacticMatches, 16 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=490occurred in iteration=16, InterpolantAutomatonStates: 244, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 238 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 2309 NumberOfCodeBlocks, 2165 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2510 ConstructedInterpolants, 0 QuantifiedInterpolants, 5327 SizeOfPredicates, 52 NumberOfNonLiveVariables, 1703 ConjunctsInSsa, 146 ConjunctsInUnsatCore, 33 InterpolantComputations, 7 PerfectInterpolantSequences, 7162/9836 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-09 22:37:20,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE