./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/heapsort.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b 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_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/heapsort.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro --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 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 18:40:11,813 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 18:40:11,816 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 18:40:11,850 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 18:40:11,853 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 18:40:11,859 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 18:40:11,861 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 18:40:11,870 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 18:40:11,871 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 18:40:11,873 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 18:40:11,875 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 18:40:11,876 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 18:40:11,877 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 18:40:11,881 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 18:40:11,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 18:40:11,885 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 18:40:11,887 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 18:40:11,894 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 18:40:11,896 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 18:40:11,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 18:40:11,902 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 18:40:11,904 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 18:40:11,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 18:40:11,907 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 18:40:11,911 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 18:40:11,914 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 18:40:11,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 18:40:11,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 18:40:11,918 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 18:40:11,919 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 18:40:11,919 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 18:40:11,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 18:40:11,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 18:40:11,924 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 18:40:11,925 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 18:40:11,925 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 18:40:11,926 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 18:40:11,927 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 18:40:11,927 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 18:40:11,928 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 18:40:11,929 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 18:40:11,930 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 18:40:11,976 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 18:40:11,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 18:40:11,977 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 18:40:11,977 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 18:40:11,978 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 18:40:11,978 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 18:40:11,979 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 18:40:11,979 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 18:40:11,979 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 18:40:11,980 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 18:40:11,981 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 18:40:11,981 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 18:40:11,981 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 18:40:11,981 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 18:40:11,982 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 18:40:11,982 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 18:40:11,982 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 18:40:11,982 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 18:40:11,982 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 18:40:11,983 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 18:40:11,983 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 18:40:11,983 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 18:40:11,983 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 18:40:11,984 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 18:40:11,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:40:11,984 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 18:40:11,986 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 18:40:11,986 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 18:40:11,986 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 18:40:11,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 18:40:11,987 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 18:40:11,987 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 18:40:11,987 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 18:40:11,987 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/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_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro 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 -> 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 [2022-11-18 18:40:12,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 18:40:12,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 18:40:12,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 18:40:12,389 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 18:40:12,390 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 18:40:12,405 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/loop-invgen/heapsort.i [2022-11-18 18:40:12,482 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/data/a72580da4/6e3cd9fdd4844cce9be2a794e5cd2024/FLAGc0629b884 [2022-11-18 18:40:13,056 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 18:40:13,059 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/sv-benchmarks/c/loop-invgen/heapsort.i [2022-11-18 18:40:13,067 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/data/a72580da4/6e3cd9fdd4844cce9be2a794e5cd2024/FLAGc0629b884 [2022-11-18 18:40:13,409 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/data/a72580da4/6e3cd9fdd4844cce9be2a794e5cd2024 [2022-11-18 18:40:13,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 18:40:13,415 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 18:40:13,418 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 18:40:13,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 18:40:13,422 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 18:40:13,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:40:13" (1/1) ... [2022-11-18 18:40:13,424 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52d301ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:40:13, skipping insertion in model container [2022-11-18 18:40:13,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:40:13" (1/1) ... [2022-11-18 18:40:13,433 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 18:40:13,451 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 18:40:13,650 WARN L234 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_02834a6c-d3d6-442d-8587-aadb10d3ff90/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2022-11-18 18:40:13,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:40:13,675 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 18:40:13,688 WARN L234 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_02834a6c-d3d6-442d-8587-aadb10d3ff90/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2022-11-18 18:40:13,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:40:13,710 INFO L208 MainTranslator]: Completed translation [2022-11-18 18:40:13,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:40:13 WrapperNode [2022-11-18 18:40:13,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 18:40:13,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 18:40:13,712 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 18:40:13,712 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 18:40:13,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:40:13" (1/1) ... [2022-11-18 18:40:13,729 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:40:13" (1/1) ... [2022-11-18 18:40:13,753 INFO L138 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2022-11-18 18:40:13,753 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 18:40:13,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 18:40:13,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 18:40:13,755 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 18:40:13,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:40:13" (1/1) ... [2022-11-18 18:40:13,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:40:13" (1/1) ... [2022-11-18 18:40:13,766 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:40:13" (1/1) ... [2022-11-18 18:40:13,766 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:40:13" (1/1) ... [2022-11-18 18:40:13,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:40:13" (1/1) ... [2022-11-18 18:40:13,774 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:40:13" (1/1) ... [2022-11-18 18:40:13,777 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:40:13" (1/1) ... [2022-11-18 18:40:13,779 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:40:13" (1/1) ... [2022-11-18 18:40:13,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 18:40:13,791 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 18:40:13,791 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 18:40:13,791 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 18:40:13,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:40:13" (1/1) ... [2022-11-18 18:40:13,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:40:13,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:40:13,832 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 18:40:13,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 18:40:13,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 18:40:13,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 18:40:13,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 18:40:13,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 18:40:13,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-18 18:40:13,876 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-18 18:40:13,942 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 18:40:13,944 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 18:40:14,195 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 18:40:14,211 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 18:40:14,212 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-18 18:40:14,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:40:14 BoogieIcfgContainer [2022-11-18 18:40:14,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 18:40:14,219 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 18:40:14,219 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 18:40:14,223 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 18:40:14,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 06:40:13" (1/3) ... [2022-11-18 18:40:14,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@735dd167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:40:14, skipping insertion in model container [2022-11-18 18:40:14,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:40:13" (2/3) ... [2022-11-18 18:40:14,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@735dd167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:40:14, skipping insertion in model container [2022-11-18 18:40:14,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:40:14" (3/3) ... [2022-11-18 18:40:14,227 INFO L112 eAbstractionObserver]: Analyzing ICFG heapsort.i [2022-11-18 18:40:14,246 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 18:40:14,246 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 18:40:14,321 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 18:40:14,332 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;@586a4771, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 18:40:14,332 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 18:40:14,336 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-18 18:40:14,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 18:40:14,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:40:14,346 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:40:14,347 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:40:14,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:40:14,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1754201352, now seen corresponding path program 1 times [2022-11-18 18:40:14,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:40:14,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925372899] [2022-11-18 18:40:14,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:40:14,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:40:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:14,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:40:14,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:40:14,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925372899] [2022-11-18 18:40:14,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925372899] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:40:14,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:40:14,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 18:40:14,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461094596] [2022-11-18 18:40:14,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:40:14,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 18:40:14,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:40:14,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 18:40:14,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 18:40:14,786 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) [2022-11-18 18:40:15,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:40:15,005 INFO L93 Difference]: Finished difference Result 104 states and 193 transitions. [2022-11-18 18:40:15,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 18:40:15,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 11 [2022-11-18 18:40:15,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:40:15,019 INFO L225 Difference]: With dead ends: 104 [2022-11-18 18:40:15,019 INFO L226 Difference]: Without dead ends: 61 [2022-11-18 18:40:15,027 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 [2022-11-18 18:40:15,033 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 25 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 220 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 [2022-11-18 18:40:15,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 220 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:40:15,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-18 18:40:15,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2022-11-18 18:40:15,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-18 18:40:15,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 57 transitions. [2022-11-18 18:40:15,102 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 57 transitions. Word has length 11 [2022-11-18 18:40:15,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:40:15,103 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 57 transitions. [2022-11-18 18:40:15,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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) [2022-11-18 18:40:15,104 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 57 transitions. [2022-11-18 18:40:15,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 18:40:15,106 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:40:15,106 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:40:15,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 18:40:15,106 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:40:15,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:40:15,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1749464583, now seen corresponding path program 1 times [2022-11-18 18:40:15,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:40:15,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132908485] [2022-11-18 18:40:15,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:40:15,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:40:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:15,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:40:15,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:40:15,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132908485] [2022-11-18 18:40:15,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132908485] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:40:15,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:40:15,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 18:40:15,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559255036] [2022-11-18 18:40:15,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:40:15,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 18:40:15,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:40:15,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 18:40:15,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 18:40:15,252 INFO L87 Difference]: Start difference. First operand 39 states and 57 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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) [2022-11-18 18:40:15,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:40:15,384 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-11-18 18:40:15,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 18:40:15,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 11 [2022-11-18 18:40:15,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:40:15,386 INFO L225 Difference]: With dead ends: 46 [2022-11-18 18:40:15,387 INFO L226 Difference]: Without dead ends: 44 [2022-11-18 18:40:15,388 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 [2022-11-18 18:40:15,390 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 17 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:40:15,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 137 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:40:15,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-18 18:40:15,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-11-18 18:40:15,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-18 18:40:15,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2022-11-18 18:40:15,410 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 11 [2022-11-18 18:40:15,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:40:15,411 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2022-11-18 18:40:15,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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) [2022-11-18 18:40:15,413 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2022-11-18 18:40:15,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 18:40:15,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:40:15,417 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:40:15,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 18:40:15,418 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:40:15,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:40:15,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1728015063, now seen corresponding path program 1 times [2022-11-18 18:40:15,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:40:15,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51088365] [2022-11-18 18:40:15,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:40:15,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:40:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:15,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:40:15,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:40:15,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51088365] [2022-11-18 18:40:15,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51088365] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:40:15,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:40:15,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 18:40:15,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747779360] [2022-11-18 18:40:15,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:40:15,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:40:15,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:40:15,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:40:15,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:40:15,610 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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) [2022-11-18 18:40:15,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:40:15,869 INFO L93 Difference]: Finished difference Result 76 states and 111 transitions. [2022-11-18 18:40:15,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 18:40:15,869 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 11 [2022-11-18 18:40:15,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:40:15,871 INFO L225 Difference]: With dead ends: 76 [2022-11-18 18:40:15,871 INFO L226 Difference]: Without dead ends: 74 [2022-11-18 18:40:15,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-18 18:40:15,885 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 33 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:40:15,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 184 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 18:40:15,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-18 18:40:15,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2022-11-18 18:40:15,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-11-18 18:40:15,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 102 transitions. [2022-11-18 18:40:15,900 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 102 transitions. Word has length 11 [2022-11-18 18:40:15,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:40:15,900 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 102 transitions. [2022-11-18 18:40:15,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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) [2022-11-18 18:40:15,901 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 102 transitions. [2022-11-18 18:40:15,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 18:40:15,902 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:40:15,902 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:40:15,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 18:40:15,902 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:40:15,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:40:15,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1885075524, now seen corresponding path program 1 times [2022-11-18 18:40:15,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:40:15,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713180219] [2022-11-18 18:40:15,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:40:15,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:40:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:16,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 18:40:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:16,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:40:16,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:40:16,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713180219] [2022-11-18 18:40:16,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713180219] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:40:16,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:40:16,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:40:16,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43783010] [2022-11-18 18:40:16,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:40:16,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:40:16,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:40:16,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:40:16,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:40:16,066 INFO L87 Difference]: Start difference. First operand 69 states and 102 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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) [2022-11-18 18:40:16,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:40:16,296 INFO L93 Difference]: Finished difference Result 102 states and 153 transitions. [2022-11-18 18:40:16,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 18:40:16,297 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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 16 [2022-11-18 18:40:16,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:40:16,299 INFO L225 Difference]: With dead ends: 102 [2022-11-18 18:40:16,299 INFO L226 Difference]: Without dead ends: 100 [2022-11-18 18:40:16,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-18 18:40:16,300 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 44 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:40:16,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 217 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 18:40:16,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-18 18:40:16,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2022-11-18 18:40:16,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 52 states have internal predecessors, (68), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-11-18 18:40:16,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 148 transitions. [2022-11-18 18:40:16,325 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 148 transitions. Word has length 16 [2022-11-18 18:40:16,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:40:16,326 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 148 transitions. [2022-11-18 18:40:16,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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) [2022-11-18 18:40:16,326 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 148 transitions. [2022-11-18 18:40:16,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 18:40:16,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:40:16,345 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:40:16,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 18:40:16,346 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:40:16,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:40:16,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1503713061, now seen corresponding path program 1 times [2022-11-18 18:40:16,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:40:16,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150496053] [2022-11-18 18:40:16,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:40:16,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:40:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:16,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 18:40:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:16,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:40:16,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:40:16,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150496053] [2022-11-18 18:40:16,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150496053] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:40:16,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:40:16,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 18:40:16,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774125429] [2022-11-18 18:40:16,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:40:16,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 18:40:16,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:40:16,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 18:40:16,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 18:40:16,471 INFO L87 Difference]: Start difference. First operand 97 states and 148 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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) [2022-11-18 18:40:16,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:40:16,561 INFO L93 Difference]: Finished difference Result 103 states and 153 transitions. [2022-11-18 18:40:16,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 18:40:16,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 16 [2022-11-18 18:40:16,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:40:16,565 INFO L225 Difference]: With dead ends: 103 [2022-11-18 18:40:16,565 INFO L226 Difference]: Without dead ends: 101 [2022-11-18 18:40:16,565 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 [2022-11-18 18:40:16,566 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 16 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:40:16,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 125 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:40:16,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-18 18:40:16,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-11-18 18:40:16,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 55 states have internal predecessors, (71), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2022-11-18 18:40:16,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 151 transitions. [2022-11-18 18:40:16,595 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 151 transitions. Word has length 16 [2022-11-18 18:40:16,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:40:16,596 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 151 transitions. [2022-11-18 18:40:16,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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) [2022-11-18 18:40:16,596 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 151 transitions. [2022-11-18 18:40:16,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 18:40:16,598 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:40:16,598 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:40:16,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 18:40:16,598 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:40:16,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:40:16,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1518715221, now seen corresponding path program 1 times [2022-11-18 18:40:16,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:40:16,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717460077] [2022-11-18 18:40:16,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:40:16,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:40:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:16,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 18:40:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:16,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:40:16,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:40:16,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717460077] [2022-11-18 18:40:16,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717460077] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:40:16,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:40:16,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:40:16,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545366433] [2022-11-18 18:40:16,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:40:16,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:40:16,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:40:16,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:40:16,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:40:16,705 INFO L87 Difference]: Start difference. First operand 101 states and 151 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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) [2022-11-18 18:40:16,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:40:16,977 INFO L93 Difference]: Finished difference Result 155 states and 240 transitions. [2022-11-18 18:40:16,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 18:40:16,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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 16 [2022-11-18 18:40:16,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:40:16,981 INFO L225 Difference]: With dead ends: 155 [2022-11-18 18:40:16,981 INFO L226 Difference]: Without dead ends: 153 [2022-11-18 18:40:16,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-18 18:40:16,982 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 60 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:40:16,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 245 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 18:40:16,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-18 18:40:17,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 137. [2022-11-18 18:40:17,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 72 states have internal predecessors, (94), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2022-11-18 18:40:17,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 214 transitions. [2022-11-18 18:40:17,017 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 214 transitions. Word has length 16 [2022-11-18 18:40:17,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:40:17,017 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 214 transitions. [2022-11-18 18:40:17,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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) [2022-11-18 18:40:17,018 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 214 transitions. [2022-11-18 18:40:17,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 18:40:17,019 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:40:17,019 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:40:17,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 18:40:17,019 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:40:17,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:40:17,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1823085758, now seen corresponding path program 1 times [2022-11-18 18:40:17,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:40:17,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382434370] [2022-11-18 18:40:17,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:40:17,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:40:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:17,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 18:40:17,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:17,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:40:17,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:40:17,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382434370] [2022-11-18 18:40:17,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382434370] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:40:17,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:40:17,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 18:40:17,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175635740] [2022-11-18 18:40:17,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:40:17,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:40:17,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:40:17,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:40:17,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:40:17,044 INFO L87 Difference]: Start difference. First operand 137 states and 214 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2022-11-18 18:40:17,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:40:17,097 INFO L93 Difference]: Finished difference Result 274 states and 436 transitions. [2022-11-18 18:40:17,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:40:17,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 16 [2022-11-18 18:40:17,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:40:17,100 INFO L225 Difference]: With dead ends: 274 [2022-11-18 18:40:17,100 INFO L226 Difference]: Without dead ends: 205 [2022-11-18 18:40:17,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:40:17,102 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 11 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 18:40:17,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 115 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 18:40:17,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-11-18 18:40:17,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-11-18 18:40:17,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 99 states have (on average 1.404040404040404) internal successors, (139), 103 states have internal predecessors, (139), 98 states have call successors, (98), 7 states have call predecessors, (98), 7 states have return successors, (98), 94 states have call predecessors, (98), 98 states have call successors, (98) [2022-11-18 18:40:17,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 335 transitions. [2022-11-18 18:40:17,151 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 335 transitions. Word has length 16 [2022-11-18 18:40:17,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:40:17,151 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 335 transitions. [2022-11-18 18:40:17,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2022-11-18 18:40:17,152 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 335 transitions. [2022-11-18 18:40:17,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 18:40:17,153 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:40:17,153 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:40:17,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 18:40:17,153 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:40:17,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:40:17,154 INFO L85 PathProgramCache]: Analyzing trace with hash -2105521235, now seen corresponding path program 1 times [2022-11-18 18:40:17,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:40:17,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666538704] [2022-11-18 18:40:17,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:40:17,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:40:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:17,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 18:40:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:17,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:40:17,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:40:17,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666538704] [2022-11-18 18:40:17,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666538704] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:40:17,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:40:17,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 18:40:17,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989932627] [2022-11-18 18:40:17,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:40:17,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 18:40:17,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:40:17,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 18:40:17,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 18:40:17,214 INFO L87 Difference]: Start difference. First operand 205 states and 335 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2022-11-18 18:40:17,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:40:17,335 INFO L93 Difference]: Finished difference Result 230 states and 359 transitions. [2022-11-18 18:40:17,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 18:40:17,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 16 [2022-11-18 18:40:17,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:40:17,339 INFO L225 Difference]: With dead ends: 230 [2022-11-18 18:40:17,340 INFO L226 Difference]: Without dead ends: 183 [2022-11-18 18:40:17,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:40:17,341 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 5 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:40:17,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 161 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:40:17,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-18 18:40:17,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2022-11-18 18:40:17,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 93 states have internal predecessors, (124), 86 states have call successors, (86), 7 states have call predecessors, (86), 7 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2022-11-18 18:40:17,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 296 transitions. [2022-11-18 18:40:17,379 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 296 transitions. Word has length 16 [2022-11-18 18:40:17,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:40:17,380 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 296 transitions. [2022-11-18 18:40:17,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2022-11-18 18:40:17,380 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 296 transitions. [2022-11-18 18:40:17,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-18 18:40:17,381 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:40:17,381 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:40:17,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 18:40:17,382 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:40:17,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:40:17,382 INFO L85 PathProgramCache]: Analyzing trace with hash 186914675, now seen corresponding path program 1 times [2022-11-18 18:40:17,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:40:17,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879704158] [2022-11-18 18:40:17,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:40:17,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:40:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:17,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 18:40:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:17,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 18:40:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:17,463 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 18:40:17,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:40:17,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879704158] [2022-11-18 18:40:17,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879704158] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:40:17,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:40:17,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 18:40:17,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474557884] [2022-11-18 18:40:17,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:40:17,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:40:17,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:40:17,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:40:17,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:40:17,466 INFO L87 Difference]: Start difference. First operand 183 states and 296 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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) [2022-11-18 18:40:17,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:40:17,635 INFO L93 Difference]: Finished difference Result 217 states and 348 transitions. [2022-11-18 18:40:17,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 18:40:17,636 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 23 [2022-11-18 18:40:17,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:40:17,638 INFO L225 Difference]: With dead ends: 217 [2022-11-18 18:40:17,638 INFO L226 Difference]: Without dead ends: 215 [2022-11-18 18:40:17,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-18 18:40:17,639 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 44 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:40:17,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 293 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:40:17,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-11-18 18:40:17,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 197. [2022-11-18 18:40:17,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 96 states have (on average 1.3854166666666667) internal successors, (133), 102 states have internal predecessors, (133), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2022-11-18 18:40:17,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 317 transitions. [2022-11-18 18:40:17,682 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 317 transitions. Word has length 23 [2022-11-18 18:40:17,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:40:17,682 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 317 transitions. [2022-11-18 18:40:17,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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) [2022-11-18 18:40:17,683 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 317 transitions. [2022-11-18 18:40:17,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-18 18:40:17,684 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:40:17,684 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:40:17,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 18:40:17,684 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:40:17,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:40:17,685 INFO L85 PathProgramCache]: Analyzing trace with hash 768784003, now seen corresponding path program 1 times [2022-11-18 18:40:17,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:40:17,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495334345] [2022-11-18 18:40:17,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:40:17,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:40:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:17,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 18:40:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:17,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 18:40:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:17,757 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 18:40:17,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:40:17,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495334345] [2022-11-18 18:40:17,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495334345] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:40:17,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:40:17,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 18:40:17,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517385764] [2022-11-18 18:40:17,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:40:17,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 18:40:17,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:40:17,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 18:40:17,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 18:40:17,760 INFO L87 Difference]: Start difference. First operand 197 states and 317 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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) [2022-11-18 18:40:18,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:40:18,114 INFO L93 Difference]: Finished difference Result 520 states and 854 transitions. [2022-11-18 18:40:18,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 18:40:18,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 25 [2022-11-18 18:40:18,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:40:18,118 INFO L225 Difference]: With dead ends: 520 [2022-11-18 18:40:18,118 INFO L226 Difference]: Without dead ends: 366 [2022-11-18 18:40:18,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:40:18,120 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 83 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:40:18,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 136 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 18:40:18,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-11-18 18:40:18,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 197. [2022-11-18 18:40:18,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 102 states have internal predecessors, (131), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2022-11-18 18:40:18,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 315 transitions. [2022-11-18 18:40:18,175 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 315 transitions. Word has length 25 [2022-11-18 18:40:18,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:40:18,175 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 315 transitions. [2022-11-18 18:40:18,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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) [2022-11-18 18:40:18,175 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 315 transitions. [2022-11-18 18:40:18,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-18 18:40:18,176 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:40:18,176 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:40:18,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 18:40:18,177 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:40:18,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:40:18,177 INFO L85 PathProgramCache]: Analyzing trace with hash -299150037, now seen corresponding path program 1 times [2022-11-18 18:40:18,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:40:18,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653563622] [2022-11-18 18:40:18,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:40:18,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:40:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:18,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 18:40:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:18,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 18:40:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:18,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:40:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:18,280 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 18:40:18,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:40:18,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653563622] [2022-11-18 18:40:18,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653563622] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:40:18,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:40:18,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 18:40:18,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862000053] [2022-11-18 18:40:18,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:40:18,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:40:18,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:40:18,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:40:18,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:40:18,282 INFO L87 Difference]: Start difference. First operand 197 states and 315 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2022-11-18 18:40:18,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:40:18,544 INFO L93 Difference]: Finished difference Result 291 states and 471 transitions. [2022-11-18 18:40:18,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 18:40:18,545 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 26 [2022-11-18 18:40:18,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:40:18,547 INFO L225 Difference]: With dead ends: 291 [2022-11-18 18:40:18,547 INFO L226 Difference]: Without dead ends: 289 [2022-11-18 18:40:18,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-18 18:40:18,549 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 26 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:40:18,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 183 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 18:40:18,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-11-18 18:40:18,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 269. [2022-11-18 18:40:18,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 118 states have (on average 1.3644067796610169) internal successors, (161), 132 states have internal predecessors, (161), 140 states have call successors, (140), 10 states have call predecessors, (140), 10 states have return successors, (140), 126 states have call predecessors, (140), 140 states have call successors, (140) [2022-11-18 18:40:18,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 441 transitions. [2022-11-18 18:40:18,633 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 441 transitions. Word has length 26 [2022-11-18 18:40:18,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:40:18,633 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 441 transitions. [2022-11-18 18:40:18,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2022-11-18 18:40:18,634 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 441 transitions. [2022-11-18 18:40:18,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-18 18:40:18,634 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:40:18,634 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:40:18,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 18:40:18,635 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:40:18,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:40:18,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1714235681, now seen corresponding path program 1 times [2022-11-18 18:40:18,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:40:18,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441179801] [2022-11-18 18:40:18,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:40:18,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:40:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:18,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 18:40:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:18,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 18:40:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:18,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 18:40:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:18,750 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 18:40:18,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:40:18,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441179801] [2022-11-18 18:40:18,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441179801] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:40:18,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:40:18,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:40:18,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049730499] [2022-11-18 18:40:18,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:40:18,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:40:18,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:40:18,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:40:18,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:40:18,760 INFO L87 Difference]: Start difference. First operand 269 states and 441 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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) [2022-11-18 18:40:19,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:40:19,051 INFO L93 Difference]: Finished difference Result 317 states and 516 transitions. [2022-11-18 18:40:19,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 18:40:19,052 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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 28 [2022-11-18 18:40:19,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:40:19,054 INFO L225 Difference]: With dead ends: 317 [2022-11-18 18:40:19,054 INFO L226 Difference]: Without dead ends: 315 [2022-11-18 18:40:19,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-18 18:40:19,055 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 72 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:40:19,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 197 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 18:40:19,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-11-18 18:40:19,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 287. [2022-11-18 18:40:19,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 125 states have (on average 1.36) internal successors, (170), 141 states have internal predecessors, (170), 150 states have call successors, (150), 11 states have call predecessors, (150), 11 states have return successors, (150), 134 states have call predecessors, (150), 150 states have call successors, (150) [2022-11-18 18:40:19,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 470 transitions. [2022-11-18 18:40:19,140 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 470 transitions. Word has length 28 [2022-11-18 18:40:19,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:40:19,140 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 470 transitions. [2022-11-18 18:40:19,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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) [2022-11-18 18:40:19,140 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 470 transitions. [2022-11-18 18:40:19,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-18 18:40:19,141 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:40:19,141 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:40:19,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 18:40:19,142 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:40:19,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:40:19,142 INFO L85 PathProgramCache]: Analyzing trace with hash 523331784, now seen corresponding path program 1 times [2022-11-18 18:40:19,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:40:19,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838333541] [2022-11-18 18:40:19,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:40:19,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:40:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:19,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 18:40:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:19,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 18:40:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:19,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:40:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:19,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-18 18:40:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:19,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 18:40:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:19,275 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-18 18:40:19,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:40:19,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838333541] [2022-11-18 18:40:19,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838333541] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:40:19,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:40:19,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:40:19,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511122499] [2022-11-18 18:40:19,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:40:19,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:40:19,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:40:19,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:40:19,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:40:19,278 INFO L87 Difference]: Start difference. First operand 287 states and 470 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:40:19,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:40:19,592 INFO L93 Difference]: Finished difference Result 329 states and 527 transitions. [2022-11-18 18:40:19,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 18:40:19,593 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2022-11-18 18:40:19,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:40:19,596 INFO L225 Difference]: With dead ends: 329 [2022-11-18 18:40:19,596 INFO L226 Difference]: Without dead ends: 327 [2022-11-18 18:40:19,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-18 18:40:19,597 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 38 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:40:19,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 194 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 18:40:19,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-11-18 18:40:19,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 291. [2022-11-18 18:40:19,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 128 states have (on average 1.3515625) internal successors, (173), 144 states have internal predecessors, (173), 150 states have call successors, (150), 12 states have call predecessors, (150), 12 states have return successors, (150), 134 states have call predecessors, (150), 150 states have call successors, (150) [2022-11-18 18:40:19,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 473 transitions. [2022-11-18 18:40:19,677 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 473 transitions. Word has length 38 [2022-11-18 18:40:19,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:40:19,677 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 473 transitions. [2022-11-18 18:40:19,678 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 18:40:19,678 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 473 transitions. [2022-11-18 18:40:19,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-18 18:40:19,679 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:40:19,679 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:40:19,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 18:40:19,679 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:40:19,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:40:19,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1856149802, now seen corresponding path program 1 times [2022-11-18 18:40:19,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:40:19,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391060237] [2022-11-18 18:40:19,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:40:19,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:40:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:19,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 18:40:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:19,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 18:40:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:19,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 18:40:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:19,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-18 18:40:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:19,787 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-18 18:40:19,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:40:19,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391060237] [2022-11-18 18:40:19,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391060237] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:40:19,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:40:19,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:40:19,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964095237] [2022-11-18 18:40:19,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:40:19,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:40:19,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:40:19,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:40:19,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:40:19,790 INFO L87 Difference]: Start difference. First operand 291 states and 473 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-18 18:40:19,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:40:19,998 INFO L93 Difference]: Finished difference Result 297 states and 478 transitions. [2022-11-18 18:40:19,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 18:40:19,998 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2022-11-18 18:40:19,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:40:20,001 INFO L225 Difference]: With dead ends: 297 [2022-11-18 18:40:20,001 INFO L226 Difference]: Without dead ends: 295 [2022-11-18 18:40:20,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-18 18:40:20,003 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 32 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:40:20,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 103 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:40:20,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-11-18 18:40:20,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2022-11-18 18:40:20,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 131 states have (on average 1.3435114503816794) internal successors, (176), 147 states have internal predecessors, (176), 150 states have call successors, (150), 13 states have call predecessors, (150), 13 states have return successors, (150), 134 states have call predecessors, (150), 150 states have call successors, (150) [2022-11-18 18:40:20,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 476 transitions. [2022-11-18 18:40:20,082 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 476 transitions. Word has length 38 [2022-11-18 18:40:20,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:40:20,083 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 476 transitions. [2022-11-18 18:40:20,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-18 18:40:20,083 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 476 transitions. [2022-11-18 18:40:20,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-18 18:40:20,084 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:40:20,084 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:40:20,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 18:40:20,085 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:40:20,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:40:20,085 INFO L85 PathProgramCache]: Analyzing trace with hash 2019762676, now seen corresponding path program 1 times [2022-11-18 18:40:20,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:40:20,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163654364] [2022-11-18 18:40:20,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:40:20,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:40:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:20,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 18:40:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:20,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 18:40:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:20,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 18:40:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:20,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-18 18:40:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:20,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 18:40:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:20,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-18 18:40:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:20,213 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-18 18:40:20,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:40:20,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163654364] [2022-11-18 18:40:20,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163654364] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:40:20,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:40:20,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:40:20,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493120768] [2022-11-18 18:40:20,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:40:20,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:40:20,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:40:20,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:40:20,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:40:20,216 INFO L87 Difference]: Start difference. First operand 295 states and 476 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-18 18:40:20,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:40:20,475 INFO L93 Difference]: Finished difference Result 329 states and 525 transitions. [2022-11-18 18:40:20,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 18:40:20,476 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 50 [2022-11-18 18:40:20,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:40:20,478 INFO L225 Difference]: With dead ends: 329 [2022-11-18 18:40:20,479 INFO L226 Difference]: Without dead ends: 327 [2022-11-18 18:40:20,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-18 18:40:20,480 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 43 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 18:40:20,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 226 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 18:40:20,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-11-18 18:40:20,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 174. [2022-11-18 18:40:20,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 93 states have internal predecessors, (108), 76 states have call successors, (76), 12 states have call predecessors, (76), 12 states have return successors, (76), 68 states have call predecessors, (76), 76 states have call successors, (76) [2022-11-18 18:40:20,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 260 transitions. [2022-11-18 18:40:20,528 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 260 transitions. Word has length 50 [2022-11-18 18:40:20,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:40:20,528 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 260 transitions. [2022-11-18 18:40:20,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-18 18:40:20,529 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 260 transitions. [2022-11-18 18:40:20,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-18 18:40:20,530 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:40:20,530 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:40:20,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 18:40:20,530 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:40:20,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:40:20,531 INFO L85 PathProgramCache]: Analyzing trace with hash -2077570128, now seen corresponding path program 1 times [2022-11-18 18:40:20,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:40:20,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595448474] [2022-11-18 18:40:20,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:40:20,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:40:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:20,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 18:40:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:20,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 18:40:20,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:20,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 18:40:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:20,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-18 18:40:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:20,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 18:40:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:20,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 18:40:20,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:20,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 18:40:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:20,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-18 18:40:20,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:20,609 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-18 18:40:20,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:40:20,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595448474] [2022-11-18 18:40:20,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595448474] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:40:20,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393394796] [2022-11-18 18:40:20,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:40:20,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:40:20,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:40:20,614 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:40:20,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 18:40:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:20,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 18:40:20,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:40:20,865 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-11-18 18:40:20,866 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 18:40:20,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393394796] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:40:20,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 18:40:20,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2022-11-18 18:40:20,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6703729] [2022-11-18 18:40:20,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:40:20,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:40:20,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:40:20,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:40:20,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-18 18:40:20,868 INFO L87 Difference]: Start difference. First operand 174 states and 260 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-18 18:40:21,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:40:21,220 INFO L93 Difference]: Finished difference Result 505 states and 801 transitions. [2022-11-18 18:40:21,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 18:40:21,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 58 [2022-11-18 18:40:21,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:40:21,223 INFO L225 Difference]: With dead ends: 505 [2022-11-18 18:40:21,223 INFO L226 Difference]: Without dead ends: 335 [2022-11-18 18:40:21,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-11-18 18:40:21,225 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 48 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 18:40:21,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 168 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 18:40:21,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-11-18 18:40:21,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 311. [2022-11-18 18:40:21,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 152 states have internal predecessors, (183), 162 states have call successors, (162), 12 states have call predecessors, (162), 12 states have return successors, (162), 146 states have call predecessors, (162), 162 states have call successors, (162) [2022-11-18 18:40:21,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 507 transitions. [2022-11-18 18:40:21,346 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 507 transitions. Word has length 58 [2022-11-18 18:40:21,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:40:21,346 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 507 transitions. [2022-11-18 18:40:21,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-18 18:40:21,347 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 507 transitions. [2022-11-18 18:40:21,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-18 18:40:21,348 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:40:21,348 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:40:21,364 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 18:40:21,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-18 18:40:21,549 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:40:21,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:40:21,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1244619342, now seen corresponding path program 1 times [2022-11-18 18:40:21,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:40:21,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521318264] [2022-11-18 18:40:21,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:40:21,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:40:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:21,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 18:40:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:21,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 18:40:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:21,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:40:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:21,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-18 18:40:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:21,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 18:40:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:21,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 18:40:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:21,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-18 18:40:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:21,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 18:40:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:21,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 18:40:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:21,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 18:40:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:21,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 18:40:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:21,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 18:40:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:21,721 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-11-18 18:40:21,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:40:21,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521318264] [2022-11-18 18:40:21,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521318264] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:40:21,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326379830] [2022-11-18 18:40:21,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:40:21,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:40:21,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:40:21,723 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:40:21,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 18:40:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:21,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-18 18:40:21,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:40:21,948 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-11-18 18:40:21,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:40:22,098 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-11-18 18:40:22,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326379830] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:40:22,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:40:22,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 16 [2022-11-18 18:40:22,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359570164] [2022-11-18 18:40:22,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:40:22,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-18 18:40:22,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:40:22,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-18 18:40:22,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-11-18 18:40:22,104 INFO L87 Difference]: Start difference. First operand 311 states and 507 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 14 states have internal predecessors, (48), 7 states have call successors, (36), 3 states have call predecessors, (36), 1 states have return successors, (34), 7 states have call predecessors, (34), 7 states have call successors, (34) [2022-11-18 18:40:24,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:40:24,337 INFO L93 Difference]: Finished difference Result 671 states and 1116 transitions. [2022-11-18 18:40:24,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-18 18:40:24,338 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 14 states have internal predecessors, (48), 7 states have call successors, (36), 3 states have call predecessors, (36), 1 states have return successors, (34), 7 states have call predecessors, (34), 7 states have call successors, (34) Word has length 80 [2022-11-18 18:40:24,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:40:24,343 INFO L225 Difference]: With dead ends: 671 [2022-11-18 18:40:24,343 INFO L226 Difference]: Without dead ends: 669 [2022-11-18 18:40:24,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=370, Invalid=1112, Unknown=0, NotChecked=0, Total=1482 [2022-11-18 18:40:24,345 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 296 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 734 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 2089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 734 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-18 18:40:24,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 624 Invalid, 2089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [734 Valid, 1355 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-18 18:40:24,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-11-18 18:40:24,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 367. [2022-11-18 18:40:24,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 163 states have (on average 1.3496932515337423) internal successors, (220), 181 states have internal predecessors, (220), 188 states have call successors, (188), 15 states have call predecessors, (188), 15 states have return successors, (188), 170 states have call predecessors, (188), 188 states have call successors, (188) [2022-11-18 18:40:24,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 596 transitions. [2022-11-18 18:40:24,550 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 596 transitions. Word has length 80 [2022-11-18 18:40:24,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:40:24,551 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 596 transitions. [2022-11-18 18:40:24,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 14 states have internal predecessors, (48), 7 states have call successors, (36), 3 states have call predecessors, (36), 1 states have return successors, (34), 7 states have call predecessors, (34), 7 states have call successors, (34) [2022-11-18 18:40:24,552 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 596 transitions. [2022-11-18 18:40:24,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-18 18:40:24,555 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:40:24,555 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:40:24,568 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-18 18:40:24,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-18 18:40:24,762 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:40:24,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:40:24,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1679445438, now seen corresponding path program 2 times [2022-11-18 18:40:24,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:40:24,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879702807] [2022-11-18 18:40:24,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:40:24,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:40:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:25,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 18:40:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:25,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 18:40:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:25,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 18:40:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:25,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-18 18:40:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:25,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 18:40:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:25,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 18:40:25,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:25,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-18 18:40:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:25,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 18:40:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:25,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 18:40:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:25,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 18:40:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:25,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-18 18:40:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:25,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 18:40:25,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:25,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-18 18:40:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:25,116 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-11-18 18:40:25,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:40:25,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879702807] [2022-11-18 18:40:25,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879702807] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:40:25,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481443374] [2022-11-18 18:40:25,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 18:40:25,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:40:25,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:40:25,118 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:40:25,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 18:40:25,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 18:40:25,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 18:40:25,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-18 18:40:25,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:40:25,509 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-11-18 18:40:25,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:40:25,696 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-11-18 18:40:25,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481443374] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:40:25,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:40:25,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-11-18 18:40:25,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371876283] [2022-11-18 18:40:25,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:40:25,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-18 18:40:25,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:40:25,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-18 18:40:25,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-11-18 18:40:25,699 INFO L87 Difference]: Start difference. First operand 367 states and 596 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 16 states have internal predecessors, (52), 6 states have call successors, (42), 3 states have call predecessors, (42), 1 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) [2022-11-18 18:40:26,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:40:26,356 INFO L93 Difference]: Finished difference Result 399 states and 639 transitions. [2022-11-18 18:40:26,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 18:40:26,357 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 16 states have internal predecessors, (52), 6 states have call successors, (42), 3 states have call predecessors, (42), 1 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) Word has length 85 [2022-11-18 18:40:26,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:40:26,359 INFO L225 Difference]: With dead ends: 399 [2022-11-18 18:40:26,360 INFO L226 Difference]: Without dead ends: 317 [2022-11-18 18:40:26,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=533, Unknown=0, NotChecked=0, Total=702 [2022-11-18 18:40:26,362 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 107 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 18:40:26,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 148 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 18:40:26,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-11-18 18:40:26,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 301. [2022-11-18 18:40:26,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 140 states have (on average 1.3142857142857143) internal successors, (184), 154 states have internal predecessors, (184), 144 states have call successors, (144), 16 states have call predecessors, (144), 16 states have return successors, (144), 130 states have call predecessors, (144), 144 states have call successors, (144) [2022-11-18 18:40:26,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 472 transitions. [2022-11-18 18:40:26,477 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 472 transitions. Word has length 85 [2022-11-18 18:40:26,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:40:26,478 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 472 transitions. [2022-11-18 18:40:26,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 16 states have internal predecessors, (52), 6 states have call successors, (42), 3 states have call predecessors, (42), 1 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) [2022-11-18 18:40:26,478 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 472 transitions. [2022-11-18 18:40:26,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-11-18 18:40:26,486 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 18:40:26,487 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:40:26,497 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 18:40:26,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-18 18:40:26,692 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 18:40:26,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:40:26,693 INFO L85 PathProgramCache]: Analyzing trace with hash 520521549, now seen corresponding path program 1 times [2022-11-18 18:40:26,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:40:26,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134041193] [2022-11-18 18:40:26,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:40:26,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:40:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:26,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 18:40:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:26,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 18:40:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:26,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-18 18:40:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:26,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-18 18:40:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:26,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-18 18:40:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:26,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-18 18:40:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:26,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-18 18:40:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:26,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-18 18:40:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:26,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 18:40:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:26,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-18 18:40:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:26,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 18:40:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:26,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-18 18:40:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:26,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-18 18:40:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:26,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 18:40:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:26,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-18 18:40:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:26,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-18 18:40:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:26,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-18 18:40:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:26,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-18 18:40:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:26,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-18 18:40:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:26,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-18 18:40:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:26,983 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 53 proven. 13 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2022-11-18 18:40:26,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:40:26,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134041193] [2022-11-18 18:40:26,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134041193] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 18:40:26,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988164226] [2022-11-18 18:40:26,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:40:26,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:40:26,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:40:26,987 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 18:40:26,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 18:40:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:40:27,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 18:40:27,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 18:40:27,395 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 382 proven. 8 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2022-11-18 18:40:27,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 18:40:27,690 INFO L134 CoverageAnalysis]: Checked inductivity of 826 backedges. 56 proven. 10 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2022-11-18 18:40:27,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988164226] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 18:40:27,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 18:40:27,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-11-18 18:40:27,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8774792] [2022-11-18 18:40:27,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 18:40:27,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-18 18:40:27,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:40:27,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-18 18:40:27,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2022-11-18 18:40:27,694 INFO L87 Difference]: Start difference. First operand 301 states and 472 transitions. Second operand has 20 states, 20 states have (on average 3.65) internal successors, (73), 19 states have internal predecessors, (73), 11 states have call successors, (62), 3 states have call predecessors, (62), 2 states have return successors, (60), 11 states have call predecessors, (60), 11 states have call successors, (60) [2022-11-18 18:40:32,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 18:40:32,410 INFO L93 Difference]: Finished difference Result 894 states and 1429 transitions. [2022-11-18 18:40:32,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-18 18:40:32,411 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.65) internal successors, (73), 19 states have internal predecessors, (73), 11 states have call successors, (62), 3 states have call predecessors, (62), 2 states have return successors, (60), 11 states have call predecessors, (60), 11 states have call successors, (60) Word has length 129 [2022-11-18 18:40:32,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 18:40:32,411 INFO L225 Difference]: With dead ends: 894 [2022-11-18 18:40:32,411 INFO L226 Difference]: Without dead ends: 0 [2022-11-18 18:40:32,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1729 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1180, Invalid=4370, Unknown=0, NotChecked=0, Total=5550 [2022-11-18 18:40:32,416 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 363 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 2837 mSolverCounterSat, 1001 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 3838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1001 IncrementalHoareTripleChecker+Valid, 2837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-18 18:40:32,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 845 Invalid, 3838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1001 Valid, 2837 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-18 18:40:32,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-18 18:40:32,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-18 18:40:32,417 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) [2022-11-18 18:40:32,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-18 18:40:32,418 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 129 [2022-11-18 18:40:32,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 18:40:32,418 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-18 18:40:32,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.65) internal successors, (73), 19 states have internal predecessors, (73), 11 states have call successors, (62), 3 states have call predecessors, (62), 2 states have return successors, (60), 11 states have call predecessors, (60), 11 states have call successors, (60) [2022-11-18 18:40:32,419 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-18 18:40:32,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-18 18:40:32,421 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-18 18:40:32,427 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-18 18:40:32,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 18:40:32,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-18 18:41:10,099 WARN L233 SmtUtils]: Spent 34.59s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-18 18:41:42,205 WARN L233 SmtUtils]: Spent 32.11s on a formula simplification that was a NOOP. DAG size: 137 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-18 18:42:16,868 WARN L233 SmtUtils]: Spent 33.57s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-18 18:42:49,311 WARN L233 SmtUtils]: Spent 32.40s on a formula simplification that was a NOOP. DAG size: 137 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-18 18:47:44,258 WARN L233 SmtUtils]: Spent 4.92m on a formula simplification. DAG size of input: 217 DAG size of output: 213 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-18 18:47:56,540 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~l~0#1| 1) (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~r~0#1|) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= 1 |ULTIMATE.start_main_~l~0#1|)) [2022-11-18 18:47:56,540 INFO L895 garLoopResultBuilder]: At program point L64-1(line 64) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~l~0#1| 1) (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~r~0#1|) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= 1 |ULTIMATE.start_main_~l~0#1|)) [2022-11-18 18:47:56,540 INFO L895 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (and (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~l~0#1|) (<= (* 2 |ULTIMATE.start_main_~l~0#1|) |ULTIMATE.start_main_~r~0#1|) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 2 |ULTIMATE.start_main_~j~0#1|)) [2022-11-18 18:47:56,541 INFO L899 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2022-11-18 18:47:56,541 INFO L895 garLoopResultBuilder]: At program point L60-1(line 60) the Hoare annotation is: (and (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= 2 |ULTIMATE.start_main_~l~0#1|) (<= (* 2 |ULTIMATE.start_main_~l~0#1|) |ULTIMATE.start_main_~r~0#1|) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 2 |ULTIMATE.start_main_~j~0#1|)) [2022-11-18 18:47:56,541 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= (* 2 |ULTIMATE.start_main_~l~0#1|) |ULTIMATE.start_main_~r~0#1|) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 1 |ULTIMATE.start_main_~l~0#1|)) [2022-11-18 18:47:56,541 INFO L895 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= (* 2 |ULTIMATE.start_main_~l~0#1|) |ULTIMATE.start_main_~r~0#1|) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 1 |ULTIMATE.start_main_~l~0#1|)) [2022-11-18 18:47:56,541 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-11-18 18:47:56,542 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 45) no Hoare annotation was computed. [2022-11-18 18:47:56,542 INFO L895 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: (let ((.cse4 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse0 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse1 (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|)) (.cse2 (<= .cse4 |ULTIMATE.start_main_~r~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse5 (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse7 (<= 1 |ULTIMATE.start_main_~l~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_main_~j~0#1| .cse4) .cse5) (and (<= |ULTIMATE.start_main_~l~0#1| 1) .cse0 .cse1 .cse3 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse5 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse6 .cse7)))) [2022-11-18 18:47:56,542 INFO L895 garLoopResultBuilder]: At program point L40-1(line 40) the Hoare annotation is: (let ((.cse4 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse0 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse1 (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|)) (.cse2 (<= .cse4 |ULTIMATE.start_main_~r~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse5 (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse7 (<= 1 |ULTIMATE.start_main_~l~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_main_~j~0#1| .cse4) .cse5) (and (<= |ULTIMATE.start_main_~l~0#1| 1) .cse0 .cse1 .cse3 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse5 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse6 .cse7)))) [2022-11-18 18:47:56,542 INFO L902 garLoopResultBuilder]: At program point L69(lines 24 70) the Hoare annotation is: true [2022-11-18 18:47:56,542 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2022-11-18 18:47:56,542 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-18 18:47:56,543 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-18 18:47:56,543 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2022-11-18 18:47:56,543 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-18 18:47:56,543 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (and (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= (* 2 |ULTIMATE.start_main_~l~0#1|) |ULTIMATE.start_main_~r~0#1|) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 1 |ULTIMATE.start_main_~l~0#1|)) [2022-11-18 18:47:56,543 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 51) no Hoare annotation was computed. [2022-11-18 18:47:56,543 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (let ((.cse4 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse0 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse1 (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|)) (.cse2 (<= .cse4 |ULTIMATE.start_main_~r~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse5 (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse7 (<= 1 |ULTIMATE.start_main_~l~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_main_~j~0#1| .cse4) .cse5) (and (<= |ULTIMATE.start_main_~l~0#1| 1) .cse0 .cse1 .cse3 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse5 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse6 .cse7)))) [2022-11-18 18:47:56,544 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-18 18:47:56,544 INFO L895 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (and (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= (* 2 |ULTIMATE.start_main_~l~0#1|) |ULTIMATE.start_main_~r~0#1|) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 2 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 1 |ULTIMATE.start_main_~l~0#1|)) [2022-11-18 18:47:56,544 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (let ((.cse4 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse0 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse1 (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|)) (.cse2 (<= .cse4 |ULTIMATE.start_main_~r~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse5 (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse7 (<= 1 |ULTIMATE.start_main_~l~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_main_~j~0#1| .cse4) .cse5) (and (<= |ULTIMATE.start_main_~l~0#1| 1) .cse0 .cse1 .cse3 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse5 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse6 .cse7)))) [2022-11-18 18:47:56,544 INFO L895 garLoopResultBuilder]: At program point L38-2(lines 38 58) the Hoare annotation is: (let ((.cse7 (* 2 |ULTIMATE.start_main_~i~0#1|)) (.cse4 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse2 (<= .cse4 |ULTIMATE.start_main_~r~0#1|)) (.cse0 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse1 (<= .cse7 |ULTIMATE.start_main_~j~0#1|)) (.cse5 (<= (+ 2 |ULTIMATE.start_main_~j~0#1|) (+ |ULTIMATE.start_main_~r~0#1| .cse7))) (.cse3 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse6 (<= 1 |ULTIMATE.start_main_~l~0#1|))) (or (and .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_main_~j~0#1| .cse4)) (and .cse1 .cse5 .cse2 .cse3 (<= 2 |ULTIMATE.start_main_~i~0#1|) .cse6) (and (<= |ULTIMATE.start_main_~l~0#1| 1) .cse0 .cse1 .cse5 .cse3 .cse6)))) [2022-11-18 18:47:56,544 INFO L899 garLoopResultBuilder]: For program point L38-3(lines 35 68) no Hoare annotation was computed. [2022-11-18 18:47:56,545 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 34) no Hoare annotation was computed. [2022-11-18 18:47:56,545 INFO L895 garLoopResultBuilder]: At program point L59-1(lines 24 70) the Hoare annotation is: (let ((.cse1 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse0 (<= |ULTIMATE.start_main_~l~0#1| 1)) (.cse6 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse3 (* 2 |ULTIMATE.start_main_~i~0#1|)) (.cse4 (<= .cse1 |ULTIMATE.start_main_~r~0#1|)) (.cse5 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse7 (<= .cse1 |ULTIMATE.start_main_~n~0#1|)) (.cse2 (<= 1 |ULTIMATE.start_main_~l~0#1|))) (or (and .cse0 (<= (+ 2 |ULTIMATE.start_main_~r~0#1|) .cse1) (<= .cse1 (+ 2 |ULTIMATE.start_main_~n~0#1|)) .cse2) (and (<= .cse3 |ULTIMATE.start_main_~j~0#1|) .cse4 .cse5 .cse6 .cse7 .cse2) (and .cse0 .cse5 .cse6 (<= (+ 2 |ULTIMATE.start_main_~r~0#1| .cse3) (+ (* 2 |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~j~0#1|)) .cse7 .cse2) (and (<= |ULTIMATE.start_main_~r~0#1| (+ 2 .cse1)) .cse4 .cse5 .cse7 .cse2)))) [2022-11-18 18:47:56,545 INFO L899 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2022-11-18 18:47:56,545 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= (* 2 |ULTIMATE.start_main_~l~0#1|) |ULTIMATE.start_main_~r~0#1|) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 1 |ULTIMATE.start_main_~l~0#1|)) [2022-11-18 18:47:56,545 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2022-11-18 18:47:56,545 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 46) no Hoare annotation was computed. [2022-11-18 18:47:56,546 INFO L895 garLoopResultBuilder]: At program point L39-1(lines 39 46) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= (* 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~j~0#1|) (<= (* 2 |ULTIMATE.start_main_~l~0#1|) |ULTIMATE.start_main_~r~0#1|) (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|) (<= 1 |ULTIMATE.start_main_~l~0#1|)) [2022-11-18 18:47:56,546 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 35 68) no Hoare annotation was computed. [2022-11-18 18:47:56,546 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-11-18 18:47:56,546 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-11-18 18:47:56,546 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-11-18 18:47:56,546 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-11-18 18:47:56,547 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-11-18 18:47:56,547 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-11-18 18:47:56,550 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:47:56,552 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 18:47:56,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 06:47:56 BoogieIcfgContainer [2022-11-18 18:47:56,570 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 18:47:56,571 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 18:47:56,571 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 18:47:56,572 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 18:47:56,572 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:40:14" (3/4) ... [2022-11-18 18:47:56,576 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-18 18:47:56,584 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-11-18 18:47:56,588 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-11-18 18:47:56,589 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-18 18:47:56,589 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-18 18:47:56,589 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-18 18:47:56,590 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-18 18:47:56,640 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 18:47:56,640 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 18:47:56,641 INFO L158 Benchmark]: Toolchain (without parser) took 463225.65ms. Allocated memory was 107.0MB in the beginning and 465.6MB in the end (delta: 358.6MB). Free memory was 72.0MB in the beginning and 178.3MB in the end (delta: -106.3MB). Peak memory consumption was 252.7MB. Max. memory is 16.1GB. [2022-11-18 18:47:56,641 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 107.0MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 18:47:56,643 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.84ms. Allocated memory is still 107.0MB. Free memory was 71.8MB in the beginning and 82.6MB in the end (delta: -10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-18 18:47:56,644 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.28ms. Allocated memory is still 107.0MB. Free memory was 82.6MB in the beginning and 80.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 18:47:56,644 INFO L158 Benchmark]: Boogie Preprocessor took 36.13ms. Allocated memory is still 107.0MB. Free memory was 80.9MB in the beginning and 79.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 18:47:56,645 INFO L158 Benchmark]: RCFGBuilder took 424.92ms. Allocated memory is still 107.0MB. Free memory was 79.7MB in the beginning and 68.0MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 18:47:56,646 INFO L158 Benchmark]: TraceAbstraction took 462351.70ms. Allocated memory was 107.0MB in the beginning and 465.6MB in the end (delta: 358.6MB). Free memory was 67.5MB in the beginning and 181.5MB in the end (delta: -114.0MB). Peak memory consumption was 270.2MB. Max. memory is 16.1GB. [2022-11-18 18:47:56,646 INFO L158 Benchmark]: Witness Printer took 69.37ms. Allocated memory is still 465.6MB. Free memory was 181.5MB in the beginning and 178.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 18:47:56,648 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 107.0MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.84ms. Allocated memory is still 107.0MB. Free memory was 71.8MB in the beginning and 82.6MB in the end (delta: -10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.28ms. Allocated memory is still 107.0MB. Free memory was 82.6MB in the beginning and 80.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.13ms. Allocated memory is still 107.0MB. Free memory was 80.9MB in the beginning and 79.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 424.92ms. Allocated memory is still 107.0MB. Free memory was 79.7MB in the beginning and 68.0MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 462351.70ms. Allocated memory was 107.0MB in the beginning and 465.6MB in the end (delta: 358.6MB). Free memory was 67.5MB in the beginning and 181.5MB in the end (delta: -114.0MB). Peak memory consumption was 270.2MB. Max. memory is 16.1GB. * Witness Printer took 69.37ms. Allocated memory is still 465.6MB. Free memory was 181.5MB in the beginning and 178.3MB in the end (delta: 3.1MB). 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]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 462.2s, OverallIterations: 19, TraceHistogramMax: 21, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 443.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1532 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1363 mSDsluCounter, 4521 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3159 mSDsCounter, 2413 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6233 IncrementalHoareTripleChecker+Invalid, 8646 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2413 mSolverCounterUnsat, 1362 mSDtfsCounter, 6233 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1063 GetRequests, 832 SyntacticMatches, 0 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2194 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=367occurred in iteration=17, InterpolantAutomatonStates: 215, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 813 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 684 PreInvPairs, 1094 NumberOfFragments, 730 HoareAnnotationTreeSize, 684 FomulaSimplifications, 2804560 FormulaSimplificationTreeSizeReduction, 434.3s HoareSimplificationTime, 18 FomulaSimplificationsInter, 44867391 FormulaSimplificationTreeSizeReductionInter, 9.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1045 NumberOfCodeBlocks, 1045 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1313 ConstructedInterpolants, 0 QuantifiedInterpolants, 3094 SizeOfPredicates, 15 NumberOfNonLiveVariables, 805 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 26 InterpolantComputations, 16 PerfectInterpolantSequences, 4823/4899 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: (((((l <= 1 && 2 + r <= 2 * l) && 2 * l <= 2 + n) && 1 <= l) || (((((2 * i <= j && 2 * l <= r) && r <= n) && 2 <= j) && 2 * l <= n) && 1 <= l)) || (((((l <= 1 && r <= n) && 2 <= j) && 2 + r + 2 * i <= 2 * n + j) && 2 * l <= n) && 1 <= l)) || ((((r <= 2 + 2 * l && 2 * l <= r) && r <= n) && 2 * l <= n) && 1 <= l) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((((1 <= i && 2 * i <= j) && 2 * l <= r) && r <= n) && j <= 2 * l) || (((((2 * i <= j && 2 + j <= r + 2 * i) && 2 * l <= r) && r <= n) && 2 <= i) && 1 <= l)) || (((((l <= 1 && 1 <= i) && 2 * i <= j) && 2 + j <= r + 2 * i) && r <= n) && 1 <= l) RESULT: Ultimate proved your program to be correct! [2022-11-18 18:47:56,675 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02834a6c-d3d6-442d-8587-aadb10d3ff90/bin/uautomizer-TMbwUNV5ro/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