./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound2.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 f9a59972454f7ae078581bb1592875955e31a3bd05f52cbebd7b164f55fa53bc --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 02:35:01,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 02:35:01,085 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 02:35:01,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 02:35:01,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 02:35:01,112 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 02:35:01,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 02:35:01,112 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 02:35:01,113 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 02:35:01,114 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 02:35:01,115 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 02:35:01,115 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 02:35:01,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 02:35:01,118 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 02:35:01,118 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 02:35:01,118 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 02:35:01,118 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 02:35:01,118 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 02:35:01,119 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 02:35:01,119 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 02:35:01,119 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 02:35:01,121 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 02:35:01,121 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 02:35:01,122 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 02:35:01,122 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 02:35:01,122 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 02:35:01,122 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 02:35:01,122 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 02:35:01,123 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 02:35:01,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 02:35:01,123 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 02:35:01,123 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 02:35:01,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:35:01,123 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 02:35:01,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 02:35:01,124 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 02:35:01,124 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 02:35:01,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 02:35:01,124 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 02:35:01,125 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 02:35:01,126 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 02:35:01,126 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 02:35:01,126 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 -> f9a59972454f7ae078581bb1592875955e31a3bd05f52cbebd7b164f55fa53bc [2024-10-14 02:35:01,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 02:35:01,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 02:35:01,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 02:35:01,437 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 02:35:01,438 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 02:35:01,438 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound2.c [2024-10-14 02:35:02,737 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 02:35:02,988 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 02:35:02,988 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound2.c [2024-10-14 02:35:03,002 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31839c919/93aef0571c4247ad9011a3483717e9ea/FLAG8dff346f7 [2024-10-14 02:35:03,316 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31839c919/93aef0571c4247ad9011a3483717e9ea [2024-10-14 02:35:03,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 02:35:03,319 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 02:35:03,320 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 02:35:03,320 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 02:35:03,325 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 02:35:03,325 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:35:03" (1/1) ... [2024-10-14 02:35:03,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62f93731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:35:03, skipping insertion in model container [2024-10-14 02:35:03,326 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:35:03" (1/1) ... [2024-10-14 02:35:03,342 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 02:35:03,476 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound2.c[573,586] [2024-10-14 02:35:03,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:35:03,501 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 02:35:03,511 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/mannadiv_unwindbound2.c[573,586] [2024-10-14 02:35:03,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:35:03,534 INFO L204 MainTranslator]: Completed translation [2024-10-14 02:35:03,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:35:03 WrapperNode [2024-10-14 02:35:03,535 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 02:35:03,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 02:35:03,536 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 02:35:03,536 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 02:35:03,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:35:03" (1/1) ... [2024-10-14 02:35:03,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:35:03" (1/1) ... [2024-10-14 02:35:03,561 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 48 [2024-10-14 02:35:03,562 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 02:35:03,563 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 02:35:03,563 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 02:35:03,563 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 02:35:03,571 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:35:03" (1/1) ... [2024-10-14 02:35:03,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:35:03" (1/1) ... [2024-10-14 02:35:03,572 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:35:03" (1/1) ... [2024-10-14 02:35:03,583 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 02:35:03,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:35:03" (1/1) ... [2024-10-14 02:35:03,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:35:03" (1/1) ... [2024-10-14 02:35:03,586 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:35:03" (1/1) ... [2024-10-14 02:35:03,589 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:35:03" (1/1) ... [2024-10-14 02:35:03,590 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:35:03" (1/1) ... [2024-10-14 02:35:03,591 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:35:03" (1/1) ... [2024-10-14 02:35:03,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 02:35:03,616 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 02:35:03,617 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 02:35:03,617 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 02:35:03,618 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:35:03" (1/1) ... [2024-10-14 02:35:03,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:35:03,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:35:03,651 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 02:35:03,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 02:35:03,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 02:35:03,726 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 02:35:03,726 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 02:35:03,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 02:35:03,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 02:35:03,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 02:35:03,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 02:35:03,728 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 02:35:03,788 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 02:35:03,790 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 02:35:03,872 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-10-14 02:35:03,873 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 02:35:03,895 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 02:35:03,895 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 02:35:03,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:35:03 BoogieIcfgContainer [2024-10-14 02:35:03,896 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 02:35:03,901 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 02:35:03,902 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 02:35:03,905 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 02:35:03,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:35:03" (1/3) ... [2024-10-14 02:35:03,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71c5230a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:35:03, skipping insertion in model container [2024-10-14 02:35:03,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:35:03" (2/3) ... [2024-10-14 02:35:03,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71c5230a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:35:03, skipping insertion in model container [2024-10-14 02:35:03,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:35:03" (3/3) ... [2024-10-14 02:35:03,907 INFO L112 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound2.c [2024-10-14 02:35:03,922 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 02:35:03,922 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 02:35:03,976 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 02:35:03,985 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;@665abcbf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 02:35:03,989 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 02:35:03,997 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 02:35:04,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 02:35:04,006 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:35:04,007 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:35:04,007 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:35:04,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:35:04,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1060579028, now seen corresponding path program 1 times [2024-10-14 02:35:04,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:35:04,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999331924] [2024-10-14 02:35:04,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:35:04,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:35:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:35:04,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:35:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:35:04,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:35:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:35:04,192 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 02:35:04,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:35:04,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999331924] [2024-10-14 02:35:04,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999331924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:35:04,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:35:04,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 02:35:04,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457794387] [2024-10-14 02:35:04,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:35:04,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 02:35:04,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:35:04,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 02:35:04,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 02:35:04,220 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-10-14 02:35:04,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:35:04,243 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2024-10-14 02:35:04,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 02:35:04,246 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 17 [2024-10-14 02:35:04,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:35:04,251 INFO L225 Difference]: With dead ends: 42 [2024-10-14 02:35:04,251 INFO L226 Difference]: Without dead ends: 20 [2024-10-14 02:35:04,254 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-10-14 02:35:04,256 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:35:04,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:35:04,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-14 02:35:04,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-14 02:35:04,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 02:35:04,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-14 02:35:04,286 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 17 [2024-10-14 02:35:04,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:35:04,286 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-14 02:35:04,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-10-14 02:35:04,287 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-10-14 02:35:04,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 02:35:04,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:35:04,288 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:35:04,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 02:35:04,290 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:35:04,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:35:04,290 INFO L85 PathProgramCache]: Analyzing trace with hash -778881514, now seen corresponding path program 1 times [2024-10-14 02:35:04,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:35:04,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652295198] [2024-10-14 02:35:04,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:35:04,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:35:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:35:04,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:35:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:35:04,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:35:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:35:04,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 02:35:04,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:35:04,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652295198] [2024-10-14 02:35:04,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652295198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:35:04,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:35:04,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 02:35:04,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634277767] [2024-10-14 02:35:04,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:35:04,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 02:35:04,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:35:04,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 02:35:04,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 02:35:04,485 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-10-14 02:35:04,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:35:04,511 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-10-14 02:35:04,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 02:35:04,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 18 [2024-10-14 02:35:04,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:35:04,512 INFO L225 Difference]: With dead ends: 29 [2024-10-14 02:35:04,512 INFO L226 Difference]: Without dead ends: 22 [2024-10-14 02:35:04,513 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-10-14 02:35:04,514 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:35:04,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 54 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:35:04,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-14 02:35:04,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-14 02:35:04,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 02:35:04,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-10-14 02:35:04,519 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 18 [2024-10-14 02:35:04,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:35:04,520 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-10-14 02:35:04,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-10-14 02:35:04,520 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-10-14 02:35:04,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 02:35:04,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:35:04,521 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:35:04,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 02:35:04,521 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:35:04,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:35:04,522 INFO L85 PathProgramCache]: Analyzing trace with hash -777094054, now seen corresponding path program 1 times [2024-10-14 02:35:04,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:35:04,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554454571] [2024-10-14 02:35:04,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:35:04,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:35:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 02:35:04,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1910989842] [2024-10-14 02:35:04,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:35:04,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:35:04,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:35:04,548 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:35:04,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 02:35:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:35:04,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 02:35:04,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:35:04,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 02:35:04,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:35:04,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:35:04,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554454571] [2024-10-14 02:35:04,762 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 02:35:04,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910989842] [2024-10-14 02:35:04,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910989842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:35:04,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:35:04,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 02:35:04,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478817521] [2024-10-14 02:35:04,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:35:04,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:35:04,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:35:04,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:35:04,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 02:35:04,766 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-10-14 02:35:04,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:35:04,844 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2024-10-14 02:35:04,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 02:35:04,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 18 [2024-10-14 02:35:04,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:35:04,846 INFO L225 Difference]: With dead ends: 31 [2024-10-14 02:35:04,846 INFO L226 Difference]: Without dead ends: 29 [2024-10-14 02:35:04,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:35:04,848 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:35:04,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 62 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:35:04,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-14 02:35:04,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-10-14 02:35:04,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 02:35:04,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-10-14 02:35:04,855 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 18 [2024-10-14 02:35:04,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:35:04,858 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-10-14 02:35:04,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-10-14 02:35:04,858 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-10-14 02:35:04,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 02:35:04,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:35:04,859 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] [2024-10-14 02:35:04,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 02:35:05,063 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-10-14 02:35:05,064 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:35:05,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:35:05,065 INFO L85 PathProgramCache]: Analyzing trace with hash -331201790, now seen corresponding path program 1 times [2024-10-14 02:35:05,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:35:05,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181861521] [2024-10-14 02:35:05,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:35:05,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:35:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:35:05,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:35:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:35:05,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:35:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:35:05,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:35:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:35:05,332 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 02:35:05,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:35:05,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181861521] [2024-10-14 02:35:05,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181861521] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:35:05,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77056849] [2024-10-14 02:35:05,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:35:05,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:35:05,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:35:05,339 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:35:05,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 02:35:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:35:05,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 02:35:05,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:35:05,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 02:35:05,443 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:35:05,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77056849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:35:05,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:35:05,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-10-14 02:35:05,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732684719] [2024-10-14 02:35:05,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:35:05,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:35:05,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:35:05,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:35:05,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-14 02:35:05,446 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-10-14 02:35:05,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:35:05,480 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2024-10-14 02:35:05,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:35:05,480 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 24 [2024-10-14 02:35:05,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:35:05,481 INFO L225 Difference]: With dead ends: 36 [2024-10-14 02:35:05,481 INFO L226 Difference]: Without dead ends: 29 [2024-10-14 02:35:05,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:35:05,482 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:35:05,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 78 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:35:05,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-14 02:35:05,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-10-14 02:35:05,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 02:35:05,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-10-14 02:35:05,486 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 24 [2024-10-14 02:35:05,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:35:05,487 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-10-14 02:35:05,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-10-14 02:35:05,487 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-10-14 02:35:05,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 02:35:05,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:35:05,488 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] [2024-10-14 02:35:05,504 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-10-14 02:35:05,689 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-10-14 02:35:05,690 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:35:05,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:35:05,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1584280999, now seen corresponding path program 1 times [2024-10-14 02:35:05,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:35:05,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917026102] [2024-10-14 02:35:05,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:35:05,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:35:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:35:05,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:35:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:35:05,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:35:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:35:05,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:35:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:35:05,762 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 02:35:05,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:35:05,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917026102] [2024-10-14 02:35:05,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917026102] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:35:05,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611058605] [2024-10-14 02:35:05,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:35:05,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:35:05,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:35:05,772 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:35:05,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 02:35:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:35:05,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 02:35:05,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:35:05,859 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 02:35:05,859 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:35:05,909 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 02:35:05,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611058605] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:35:05,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 02:35:05,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 7 [2024-10-14 02:35:05,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119861286] [2024-10-14 02:35:05,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 02:35:05,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:35:05,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:35:05,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:35:05,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:35:05,911 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 02:35:05,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:35:05,937 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2024-10-14 02:35:05,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:35:05,937 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 27 [2024-10-14 02:35:05,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:35:05,938 INFO L225 Difference]: With dead ends: 38 [2024-10-14 02:35:05,938 INFO L226 Difference]: Without dead ends: 31 [2024-10-14 02:35:05,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:35:05,939 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:35:05,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 74 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:35:05,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-14 02:35:05,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-14 02:35:05,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 02:35:05,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2024-10-14 02:35:05,943 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 27 [2024-10-14 02:35:05,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:35:05,944 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-10-14 02:35:05,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 02:35:05,944 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2024-10-14 02:35:05,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 02:35:05,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:35:05,945 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:35:05,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 02:35:06,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:35:06,149 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:35:06,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:35:06,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1582493539, now seen corresponding path program 1 times [2024-10-14 02:35:06,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:35:06,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760243961] [2024-10-14 02:35:06,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:35:06,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:35:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 02:35:06,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1130504712] [2024-10-14 02:35:06,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:35:06,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:35:06,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:35:06,166 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:35:06,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 02:35:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:35:06,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 02:35:06,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:35:06,270 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 02:35:06,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:35:06,341 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 02:35:06,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:35:06,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760243961] [2024-10-14 02:35:06,341 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 02:35:06,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130504712] [2024-10-14 02:35:06,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130504712] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:35:06,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 02:35:06,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-14 02:35:06,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30112654] [2024-10-14 02:35:06,342 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 02:35:06,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 02:35:06,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:35:06,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 02:35:06,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:35:06,343 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 02:35:06,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:35:06,514 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2024-10-14 02:35:06,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:35:06,515 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2024-10-14 02:35:06,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:35:06,516 INFO L225 Difference]: With dead ends: 59 [2024-10-14 02:35:06,516 INFO L226 Difference]: Without dead ends: 45 [2024-10-14 02:35:06,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:35:06,517 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 10 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:35:06,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 93 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:35:06,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-14 02:35:06,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2024-10-14 02:35:06,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 02:35:06,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-10-14 02:35:06,530 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 27 [2024-10-14 02:35:06,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:35:06,531 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-10-14 02:35:06,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 02:35:06,531 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-10-14 02:35:06,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 02:35:06,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:35:06,532 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:35:06,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 02:35:06,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:35:06,736 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:35:06,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:35:06,736 INFO L85 PathProgramCache]: Analyzing trace with hash 943937797, now seen corresponding path program 1 times [2024-10-14 02:35:06,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:35:06,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945957177] [2024-10-14 02:35:06,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:35:06,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:35:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:35:06,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:35:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:35:06,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:35:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:35:06,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:35:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:35:06,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 02:35:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:35:06,863 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 02:35:06,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:35:06,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945957177] [2024-10-14 02:35:06,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945957177] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:35:06,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116954204] [2024-10-14 02:35:06,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:35:06,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:35:06,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:35:06,866 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:35:06,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 02:35:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:35:06,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 02:35:06,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:35:07,022 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-14 02:35:07,023 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:35:07,078 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 02:35:07,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116954204] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:35:07,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 02:35:07,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 7] total 15 [2024-10-14 02:35:07,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431606889] [2024-10-14 02:35:07,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 02:35:07,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 02:35:07,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:35:07,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 02:35:07,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-14 02:35:07,080 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 15 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 02:35:07,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:35:07,173 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2024-10-14 02:35:07,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 02:35:07,173 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 33 [2024-10-14 02:35:07,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:35:07,174 INFO L225 Difference]: With dead ends: 44 [2024-10-14 02:35:07,174 INFO L226 Difference]: Without dead ends: 38 [2024-10-14 02:35:07,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-10-14 02:35:07,175 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:35:07,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 141 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:35:07,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-14 02:35:07,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-14 02:35:07,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 02:35:07,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-10-14 02:35:07,180 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 33 [2024-10-14 02:35:07,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:35:07,181 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-10-14 02:35:07,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 02:35:07,181 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-10-14 02:35:07,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 02:35:07,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:35:07,181 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:35:07,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 02:35:07,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:35:07,382 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:35:07,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:35:07,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1408389494, now seen corresponding path program 2 times [2024-10-14 02:35:07,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:35:07,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563758964] [2024-10-14 02:35:07,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:35:07,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:35:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 02:35:07,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2102204684] [2024-10-14 02:35:07,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 02:35:07,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:35:07,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:35:07,400 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:35:07,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 02:35:07,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 02:35:07,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-14 02:35:07,443 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 02:35:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 02:35:07,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 02:35:07,481 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 02:35:07,481 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 02:35:07,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 02:35:07,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:35:07,690 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-10-14 02:35:07,711 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 02:35:07,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 02:35:07 BoogieIcfgContainer [2024-10-14 02:35:07,716 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 02:35:07,717 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 02:35:07,717 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 02:35:07,717 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 02:35:07,717 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:35:03" (3/4) ... [2024-10-14 02:35:07,718 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 02:35:07,756 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 02:35:07,756 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 02:35:07,757 INFO L158 Benchmark]: Toolchain (without parser) took 4438.22ms. Allocated memory was 159.4MB in the beginning and 213.9MB in the end (delta: 54.5MB). Free memory was 87.1MB in the beginning and 95.5MB in the end (delta: -8.4MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. [2024-10-14 02:35:07,757 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 159.4MB. Free memory is still 109.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 02:35:07,757 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.96ms. Allocated memory is still 159.4MB. Free memory was 87.0MB in the beginning and 75.4MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 02:35:07,757 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.11ms. Allocated memory is still 159.4MB. Free memory was 75.3MB in the beginning and 73.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 02:35:07,758 INFO L158 Benchmark]: Boogie Preprocessor took 31.18ms. Allocated memory is still 159.4MB. Free memory was 73.9MB in the beginning and 72.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 02:35:07,758 INFO L158 Benchmark]: RCFGBuilder took 279.18ms. Allocated memory was 159.4MB in the beginning and 213.9MB in the end (delta: 54.5MB). Free memory was 128.9MB in the beginning and 177.0MB in the end (delta: -48.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-14 02:35:07,758 INFO L158 Benchmark]: TraceAbstraction took 3814.66ms. Allocated memory is still 213.9MB. Free memory was 176.0MB in the beginning and 98.7MB in the end (delta: 77.3MB). Peak memory consumption was 79.4MB. Max. memory is 16.1GB. [2024-10-14 02:35:07,758 INFO L158 Benchmark]: Witness Printer took 39.89ms. Allocated memory is still 213.9MB. Free memory was 97.6MB in the beginning and 95.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 02:35:07,759 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.13ms. Allocated memory is still 159.4MB. Free memory is still 109.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.96ms. Allocated memory is still 159.4MB. Free memory was 87.0MB in the beginning and 75.4MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.11ms. Allocated memory is still 159.4MB. Free memory was 75.3MB in the beginning and 73.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.18ms. Allocated memory is still 159.4MB. Free memory was 73.9MB in the beginning and 72.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 279.18ms. Allocated memory was 159.4MB in the beginning and 213.9MB in the end (delta: 54.5MB). Free memory was 128.9MB in the beginning and 177.0MB in the end (delta: -48.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3814.66ms. Allocated memory is still 213.9MB. Free memory was 176.0MB in the beginning and 98.7MB in the end (delta: 77.3MB). Peak memory consumption was 79.4MB. Max. memory is 16.1GB. * Witness Printer took 39.89ms. Allocated memory is still 213.9MB. Free memory was 97.6MB in the beginning and 95.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; [L24] int x1, x2; [L25] int y1, y2, y3; [L26] x1 = __VERIFIER_nondet_int() [L27] x2 = __VERIFIER_nondet_int() [L29] CALL assume_abort_if_not(x1 >= 0) VAL [\old(cond)=1, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L29] RET assume_abort_if_not(x1 >= 0) VAL [counter=0, x1=3, x2=1] [L30] CALL assume_abort_if_not(x2 != 0) VAL [\old(cond)=1, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L30] RET assume_abort_if_not(x2 != 0) VAL [counter=0, x1=3, x2=1] [L32] y1 = 0 [L33] y2 = 0 [L34] y3 = x1 VAL [counter=0, x1=3, x2=1, y1=0, y2=0, y3=3] [L36] EXPR counter++ VAL [counter=1, x1=3, x2=1, y1=0, y2=0, y3=3] [L36] COND TRUE counter++<2 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=1, x1=3, x2=1, y1=0, y2=0, y3=3] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=1, x1=3, x2=1, y1=0, y2=0, y3=3] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=1, x1=3, x2=1, y1=1, y2=0, y3=2] [L36] EXPR counter++ VAL [counter=2, x1=3, x2=1, y1=1, y2=0, y3=2] [L36] COND TRUE counter++<2 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, counter=2] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [counter=2, x1=3, x2=1, y1=1, y2=0, y3=2] [L39] COND FALSE !(!(y3 != 0)) VAL [counter=2, x1=3, x2=1, y1=1, y2=0, y3=2] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [counter=2, x1=3, x2=1, y1=2, y2=0, y3=1] [L36] EXPR counter++ VAL [counter=3, x1=3, x2=1, y1=2, y2=0, y3=1] [L36] COND FALSE !(counter++<2) [L50] CALL __VERIFIER_assert(y1*x2 + y2 == x1) VAL [\old(cond)=0, counter=3] [L16] COND TRUE !(cond) VAL [\old(cond)=0, counter=3] [L18] reach_error() VAL [\old(cond)=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 58 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 55 mSDsluCounter, 526 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 388 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 281 IncrementalHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 138 mSDtfsCounter, 281 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 221 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=6, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 365 NumberOfCodeBlocks, 365 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 322 ConstructedInterpolants, 0 QuantifiedInterpolants, 880 SizeOfPredicates, 6 NumberOfNonLiveVariables, 416 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 94/114 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-14 02:35:07,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE