./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ad27fb086e75bf8f5b08286d8e766d07abfe44ff39234568924cf55ade7a6d5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 01:51:09,755 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 01:51:09,847 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 01:51:09,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 01:51:09,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 01:51:09,872 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 01:51:09,873 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 01:51:09,873 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 01:51:09,873 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 01:51:09,874 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 01:51:09,874 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 01:51:09,875 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 01:51:09,875 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 01:51:09,875 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 01:51:09,876 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 01:51:09,876 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 01:51:09,877 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 01:51:09,877 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 01:51:09,877 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 01:51:09,878 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 01:51:09,878 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 01:51:09,878 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 01:51:09,879 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 01:51:09,879 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 01:51:09,879 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 01:51:09,880 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 01:51:09,880 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 01:51:09,880 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 01:51:09,880 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 01:51:09,881 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 01:51:09,881 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 01:51:09,881 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 01:51:09,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:51:09,882 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 01:51:09,882 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 01:51:09,883 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 01:51:09,883 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 01:51:09,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 01:51:09,883 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 01:51:09,884 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 01:51:09,884 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 01:51:09,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 01:51:09,885 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ad27fb086e75bf8f5b08286d8e766d07abfe44ff39234568924cf55ade7a6d5 [2024-10-11 01:51:10,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 01:51:10,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 01:51:10,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 01:51:10,152 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 01:51:10,152 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 01:51:10,154 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i [2024-10-11 01:51:11,606 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 01:51:11,782 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 01:51:11,783 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i [2024-10-11 01:51:11,791 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fdebf9a96/6fea80e01a7e4fe1ad003ce1533cc629/FLAG3f44c1c96 [2024-10-11 01:51:12,182 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fdebf9a96/6fea80e01a7e4fe1ad003ce1533cc629 [2024-10-11 01:51:12,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 01:51:12,187 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 01:51:12,188 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 01:51:12,188 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 01:51:12,194 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 01:51:12,195 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:51:12" (1/1) ... [2024-10-11 01:51:12,198 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@464c9211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:12, skipping insertion in model container [2024-10-11 01:51:12,198 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:51:12" (1/1) ... [2024-10-11 01:51:12,241 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 01:51:12,427 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/loop-invgen/SpamAssassin-loop.i[893,906] [2024-10-11 01:51:12,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:51:12,482 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 01:51:12,493 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/loop-invgen/SpamAssassin-loop.i[893,906] [2024-10-11 01:51:12,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:51:12,512 INFO L204 MainTranslator]: Completed translation [2024-10-11 01:51:12,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:12 WrapperNode [2024-10-11 01:51:12,512 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 01:51:12,513 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 01:51:12,513 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 01:51:12,513 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 01:51:12,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:12" (1/1) ... [2024-10-11 01:51:12,525 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:12" (1/1) ... [2024-10-11 01:51:12,540 INFO L138 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2024-10-11 01:51:12,541 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 01:51:12,541 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 01:51:12,541 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 01:51:12,541 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 01:51:12,555 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:12" (1/1) ... [2024-10-11 01:51:12,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:12" (1/1) ... [2024-10-11 01:51:12,557 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:12" (1/1) ... [2024-10-11 01:51:12,571 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-11 01:51:12,571 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:12" (1/1) ... [2024-10-11 01:51:12,572 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:12" (1/1) ... [2024-10-11 01:51:12,574 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:12" (1/1) ... [2024-10-11 01:51:12,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:12" (1/1) ... [2024-10-11 01:51:12,578 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:12" (1/1) ... [2024-10-11 01:51:12,579 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:12" (1/1) ... [2024-10-11 01:51:12,581 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 01:51:12,581 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 01:51:12,581 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 01:51:12,582 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 01:51:12,582 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:12" (1/1) ... [2024-10-11 01:51:12,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:51:12,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:51:12,613 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 01:51:12,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 01:51:12,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 01:51:12,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 01:51:12,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 01:51:12,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 01:51:12,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 01:51:12,665 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 01:51:12,732 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 01:51:12,734 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 01:51:12,912 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 01:51:12,912 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 01:51:12,941 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 01:51:12,942 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 01:51:12,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:51:12 BoogieIcfgContainer [2024-10-11 01:51:12,943 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 01:51:12,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 01:51:12,946 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 01:51:12,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 01:51:12,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:51:12" (1/3) ... [2024-10-11 01:51:12,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5037e918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:51:12, skipping insertion in model container [2024-10-11 01:51:12,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:12" (2/3) ... [2024-10-11 01:51:12,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5037e918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:51:12, skipping insertion in model container [2024-10-11 01:51:12,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:51:12" (3/3) ... [2024-10-11 01:51:12,952 INFO L112 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2024-10-11 01:51:12,967 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 01:51:12,967 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 01:51:13,030 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 01:51:13,037 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;@16946578, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 01:51:13,038 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 01:51:13,041 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 01:51:13,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 01:51:13,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:51:13,048 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:51:13,048 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:51:13,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:51:13,053 INFO L85 PathProgramCache]: Analyzing trace with hash -998756722, now seen corresponding path program 1 times [2024-10-11 01:51:13,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:51:13,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116054665] [2024-10-11 01:51:13,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:13,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:51:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:13,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:51:13,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:51:13,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116054665] [2024-10-11 01:51:13,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116054665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:51:13,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:51:13,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 01:51:13,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187254295] [2024-10-11 01:51:13,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:51:13,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 01:51:13,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:51:13,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 01:51:13,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:51:13,368 INFO L87 Difference]: Start difference. First operand has 36 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:51:13,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:51:13,513 INFO L93 Difference]: Finished difference Result 76 states and 139 transitions. [2024-10-11 01:51:13,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 01:51:13,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 01:51:13,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:51:13,522 INFO L225 Difference]: With dead ends: 76 [2024-10-11 01:51:13,523 INFO L226 Difference]: Without dead ends: 39 [2024-10-11 01:51:13,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:51:13,529 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 8 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:51:13,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 141 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:51:13,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-11 01:51:13,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-10-11 01:51:13,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 01:51:13,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2024-10-11 01:51:13,587 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 9 [2024-10-11 01:51:13,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:51:13,587 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2024-10-11 01:51:13,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:51:13,588 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2024-10-11 01:51:13,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 01:51:13,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:51:13,588 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:51:13,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 01:51:13,589 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:51:13,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:51:13,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1020712689, now seen corresponding path program 1 times [2024-10-11 01:51:13,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:51:13,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372956146] [2024-10-11 01:51:13,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:13,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:51:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:13,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:51:13,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:51:13,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372956146] [2024-10-11 01:51:13,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372956146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:51:13,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:51:13,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 01:51:13,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554321195] [2024-10-11 01:51:13,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:51:13,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 01:51:13,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:51:13,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 01:51:13,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:51:13,742 INFO L87 Difference]: Start difference. First operand 37 states and 54 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:51:13,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:51:13,861 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2024-10-11 01:51:13,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 01:51:13,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 01:51:13,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:51:13,865 INFO L225 Difference]: With dead ends: 52 [2024-10-11 01:51:13,866 INFO L226 Difference]: Without dead ends: 50 [2024-10-11 01:51:13,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:51:13,868 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:51:13,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 177 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:51:13,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-11 01:51:13,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2024-10-11 01:51:13,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 01:51:13,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2024-10-11 01:51:13,884 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 9 [2024-10-11 01:51:13,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:51:13,884 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 62 transitions. [2024-10-11 01:51:13,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:51:13,884 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2024-10-11 01:51:13,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 01:51:13,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:51:13,885 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:51:13,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 01:51:13,886 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:51:13,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:51:13,887 INFO L85 PathProgramCache]: Analyzing trace with hash -827859626, now seen corresponding path program 1 times [2024-10-11 01:51:13,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:51:13,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587053959] [2024-10-11 01:51:13,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:13,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:51:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:14,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 01:51:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:14,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:51:14,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:51:14,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587053959] [2024-10-11 01:51:14,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587053959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:51:14,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:51:14,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 01:51:14,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446038233] [2024-10-11 01:51:14,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:51:14,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 01:51:14,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:51:14,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 01:51:14,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:51:14,031 INFO L87 Difference]: Start difference. First operand 46 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:51:14,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:51:14,155 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2024-10-11 01:51:14,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 01:51:14,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-11 01:51:14,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:51:14,158 INFO L225 Difference]: With dead ends: 52 [2024-10-11 01:51:14,158 INFO L226 Difference]: Without dead ends: 50 [2024-10-11 01:51:14,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:51:14,163 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 9 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:51:14,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 118 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:51:14,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-11 01:51:14,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-11 01:51:14,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 01:51:14,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 65 transitions. [2024-10-11 01:51:14,190 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 65 transitions. Word has length 14 [2024-10-11 01:51:14,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:51:14,190 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 65 transitions. [2024-10-11 01:51:14,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:51:14,190 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2024-10-11 01:51:14,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 01:51:14,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:51:14,192 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:51:14,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 01:51:14,193 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:51:14,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:51:14,194 INFO L85 PathProgramCache]: Analyzing trace with hash 175850318, now seen corresponding path program 1 times [2024-10-11 01:51:14,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:51:14,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817009939] [2024-10-11 01:51:14,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:14,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:51:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:14,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 01:51:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:14,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 01:51:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:14,354 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 01:51:14,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:51:14,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817009939] [2024-10-11 01:51:14,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817009939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:51:14,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:51:14,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 01:51:14,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687396948] [2024-10-11 01:51:14,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:51:14,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 01:51:14,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:51:14,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 01:51:14,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:51:14,358 INFO L87 Difference]: Start difference. First operand 50 states and 65 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 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-11 01:51:14,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:51:14,494 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2024-10-11 01:51:14,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 01:51:14,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 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 19 [2024-10-11 01:51:14,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:51:14,496 INFO L225 Difference]: With dead ends: 56 [2024-10-11 01:51:14,496 INFO L226 Difference]: Without dead ends: 54 [2024-10-11 01:51:14,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 01:51:14,497 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 18 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:51:14,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 158 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:51:14,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-11 01:51:14,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-11 01:51:14,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 01:51:14,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2024-10-11 01:51:14,527 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 19 [2024-10-11 01:51:14,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:51:14,527 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2024-10-11 01:51:14,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 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-11 01:51:14,531 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2024-10-11 01:51:14,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 01:51:14,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:51:14,532 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:51:14,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 01:51:14,533 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:51:14,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:51:14,533 INFO L85 PathProgramCache]: Analyzing trace with hash 994963478, now seen corresponding path program 1 times [2024-10-11 01:51:14,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:51:14,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152761767] [2024-10-11 01:51:14,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:14,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:51:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:14,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 01:51:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:14,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 01:51:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:14,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 01:51:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:14,624 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 01:51:14,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:51:14,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152761767] [2024-10-11 01:51:14,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152761767] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:51:14,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:51:14,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 01:51:14,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521558874] [2024-10-11 01:51:14,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:51:14,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 01:51:14,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:51:14,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 01:51:14,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:51:14,627 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 01:51:14,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:51:14,717 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2024-10-11 01:51:14,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 01:51:14,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-10-11 01:51:14,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:51:14,720 INFO L225 Difference]: With dead ends: 60 [2024-10-11 01:51:14,720 INFO L226 Difference]: Without dead ends: 58 [2024-10-11 01:51:14,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:51:14,721 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 7 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:51:14,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 125 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:51:14,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-11 01:51:14,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-11 01:51:14,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 01:51:14,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2024-10-11 01:51:14,745 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 24 [2024-10-11 01:51:14,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:51:14,746 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2024-10-11 01:51:14,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 01:51:14,746 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2024-10-11 01:51:14,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 01:51:14,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:51:14,747 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:51:14,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 01:51:14,748 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:51:14,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:51:14,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1250005993, now seen corresponding path program 1 times [2024-10-11 01:51:14,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:51:14,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596714001] [2024-10-11 01:51:14,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:14,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:51:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:14,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 01:51:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:14,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 01:51:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:14,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 01:51:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:14,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 01:51:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:14,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 01:51:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:14,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 01:51:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:14,866 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 01:51:14,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:51:14,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596714001] [2024-10-11 01:51:14,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596714001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:51:14,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:51:14,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 01:51:14,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173920451] [2024-10-11 01:51:14,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:51:14,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 01:51:14,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:51:14,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 01:51:14,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:51:14,871 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 01:51:14,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:51:14,979 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2024-10-11 01:51:14,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 01:51:14,981 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), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 42 [2024-10-11 01:51:14,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:51:14,982 INFO L225 Difference]: With dead ends: 70 [2024-10-11 01:51:14,983 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 01:51:14,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:51:14,984 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:51:14,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 138 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:51:14,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 01:51:15,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2024-10-11 01:51:15,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 17 states have call successors, (17), 8 states have call predecessors, (17), 8 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 01:51:15,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2024-10-11 01:51:15,002 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 42 [2024-10-11 01:51:15,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:51:15,002 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2024-10-11 01:51:15,002 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), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 01:51:15,003 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2024-10-11 01:51:15,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 01:51:15,004 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:51:15,004 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:51:15,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 01:51:15,005 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:51:15,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:51:15,005 INFO L85 PathProgramCache]: Analyzing trace with hash 432071401, now seen corresponding path program 1 times [2024-10-11 01:51:15,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:51:15,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407448427] [2024-10-11 01:51:15,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:15,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:51:15,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:15,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 01:51:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:15,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 01:51:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:15,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 01:51:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:15,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 01:51:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:15,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 01:51:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:15,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 01:51:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:15,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 01:51:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:15,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 01:51:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:15,167 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 01:51:15,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:51:15,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407448427] [2024-10-11 01:51:15,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407448427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:51:15,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:51:15,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 01:51:15,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272579794] [2024-10-11 01:51:15,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:51:15,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 01:51:15,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:51:15,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 01:51:15,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:51:15,170 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 01:51:15,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:51:15,307 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2024-10-11 01:51:15,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 01:51:15,307 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 52 [2024-10-11 01:51:15,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:51:15,309 INFO L225 Difference]: With dead ends: 69 [2024-10-11 01:51:15,309 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 01:51:15,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-11 01:51:15,310 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 18 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:51:15,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 152 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:51:15,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 01:51:15,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2024-10-11 01:51:15,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 40 states have internal predecessors, (43), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 01:51:15,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2024-10-11 01:51:15,322 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 52 [2024-10-11 01:51:15,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:51:15,323 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2024-10-11 01:51:15,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 01:51:15,323 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2024-10-11 01:51:15,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 01:51:15,325 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:51:15,325 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:51:15,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 01:51:15,325 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:51:15,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:51:15,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1667354039, now seen corresponding path program 1 times [2024-10-11 01:51:15,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:51:15,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228056712] [2024-10-11 01:51:15,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:15,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:51:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:15,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 01:51:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:15,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 01:51:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:15,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 01:51:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:15,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 01:51:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:15,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 01:51:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:15,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 01:51:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:15,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 01:51:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:15,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 01:51:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:15,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 01:51:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:15,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 01:51:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:15,522 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-11 01:51:15,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:51:15,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228056712] [2024-10-11 01:51:15,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228056712] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:51:15,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:51:15,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 01:51:15,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876698188] [2024-10-11 01:51:15,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:51:15,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 01:51:15,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:51:15,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 01:51:15,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 01:51:15,525 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 01:51:15,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:51:15,664 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2024-10-11 01:51:15,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 01:51:15,664 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 63 [2024-10-11 01:51:15,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:51:15,665 INFO L225 Difference]: With dead ends: 67 [2024-10-11 01:51:15,665 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 01:51:15,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-11 01:51:15,668 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 20 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:51:15,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 137 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:51:15,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 01:51:15,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 01:51:15,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:51:15,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 01:51:15,672 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2024-10-11 01:51:15,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:51:15,673 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 01:51:15,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 01:51:15,673 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 01:51:15,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 01:51:15,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 01:51:15,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 01:51:15,680 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:51:15,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 01:51:15,969 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 01:51:15,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:51:15 BoogieIcfgContainer [2024-10-11 01:51:15,987 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 01:51:15,987 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 01:51:15,988 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 01:51:15,988 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 01:51:15,988 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:51:12" (3/4) ... [2024-10-11 01:51:15,990 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 01:51:15,993 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-11 01:51:15,997 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-11 01:51:15,998 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-11 01:51:15,998 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 01:51:15,998 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 01:51:16,090 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 01:51:16,091 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 01:51:16,091 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 01:51:16,091 INFO L158 Benchmark]: Toolchain (without parser) took 3904.85ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 94.6MB in the beginning and 156.1MB in the end (delta: -61.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 01:51:16,092 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory is still 50.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 01:51:16,092 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.85ms. Allocated memory is still 161.5MB. Free memory was 94.6MB in the beginning and 131.1MB in the end (delta: -36.4MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-10-11 01:51:16,092 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.67ms. Allocated memory is still 161.5MB. Free memory was 131.1MB in the beginning and 129.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 01:51:16,092 INFO L158 Benchmark]: Boogie Preprocessor took 39.49ms. Allocated memory is still 161.5MB. Free memory was 129.1MB in the beginning and 127.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 01:51:16,093 INFO L158 Benchmark]: RCFGBuilder took 361.62ms. Allocated memory is still 161.5MB. Free memory was 127.9MB in the beginning and 114.4MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 01:51:16,093 INFO L158 Benchmark]: TraceAbstraction took 3041.36ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 113.2MB in the beginning and 161.3MB in the end (delta: -48.1MB). Peak memory consumption was 82.7MB. Max. memory is 16.1GB. [2024-10-11 01:51:16,093 INFO L158 Benchmark]: Witness Printer took 103.58ms. Allocated memory is still 195.0MB. Free memory was 161.3MB in the beginning and 156.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 01:51:16,095 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory is still 50.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.85ms. Allocated memory is still 161.5MB. Free memory was 94.6MB in the beginning and 131.1MB in the end (delta: -36.4MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.67ms. Allocated memory is still 161.5MB. Free memory was 131.1MB in the beginning and 129.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.49ms. Allocated memory is still 161.5MB. Free memory was 129.1MB in the beginning and 127.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 361.62ms. Allocated memory is still 161.5MB. Free memory was 127.9MB in the beginning and 114.4MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3041.36ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 113.2MB in the beginning and 161.3MB in the end (delta: -48.1MB). Peak memory consumption was 82.7MB. Max. memory is 16.1GB. * Witness Printer took 103.58ms. Allocated memory is still 195.0MB. Free memory was 161.3MB in the beginning and 156.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 162 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 94 mSDsluCounter, 1146 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 797 mSDsCounter, 105 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 533 IncrementalHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 105 mSolverCounterUnsat, 349 mSDtfsCounter, 533 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=7, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 224 ConstructedInterpolants, 0 QuantifiedInterpolants, 522 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 428/428 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 56]: Location Invariant Derived location invariant: (((((((long long) i + 1) <= len) && (0 <= j)) && (((long long) 5 + j) <= bufsize)) && (0 <= i)) && (((long long) limit + 4) <= bufsize)) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((0 <= j) && (0 <= i)) && (((long long) limit + 4) <= bufsize)) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((0 <= i) && (((long long) limit + 4) <= bufsize)) - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-10-11 01:51:16,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 Result: TRUE