./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f21a3dad-b421-48e8-8794-c65a258d9328/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f21a3dad-b421-48e8-8794-c65a258d9328/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f21a3dad-b421-48e8-8794-c65a258d9328/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f21a3dad-b421-48e8-8794-c65a258d9328/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f21a3dad-b421-48e8-8794-c65a258d9328/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f21a3dad-b421-48e8-8794-c65a258d9328/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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.3-dev-e7bb482 [2023-11-06 22:53:17,525 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:53:17,609 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f21a3dad-b421-48e8-8794-c65a258d9328/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:53:17,616 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:53:17,616 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:53:17,647 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:53:17,647 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:53:17,648 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:53:17,649 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:53:17,650 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:53:17,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:53:17,651 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:53:17,652 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:53:17,653 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:53:17,654 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:53:17,654 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:53:17,655 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:53:17,656 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:53:17,656 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:53:17,657 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:53:17,657 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:53:17,658 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:53:17,659 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:53:17,659 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:53:17,660 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:53:17,660 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:53:17,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:53:17,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:53:17,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:53:17,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:53:17,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:53:17,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:53:17,664 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:53:17,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:53:17,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:53:17,666 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:53:17,666 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:53:17,667 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:53:17,667 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:53:17,668 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f21a3dad-b421-48e8-8794-c65a258d9328/bin/uautomizer-verify-WvqO1wxjHP/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f21a3dad-b421-48e8-8794-c65a258d9328/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 [2023-11-06 22:53:17,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:53:18,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:53:18,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:53:18,034 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:53:18,034 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:53:18,036 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f21a3dad-b421-48e8-8794-c65a258d9328/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i [2023-11-06 22:53:21,820 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:53:22,080 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:53:22,081 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f21a3dad-b421-48e8-8794-c65a258d9328/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i [2023-11-06 22:53:22,089 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f21a3dad-b421-48e8-8794-c65a258d9328/bin/uautomizer-verify-WvqO1wxjHP/data/c684b4a92/4ac15eb4cf2345f984594fd07cb3facb/FLAGc0894e9a1 [2023-11-06 22:53:22,106 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f21a3dad-b421-48e8-8794-c65a258d9328/bin/uautomizer-verify-WvqO1wxjHP/data/c684b4a92/4ac15eb4cf2345f984594fd07cb3facb [2023-11-06 22:53:22,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:53:22,110 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:53:22,112 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:53:22,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:53:22,124 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:53:22,129 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:53:22" (1/1) ... [2023-11-06 22:53:22,131 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9edb44a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:22, skipping insertion in model container [2023-11-06 22:53:22,131 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:53:22" (1/1) ... [2023-11-06 22:53:22,165 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:53:22,415 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f21a3dad-b421-48e8-8794-c65a258d9328/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i[893,906] [2023-11-06 22:53:22,447 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:53:22,459 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:53:22,476 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f21a3dad-b421-48e8-8794-c65a258d9328/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i[893,906] [2023-11-06 22:53:22,486 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:53:22,504 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:53:22,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:22 WrapperNode [2023-11-06 22:53:22,505 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:53:22,507 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:53:22,507 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:53:22,508 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:53:22,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:22" (1/1) ... [2023-11-06 22:53:22,526 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:22" (1/1) ... [2023-11-06 22:53:22,551 INFO L138 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2023-11-06 22:53:22,551 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:53:22,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:53:22,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:53:22,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:53:22,565 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:22" (1/1) ... [2023-11-06 22:53:22,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:22" (1/1) ... [2023-11-06 22:53:22,567 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:22" (1/1) ... [2023-11-06 22:53:22,567 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:22" (1/1) ... [2023-11-06 22:53:22,572 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:22" (1/1) ... [2023-11-06 22:53:22,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:22" (1/1) ... [2023-11-06 22:53:22,578 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:22" (1/1) ... [2023-11-06 22:53:22,580 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:22" (1/1) ... [2023-11-06 22:53:22,582 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:53:22,584 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:53:22,584 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:53:22,584 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:53:22,585 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:22" (1/1) ... [2023-11-06 22:53:22,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:53:22,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f21a3dad-b421-48e8-8794-c65a258d9328/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:53:22,629 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f21a3dad-b421-48e8-8794-c65a258d9328/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:53:22,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f21a3dad-b421-48e8-8794-c65a258d9328/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:53:22,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:53:22,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:53:22,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:53:22,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:53:22,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-06 22:53:22,676 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-06 22:53:22,770 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:53:22,772 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:53:23,034 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:53:23,042 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:53:23,042 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-06 22:53:23,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:53:23 BoogieIcfgContainer [2023-11-06 22:53:23,045 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:53:23,049 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:53:23,049 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:53:23,053 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:53:23,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:53:22" (1/3) ... [2023-11-06 22:53:23,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cefd387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:53:23, skipping insertion in model container [2023-11-06 22:53:23,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:53:22" (2/3) ... [2023-11-06 22:53:23,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cefd387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:53:23, skipping insertion in model container [2023-11-06 22:53:23,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:53:23" (3/3) ... [2023-11-06 22:53:23,056 INFO L112 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2023-11-06 22:53:23,077 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:53:23,078 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:53:23,129 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:53:23,136 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@5a953431, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:53:23,136 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:53:23,140 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 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) [2023-11-06 22:53:23,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 22:53:23,149 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:53:23,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:23,150 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:53:23,156 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:23,156 INFO L85 PathProgramCache]: Analyzing trace with hash -667640892, now seen corresponding path program 1 times [2023-11-06 22:53:23,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:23,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636562187] [2023-11-06 22:53:23,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:23,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:23,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:23,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:23,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636562187] [2023-11-06 22:53:23,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636562187] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:53:23,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:53:23,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:53:23,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583115410] [2023-11-06 22:53:23,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:53:23,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:53:23,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:23,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:53:23,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:53:23,743 INFO L87 Difference]: Start difference. First operand has 38 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 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.8) internal successors, (9), 4 states have internal predecessors, (9), 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) [2023-11-06 22:53:23,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:23,975 INFO L93 Difference]: Finished difference Result 79 states and 142 transitions. [2023-11-06 22:53:23,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:53:23,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2023-11-06 22:53:23,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:53:23,989 INFO L225 Difference]: With dead ends: 79 [2023-11-06 22:53:23,990 INFO L226 Difference]: Without dead ends: 40 [2023-11-06 22:53:23,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:53:24,000 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 11 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:53:24,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 154 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:53:24,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-11-06 22:53:24,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2023-11-06 22:53:24,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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) [2023-11-06 22:53:24,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2023-11-06 22:53:24,066 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 55 transitions. Word has length 10 [2023-11-06 22:53:24,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:53:24,066 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 55 transitions. [2023-11-06 22:53:24,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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) [2023-11-06 22:53:24,067 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 55 transitions. [2023-11-06 22:53:24,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 22:53:24,069 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:53:24,069 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:24,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:53:24,070 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:53:24,071 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:24,071 INFO L85 PathProgramCache]: Analyzing trace with hash -689596859, now seen corresponding path program 1 times [2023-11-06 22:53:24,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:24,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621826877] [2023-11-06 22:53:24,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:24,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:24,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:24,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:24,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621826877] [2023-11-06 22:53:24,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621826877] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:53:24,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:53:24,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:53:24,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876002413] [2023-11-06 22:53:24,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:53:24,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:53:24,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:24,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:53:24,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:53:24,226 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) [2023-11-06 22:53:24,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:24,380 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2023-11-06 22:53:24,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:53:24,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2023-11-06 22:53:24,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:53:24,383 INFO L225 Difference]: With dead ends: 53 [2023-11-06 22:53:24,384 INFO L226 Difference]: Without dead ends: 51 [2023-11-06 22:53:24,384 INFO L412 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 [2023-11-06 22:53:24,387 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 7 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:53:24,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 182 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:53:24,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-06 22:53:24,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2023-11-06 22:53:24,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 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) [2023-11-06 22:53:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 63 transitions. [2023-11-06 22:53:24,439 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 63 transitions. Word has length 10 [2023-11-06 22:53:24,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:53:24,440 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 63 transitions. [2023-11-06 22:53:24,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) [2023-11-06 22:53:24,440 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2023-11-06 22:53:24,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-06 22:53:24,441 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:53:24,441 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:24,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:53:24,442 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:53:24,443 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:24,443 INFO L85 PathProgramCache]: Analyzing trace with hash 214778336, now seen corresponding path program 1 times [2023-11-06 22:53:24,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:24,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671457911] [2023-11-06 22:53:24,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:24,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:24,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:53:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:24,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:53:24,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:24,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671457911] [2023-11-06 22:53:24,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671457911] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:53:24,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:53:24,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:53:24,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127875626] [2023-11-06 22:53:24,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:53:24,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:53:24,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:24,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:53:24,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:53:24,676 INFO L87 Difference]: Start difference. First operand 47 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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) [2023-11-06 22:53:24,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:24,780 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2023-11-06 22:53:24,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:53:24,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 15 [2023-11-06 22:53:24,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:53:24,784 INFO L225 Difference]: With dead ends: 53 [2023-11-06 22:53:24,784 INFO L226 Difference]: Without dead ends: 51 [2023-11-06 22:53:24,785 INFO L412 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 [2023-11-06 22:53:24,787 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 123 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 [2023-11-06 22:53:24,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 123 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:53:24,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-06 22:53:24,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-11-06 22:53:24,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 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) [2023-11-06 22:53:24,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2023-11-06 22:53:24,806 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 15 [2023-11-06 22:53:24,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:53:24,806 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2023-11-06 22:53:24,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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) [2023-11-06 22:53:24,807 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2023-11-06 22:53:24,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-06 22:53:24,808 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:53:24,808 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:24,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:53:24,809 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:53:24,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:24,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1804674308, now seen corresponding path program 1 times [2023-11-06 22:53:24,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:24,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422835449] [2023-11-06 22:53:24,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:24,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:24,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:53:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:25,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:53:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:25,015 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 22:53:25,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:25,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422835449] [2023-11-06 22:53:25,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422835449] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:53:25,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:53:25,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:53:25,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768431934] [2023-11-06 22:53:25,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:53:25,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:53:25,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:25,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:53:25,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:53:25,027 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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) [2023-11-06 22:53:25,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:25,231 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2023-11-06 22:53:25,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:53:25,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 20 [2023-11-06 22:53:25,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:53:25,236 INFO L225 Difference]: With dead ends: 57 [2023-11-06 22:53:25,237 INFO L226 Difference]: Without dead ends: 55 [2023-11-06 22:53:25,237 INFO L412 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 [2023-11-06 22:53:25,250 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 19 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:53:25,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 164 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:53:25,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-06 22:53:25,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-11-06 22:53:25,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 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) [2023-11-06 22:53:25,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2023-11-06 22:53:25,284 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 20 [2023-11-06 22:53:25,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:53:25,284 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2023-11-06 22:53:25,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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) [2023-11-06 22:53:25,285 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2023-11-06 22:53:25,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-06 22:53:25,287 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:53:25,287 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:25,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:53:25,288 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:53:25,290 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:25,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1749987360, now seen corresponding path program 1 times [2023-11-06 22:53:25,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:25,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259525288] [2023-11-06 22:53:25,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:25,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:25,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:53:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:25,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:53:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:25,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:53:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:25,397 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-06 22:53:25,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:25,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259525288] [2023-11-06 22:53:25,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259525288] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:53:25,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:53:25,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:53:25,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950694919] [2023-11-06 22:53:25,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:53:25,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:53:25,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:25,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:53:25,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:53:25,400 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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) [2023-11-06 22:53:25,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:25,496 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2023-11-06 22:53:25,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:53:25,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 25 [2023-11-06 22:53:25,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:53:25,498 INFO L225 Difference]: With dead ends: 62 [2023-11-06 22:53:25,498 INFO L226 Difference]: Without dead ends: 60 [2023-11-06 22:53:25,499 INFO L412 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 [2023-11-06 22:53:25,500 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 9 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:53:25,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 133 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:53:25,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-06 22:53:25,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2023-11-06 22:53:25,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 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) [2023-11-06 22:53:25,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2023-11-06 22:53:25,534 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 25 [2023-11-06 22:53:25,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:53:25,535 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2023-11-06 22:53:25,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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) [2023-11-06 22:53:25,535 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2023-11-06 22:53:25,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-06 22:53:25,538 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:53:25,538 INFO L195 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, 1] [2023-11-06 22:53:25,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:53:25,539 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:53:25,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:25,540 INFO L85 PathProgramCache]: Analyzing trace with hash 158999923, now seen corresponding path program 1 times [2023-11-06 22:53:25,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:25,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074487771] [2023-11-06 22:53:25,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:25,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:25,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:53:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:25,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:53:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:25,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:53:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:25,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:53:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:25,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:53:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:25,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:53:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:25,764 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-06 22:53:25,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:25,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074487771] [2023-11-06 22:53:25,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074487771] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:53:25,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:53:25,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:53:25,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653327443] [2023-11-06 22:53:25,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:53:25,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:53:25,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:25,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:53:25,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:53:25,774 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2023-11-06 22:53:25,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:25,944 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2023-11-06 22:53:25,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:53:25,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 43 [2023-11-06 22:53:25,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:53:25,952 INFO L225 Difference]: With dead ends: 71 [2023-11-06 22:53:25,953 INFO L226 Difference]: Without dead ends: 69 [2023-11-06 22:53:25,953 INFO L412 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 [2023-11-06 22:53:25,956 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 10 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:53:25,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 171 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:53:25,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-06 22:53:25,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2023-11-06 22:53:25,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 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) [2023-11-06 22:53:25,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2023-11-06 22:53:25,993 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 43 [2023-11-06 22:53:25,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:53:25,994 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2023-11-06 22:53:25,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2023-11-06 22:53:25,994 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2023-11-06 22:53:26,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-06 22:53:26,003 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:53:26,003 INFO L195 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, 1] [2023-11-06 22:53:26,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:53:26,004 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:53:26,004 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:26,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1329631219, now seen corresponding path program 1 times [2023-11-06 22:53:26,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:26,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385324961] [2023-11-06 22:53:26,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:26,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:26,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:53:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:26,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:53:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:26,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:53:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:26,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:53:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:26,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:53:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:26,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:53:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:26,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:53:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:26,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:53:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:26,173 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-06 22:53:26,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:26,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385324961] [2023-11-06 22:53:26,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385324961] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:53:26,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:53:26,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:53:26,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703939617] [2023-11-06 22:53:26,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:53:26,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:53:26,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:26,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:53:26,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:53:26,177 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) [2023-11-06 22:53:26,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:26,371 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2023-11-06 22:53:26,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:53:26,372 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 53 [2023-11-06 22:53:26,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:53:26,376 INFO L225 Difference]: With dead ends: 71 [2023-11-06 22:53:26,376 INFO L226 Difference]: Without dead ends: 69 [2023-11-06 22:53:26,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:53:26,396 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 20 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:53:26,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 161 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:53:26,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-06 22:53:26,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2023-11-06 22:53:26,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 40 states have (on average 1.1) internal successors, (44), 41 states have internal predecessors, (44), 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) [2023-11-06 22:53:26,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2023-11-06 22:53:26,432 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 53 [2023-11-06 22:53:26,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:53:26,432 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2023-11-06 22:53:26,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) [2023-11-06 22:53:26,433 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2023-11-06 22:53:26,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 22:53:26,435 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:53:26,435 INFO L195 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, 1] [2023-11-06 22:53:26,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:53:26,436 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:53:26,438 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:53:26,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1418667265, now seen corresponding path program 1 times [2023-11-06 22:53:26,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:53:26,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192933565] [2023-11-06 22:53:26,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:53:26,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:53:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:26,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-06 22:53:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:26,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:53:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:26,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-06 22:53:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:26,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:53:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:26,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:53:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:26,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:53:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:26,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:53:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:26,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:53:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:26,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:53:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:26,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:53:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:53:26,687 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-11-06 22:53:26,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:53:26,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192933565] [2023-11-06 22:53:26,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192933565] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:53:26,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:53:26,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:53:26,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295067412] [2023-11-06 22:53:26,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:53:26,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:53:26,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:53:26,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:53:26,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:53:26,690 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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) [2023-11-06 22:53:26,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:53:26,912 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2023-11-06 22:53:26,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:53:26,913 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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 64 [2023-11-06 22:53:26,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:53:26,915 INFO L225 Difference]: With dead ends: 69 [2023-11-06 22:53:26,915 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:53:26,920 INFO L412 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 [2023-11-06 22:53:26,922 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 18 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:53:26,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 188 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:53:26,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:53:26,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:53:26,924 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) [2023-11-06 22:53:26,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:53:26,925 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2023-11-06 22:53:26,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:53:26,925 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:53:26,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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) [2023-11-06 22:53:26,925 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:53:26,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:53:26,936 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:53:26,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:53:26,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:53:27,385 INFO L895 garLoopResultBuilder]: At program point L35-2(lines 35 64) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-11-06 22:53:27,385 INFO L899 garLoopResultBuilder]: For program point L31(line 31) no Hoare annotation was computed. [2023-11-06 22:53:27,386 INFO L899 garLoopResultBuilder]: For program point L60(line 60) no Hoare annotation was computed. [2023-11-06 22:53:27,386 INFO L895 garLoopResultBuilder]: At program point L56(lines 36 63) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-11-06 22:53:27,386 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (<= (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-11-06 22:53:27,386 INFO L895 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (and (<= (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-11-06 22:53:27,387 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-11-06 22:53:27,387 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 24 67) the Hoare annotation is: true [2023-11-06 22:53:27,387 INFO L895 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-11-06 22:53:27,387 INFO L895 garLoopResultBuilder]: At program point L40-1(line 40) the Hoare annotation is: (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-11-06 22:53:27,387 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 63) no Hoare annotation was computed. [2023-11-06 22:53:27,387 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:53:27,388 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:53:27,388 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-11-06 22:53:27,388 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-11-06 22:53:27,388 INFO L899 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2023-11-06 22:53:27,388 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-11-06 22:53:27,389 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-11-06 22:53:27,389 INFO L895 garLoopResultBuilder]: At program point L37-1(line 37) the Hoare annotation is: (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-11-06 22:53:27,389 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:53:27,391 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-11-06 22:53:27,391 INFO L895 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-11-06 22:53:27,392 INFO L895 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-11-06 22:53:27,392 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (and (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-11-06 22:53:27,392 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:53:27,392 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2023-11-06 22:53:27,393 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 65) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-11-06 22:53:27,393 INFO L899 garLoopResultBuilder]: For program point L34-3(lines 34 65) no Hoare annotation was computed. [2023-11-06 22:53:27,393 INFO L895 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= (+ 5 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~bufsize~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-11-06 22:53:27,393 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|) (<= (+ |ULTIMATE.start_main_~limit~0#1| 4) |ULTIMATE.start_main_~bufsize~0#1|)) [2023-11-06 22:53:27,394 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2023-11-06 22:53:27,394 INFO L899 garLoopResultBuilder]: For program point L39(line 39) no Hoare annotation was computed. [2023-11-06 22:53:27,394 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2023-11-06 22:53:27,394 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2023-11-06 22:53:27,395 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 17 22) the Hoare annotation is: true [2023-11-06 22:53:27,395 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 22:53:27,395 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 22:53:27,395 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2023-11-06 22:53:27,399 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:53:27,402 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:53:27,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:53:27 BoogieIcfgContainer [2023-11-06 22:53:27,423 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:53:27,423 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:53:27,423 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:53:27,424 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:53:27,424 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:53:23" (3/4) ... [2023-11-06 22:53:27,428 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:53:27,433 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-11-06 22:53:27,443 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2023-11-06 22:53:27,443 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 22:53:27,443 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:53:27,444 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:53:27,545 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f21a3dad-b421-48e8-8794-c65a258d9328/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:53:27,546 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f21a3dad-b421-48e8-8794-c65a258d9328/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:53:27,546 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:53:27,547 INFO L158 Benchmark]: Toolchain (without parser) took 5436.90ms. Allocated memory was 132.1MB in the beginning and 180.4MB in the end (delta: 48.2MB). Free memory was 87.1MB in the beginning and 78.2MB in the end (delta: 8.9MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. [2023-11-06 22:53:27,548 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 132.1MB. Free memory is still 106.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:53:27,548 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.15ms. Allocated memory is still 132.1MB. Free memory was 87.1MB in the beginning and 76.3MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:53:27,549 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.51ms. Allocated memory is still 132.1MB. Free memory was 76.3MB in the beginning and 74.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:53:27,549 INFO L158 Benchmark]: Boogie Preprocessor took 30.41ms. Allocated memory is still 132.1MB. Free memory was 74.6MB in the beginning and 73.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:53:27,550 INFO L158 Benchmark]: RCFGBuilder took 461.54ms. Allocated memory was 132.1MB in the beginning and 180.4MB in the end (delta: 48.2MB). Free memory was 73.3MB in the beginning and 150.5MB in the end (delta: -77.2MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2023-11-06 22:53:27,550 INFO L158 Benchmark]: TraceAbstraction took 4373.91ms. Allocated memory is still 180.4MB. Free memory was 149.4MB in the beginning and 82.4MB in the end (delta: 67.0MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. [2023-11-06 22:53:27,551 INFO L158 Benchmark]: Witness Printer took 123.25ms. Allocated memory is still 180.4MB. Free memory was 82.4MB in the beginning and 78.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:53:27,553 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.28ms. Allocated memory is still 132.1MB. Free memory is still 106.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 394.15ms. Allocated memory is still 132.1MB. Free memory was 87.1MB in the beginning and 76.3MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.51ms. Allocated memory is still 132.1MB. Free memory was 76.3MB in the beginning and 74.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.41ms. Allocated memory is still 132.1MB. Free memory was 74.6MB in the beginning and 73.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 461.54ms. Allocated memory was 132.1MB in the beginning and 180.4MB in the end (delta: 48.2MB). Free memory was 73.3MB in the beginning and 150.5MB in the end (delta: -77.2MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4373.91ms. Allocated memory is still 180.4MB. Free memory was 149.4MB in the beginning and 82.4MB in the end (delta: 67.0MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. * Witness Printer took 123.25ms. Allocated memory is still 180.4MB. Free memory was 82.4MB in the beginning and 78.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 172 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 104 mSDsluCounter, 1276 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 906 mSDsCounter, 104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 518 IncrementalHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 104 mSolverCounterUnsat, 370 mSDtfsCounter, 518 mSolverCounterSat, 0.1s 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=67occurred in iteration=7, InterpolantAutomatonStates: 55, 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, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 52 PreInvPairs, 74 NumberOfFragments, 365 HoareAnnotationTreeSize, 52 FomulaSimplifications, 677 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 20 FomulaSimplificationsInter, 152 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 232 ConstructedInterpolants, 0 QuantifiedInterpolants, 530 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: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((i + 1) <= len) && (0 <= j)) && ((5 + j) <= bufsize)) && (0 <= i)) && ((limit + 4) <= bufsize)) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((0 <= j) && (0 <= i)) && ((limit + 4) <= bufsize)) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((0 <= i) && ((limit + 4) <= bufsize)) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:53:27,606 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f21a3dad-b421-48e8-8794-c65a258d9328/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE