./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/dll-optional-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935a36aa-576d-479e-be8b-9e9e332af8fa/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935a36aa-576d-479e-be8b-9e9e332af8fa/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935a36aa-576d-479e-be8b-9e9e332af8fa/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935a36aa-576d-479e-be8b-9e9e332af8fa/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-optional-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935a36aa-576d-479e-be8b-9e9e332af8fa/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935a36aa-576d-479e-be8b-9e9e332af8fa/bin/uautomizer-ZsLfNo2U6R --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 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 --- 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-38b53e6 [2022-11-25 17:02:27,669 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:02:27,675 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:02:27,698 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:02:27,702 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:02:27,706 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:02:27,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:02:27,715 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:02:27,717 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:02:27,723 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:02:27,725 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:02:27,728 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:02:27,728 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:02:27,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:02:27,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:02:27,736 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:02:27,739 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:02:27,740 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:02:27,742 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:02:27,749 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:02:27,750 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:02:27,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:02:27,754 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:02:27,755 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:02:27,765 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:02:27,766 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:02:27,766 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:02:27,769 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:02:27,770 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:02:27,771 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:02:27,772 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:02:27,773 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:02:27,775 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:02:27,777 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:02:27,779 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:02:27,780 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:02:27,780 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:02:27,781 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:02:27,781 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:02:27,782 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:02:27,783 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:02:27,784 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935a36aa-576d-479e-be8b-9e9e332af8fa/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 17:02:27,826 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:02:27,826 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:02:27,827 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:02:27,827 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:02:27,828 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:02:27,828 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:02:27,829 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:02:27,829 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:02:27,830 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:02:27,830 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:02:27,831 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:02:27,831 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:02:27,831 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:02:27,832 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:02:27,832 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:02:27,832 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:02:27,832 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:02:27,833 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:02:27,833 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:02:27,833 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:02:27,833 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:02:27,834 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:02:27,834 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:02:27,834 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:02:27,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:02:27,835 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:02:27,835 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:02:27,835 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:02:27,835 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:02:27,836 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:02:27,836 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:02:27,836 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:02:27,836 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:02:27,837 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:02:27,837 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935a36aa-576d-479e-be8b-9e9e332af8fa/bin/uautomizer-ZsLfNo2U6R/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_935a36aa-576d-479e-be8b-9e9e332af8fa/bin/uautomizer-ZsLfNo2U6R 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 -> 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 [2022-11-25 17:02:28,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:02:28,185 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:02:28,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:02:28,189 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:02:28,190 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:02:28,191 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935a36aa-576d-479e-be8b-9e9e332af8fa/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/forester-heap/dll-optional-1.i [2022-11-25 17:02:31,284 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:02:31,628 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:02:31,628 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935a36aa-576d-479e-be8b-9e9e332af8fa/sv-benchmarks/c/forester-heap/dll-optional-1.i [2022-11-25 17:02:31,644 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935a36aa-576d-479e-be8b-9e9e332af8fa/bin/uautomizer-ZsLfNo2U6R/data/8f7663ccd/7fc69309ecc9497d94c2321c62a443cb/FLAG7f43730a6 [2022-11-25 17:02:31,664 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935a36aa-576d-479e-be8b-9e9e332af8fa/bin/uautomizer-ZsLfNo2U6R/data/8f7663ccd/7fc69309ecc9497d94c2321c62a443cb [2022-11-25 17:02:31,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:02:31,671 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:02:31,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:02:31,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:02:31,686 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:02:31,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:02:31" (1/1) ... [2022-11-25 17:02:31,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64778b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:02:31, skipping insertion in model container [2022-11-25 17:02:31,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:02:31" (1/1) ... [2022-11-25 17:02:31,698 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:02:31,764 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:02:32,110 WARN L237 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_935a36aa-576d-479e-be8b-9e9e332af8fa/sv-benchmarks/c/forester-heap/dll-optional-1.i[22753,22766] [2022-11-25 17:02:32,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:02:32,146 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:02:32,194 WARN L237 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_935a36aa-576d-479e-be8b-9e9e332af8fa/sv-benchmarks/c/forester-heap/dll-optional-1.i[22753,22766] [2022-11-25 17:02:32,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:02:32,245 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:02:32,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:02:32 WrapperNode [2022-11-25 17:02:32,246 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:02:32,248 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:02:32,248 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:02:32,248 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:02:32,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:02:32" (1/1) ... [2022-11-25 17:02:32,288 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:02:32" (1/1) ... [2022-11-25 17:02:32,315 INFO L138 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 134 [2022-11-25 17:02:32,320 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:02:32,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:02:32,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:02:32,321 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:02:32,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:02:32" (1/1) ... [2022-11-25 17:02:32,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:02:32" (1/1) ... [2022-11-25 17:02:32,334 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:02:32" (1/1) ... [2022-11-25 17:02:32,335 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:02:32" (1/1) ... [2022-11-25 17:02:32,343 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:02:32" (1/1) ... [2022-11-25 17:02:32,354 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:02:32" (1/1) ... [2022-11-25 17:02:32,356 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:02:32" (1/1) ... [2022-11-25 17:02:32,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:02:32" (1/1) ... [2022-11-25 17:02:32,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:02:32,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:02:32,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:02:32,362 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:02:32,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:02:32" (1/1) ... [2022-11-25 17:02:32,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:02:32,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935a36aa-576d-479e-be8b-9e9e332af8fa/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:02:32,404 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935a36aa-576d-479e-be8b-9e9e332af8fa/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:02:32,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935a36aa-576d-479e-be8b-9e9e332af8fa/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:02:32,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 17:02:32,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:02:32,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 17:02:32,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:02:32,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 17:02:32,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 17:02:32,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:02:32,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:02:32,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:02:32,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:02:32,589 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:02:32,591 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:02:32,926 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:02:32,933 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:02:32,947 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-25 17:02:32,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:02:32 BoogieIcfgContainer [2022-11-25 17:02:32,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:02:32,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:02:32,953 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:02:32,956 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:02:32,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:02:31" (1/3) ... [2022-11-25 17:02:32,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74db0a0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:02:32, skipping insertion in model container [2022-11-25 17:02:32,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:02:32" (2/3) ... [2022-11-25 17:02:32,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74db0a0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:02:32, skipping insertion in model container [2022-11-25 17:02:32,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:02:32" (3/3) ... [2022-11-25 17:02:32,965 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-optional-1.i [2022-11-25 17:02:32,988 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:02:32,990 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 17:02:33,069 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:02:33,079 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;@67671327, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:02:33,080 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 17:02:33,086 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 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-25 17:02:33,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 17:02:33,095 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:02:33,096 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:02:33,097 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:02:33,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:02:33,106 INFO L85 PathProgramCache]: Analyzing trace with hash 573386926, now seen corresponding path program 1 times [2022-11-25 17:02:33,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:02:33,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619399330] [2022-11-25 17:02:33,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:02:33,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:02:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:02:33,418 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-25 17:02:33,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:02:33,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619399330] [2022-11-25 17:02:33,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619399330] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:02:33,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:02:33,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:02:33,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885953684] [2022-11-25 17:02:33,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:02:33,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:02:33,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:02:33,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:02:33,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:02:33,491 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 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) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-25 17:02:33,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:02:33,542 INFO L93 Difference]: Finished difference Result 51 states and 77 transitions. [2022-11-25 17:02:33,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:02:33,546 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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) Word has length 15 [2022-11-25 17:02:33,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:02:33,556 INFO L225 Difference]: With dead ends: 51 [2022-11-25 17:02:33,557 INFO L226 Difference]: Without dead ends: 22 [2022-11-25 17:02:33,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:02:33,566 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:02:33,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:02:33,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-25 17:02:33,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-11-25 17:02:33,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 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-25 17:02:33,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2022-11-25 17:02:33,620 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 15 [2022-11-25 17:02:33,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:02:33,621 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-11-25 17:02:33,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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-25 17:02:33,622 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2022-11-25 17:02:33,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 17:02:33,622 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:02:33,623 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:02:33,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:02:33,623 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:02:33,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:02:33,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1170055612, now seen corresponding path program 1 times [2022-11-25 17:02:33,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:02:33,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004435336] [2022-11-25 17:02:33,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:02:33,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:02:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:02:33,886 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-25 17:02:33,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:02:33,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004435336] [2022-11-25 17:02:33,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004435336] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:02:33,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:02:33,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:02:33,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647647582] [2022-11-25 17:02:33,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:02:33,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:02:33,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:02:33,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:02:33,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:02:33,890 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-25 17:02:33,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:02:33,942 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2022-11-25 17:02:33,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:02:33,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) Word has length 16 [2022-11-25 17:02:33,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:02:33,943 INFO L225 Difference]: With dead ends: 37 [2022-11-25 17:02:33,944 INFO L226 Difference]: Without dead ends: 25 [2022-11-25 17:02:33,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:02:33,946 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:02:33,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:02:33,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-25 17:02:33,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-11-25 17:02:33,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 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-25 17:02:33,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2022-11-25 17:02:33,952 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 16 [2022-11-25 17:02:33,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:02:33,952 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2022-11-25 17:02:33,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-25 17:02:33,953 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2022-11-25 17:02:33,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 17:02:33,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:02:33,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:02:33,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:02:33,954 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:02:33,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:02:33,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1170053690, now seen corresponding path program 1 times [2022-11-25 17:02:33,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:02:33,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052471342] [2022-11-25 17:02:33,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:02:33,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:02:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:02:34,287 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-25 17:02:34,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:02:34,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052471342] [2022-11-25 17:02:34,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052471342] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:02:34,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:02:34,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:02:34,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120151791] [2022-11-25 17:02:34,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:02:34,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:02:34,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:02:34,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:02:34,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:02:34,294 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-25 17:02:34,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:02:34,582 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-11-25 17:02:34,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:02:34,584 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) Word has length 16 [2022-11-25 17:02:34,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:02:34,585 INFO L225 Difference]: With dead ends: 41 [2022-11-25 17:02:34,585 INFO L226 Difference]: Without dead ends: 39 [2022-11-25 17:02:34,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:02:34,587 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 10 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:02:34,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 81 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:02:34,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-25 17:02:34,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2022-11-25 17:02:34,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 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-25 17:02:34,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2022-11-25 17:02:34,593 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 16 [2022-11-25 17:02:34,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:02:34,593 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2022-11-25 17:02:34,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-25 17:02:34,594 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-11-25 17:02:34,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 17:02:34,594 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:02:34,595 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:02:34,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:02:34,595 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:02:34,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:02:34,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1171900732, now seen corresponding path program 1 times [2022-11-25 17:02:34,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:02:34,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408131125] [2022-11-25 17:02:34,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:02:34,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:02:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:02:35,366 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-25 17:02:35,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:02:35,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408131125] [2022-11-25 17:02:35,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408131125] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:02:35,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:02:35,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:02:35,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974622626] [2022-11-25 17:02:35,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:02:35,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:02:35,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:02:35,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:02:35,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:02:35,372 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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-25 17:02:35,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:02:35,723 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2022-11-25 17:02:35,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:02:35,723 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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) Word has length 16 [2022-11-25 17:02:35,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:02:35,725 INFO L225 Difference]: With dead ends: 93 [2022-11-25 17:02:35,725 INFO L226 Difference]: Without dead ends: 74 [2022-11-25 17:02:35,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-11-25 17:02:35,727 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 90 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:02:35,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 79 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:02:35,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-25 17:02:35,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 42. [2022-11-25 17:02:35,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 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-25 17:02:35,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2022-11-25 17:02:35,737 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 16 [2022-11-25 17:02:35,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:02:35,737 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2022-11-25 17:02:35,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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-25 17:02:35,738 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2022-11-25 17:02:35,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 17:02:35,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:02:35,739 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:02:35,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:02:35,739 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:02:35,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:02:35,740 INFO L85 PathProgramCache]: Analyzing trace with hash 604953672, now seen corresponding path program 1 times [2022-11-25 17:02:35,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:02:35,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728522321] [2022-11-25 17:02:35,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:02:35,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:02:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:02:35,916 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-25 17:02:35,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:02:35,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728522321] [2022-11-25 17:02:35,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728522321] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:02:35,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:02:35,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:02:35,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670642765] [2022-11-25 17:02:35,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:02:35,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:02:35,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:02:35,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:02:35,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:02:35,920 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-25 17:02:36,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:02:36,094 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2022-11-25 17:02:36,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:02:36,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) Word has length 16 [2022-11-25 17:02:36,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:02:36,096 INFO L225 Difference]: With dead ends: 87 [2022-11-25 17:02:36,096 INFO L226 Difference]: Without dead ends: 64 [2022-11-25 17:02:36,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:02:36,098 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 81 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:02:36,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 73 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:02:36,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-25 17:02:36,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 40. [2022-11-25 17:02:36,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 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-25 17:02:36,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2022-11-25 17:02:36,107 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 16 [2022-11-25 17:02:36,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:02:36,107 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2022-11-25 17:02:36,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-25 17:02:36,108 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-11-25 17:02:36,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 17:02:36,108 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:02:36,109 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:02:36,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:02:36,109 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:02:36,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:02:36,110 INFO L85 PathProgramCache]: Analyzing trace with hash 466614784, now seen corresponding path program 1 times [2022-11-25 17:02:36,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:02:36,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640276801] [2022-11-25 17:02:36,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:02:36,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:02:36,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:02:36,345 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-25 17:02:36,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:02:36,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640276801] [2022-11-25 17:02:36,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640276801] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:02:36,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:02:36,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:02:36,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704764248] [2022-11-25 17:02:36,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:02:36,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:02:36,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:02:36,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:02:36,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:02:36,350 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-25 17:02:36,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:02:36,672 INFO L93 Difference]: Finished difference Result 105 states and 131 transitions. [2022-11-25 17:02:36,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 17:02:36,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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) Word has length 17 [2022-11-25 17:02:36,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:02:36,679 INFO L225 Difference]: With dead ends: 105 [2022-11-25 17:02:36,679 INFO L226 Difference]: Without dead ends: 86 [2022-11-25 17:02:36,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-11-25 17:02:36,684 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 56 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:02:36,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 132 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:02:36,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-25 17:02:36,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 48. [2022-11-25 17:02:36,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 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-25 17:02:36,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2022-11-25 17:02:36,703 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 17 [2022-11-25 17:02:36,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:02:36,704 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2022-11-25 17:02:36,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-25 17:02:36,704 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2022-11-25 17:02:36,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 17:02:36,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:02:36,706 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:02:36,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:02:36,706 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:02:36,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:02:36,708 INFO L85 PathProgramCache]: Analyzing trace with hash -2051498108, now seen corresponding path program 1 times [2022-11-25 17:02:36,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:02:36,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566692592] [2022-11-25 17:02:36,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:02:36,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:02:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:02:36,892 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-25 17:02:36,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:02:36,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566692592] [2022-11-25 17:02:36,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566692592] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:02:36,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:02:36,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:02:36,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026416516] [2022-11-25 17:02:36,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:02:36,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:02:36,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:02:36,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:02:36,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:02:36,896 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-25 17:02:37,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:02:37,090 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2022-11-25 17:02:37,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:02:37,091 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), 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) Word has length 17 [2022-11-25 17:02:37,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:02:37,092 INFO L225 Difference]: With dead ends: 84 [2022-11-25 17:02:37,093 INFO L226 Difference]: Without dead ends: 82 [2022-11-25 17:02:37,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:02:37,097 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 35 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:02:37,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 110 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:02:37,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-25 17:02:37,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 48. [2022-11-25 17:02:37,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 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-25 17:02:37,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2022-11-25 17:02:37,120 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 17 [2022-11-25 17:02:37,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:02:37,120 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2022-11-25 17:02:37,121 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), 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-25 17:02:37,121 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2022-11-25 17:02:37,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 17:02:37,124 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:02:37,124 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:02:37,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:02:37,125 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:02:37,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:02:37,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1690516158, now seen corresponding path program 1 times [2022-11-25 17:02:37,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:02:37,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005646533] [2022-11-25 17:02:37,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:02:37,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:02:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:02:40,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:02:40,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:02:40,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005646533] [2022-11-25 17:02:40,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005646533] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:02:40,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820281319] [2022-11-25 17:02:40,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:02:40,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:02:40,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935a36aa-576d-479e-be8b-9e9e332af8fa/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:02:40,291 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935a36aa-576d-479e-be8b-9e9e332af8fa/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:02:40,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935a36aa-576d-479e-be8b-9e9e332af8fa/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 17:02:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:02:40,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-25 17:02:40,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:02:40,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 17:02:40,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:02:40,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:02:40,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-11-25 17:02:40,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:02:40,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:02:40,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-11-25 17:02:40,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-25 17:02:40,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:02:40,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 42 [2022-11-25 17:02:40,661 INFO L321 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2022-11-25 17:02:40,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2022-11-25 17:02:40,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2022-11-25 17:02:40,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-25 17:02:40,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-11-25 17:02:40,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:02:40,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:02:40,931 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 17:02:40,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 65 [2022-11-25 17:02:40,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:02:40,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 49 [2022-11-25 17:02:41,010 INFO L321 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2022-11-25 17:02:41,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 123 treesize of output 111 [2022-11-25 17:02:41,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:02:41,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:02:41,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:02:41,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:02:41,035 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 17:02:41,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 43 [2022-11-25 17:02:41,086 INFO L321 Elim1Store]: treesize reduction 70, result has 35.8 percent of original size [2022-11-25 17:02:41,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 57 [2022-11-25 17:02:41,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-11-25 17:02:41,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:02:41,335 INFO L321 Elim1Store]: treesize reduction 76, result has 21.6 percent of original size [2022-11-25 17:02:41,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 110 treesize of output 105 [2022-11-25 17:02:41,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:02:41,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:02:41,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:02:41,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2022-11-25 17:02:41,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-11-25 17:02:41,415 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-25 17:02:41,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 65 [2022-11-25 17:02:42,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:02:42,218 INFO L321 Elim1Store]: treesize reduction 87, result has 3.3 percent of original size [2022-11-25 17:02:42,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 170 treesize of output 81 [2022-11-25 17:02:42,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:02:42,243 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-25 17:02:42,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 29 [2022-11-25 17:02:42,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:02:42,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:02:42,545 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:02:42,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 115 [2022-11-25 17:02:50,562 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_24| Int)) (or (forall ((v_ArrVal_456 Int)) (or (not (= (select |c_#valid| v_ArrVal_456) 0)) (forall ((v_ArrVal_446 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_450 (Array Int Int)) (v_subst_3 Int) (v_ArrVal_454 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_5 (+ 8 v_subst_3)))) (or (not (= (select (store |c_#valid| v_ArrVal_456 1) .cse0) 0)) (forall ((v_ArrVal_468 (Array Int Int)) (v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse7 |v_ULTIMATE.start_main_~x~0#1.offset_24| v_ArrVal_456)))) (let ((.cse5 (select (select (store .cse6 v_ArrVal_456 v_ArrVal_446) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_24|))) (let ((.cse2 (select (select (store (store (store .cse6 v_ArrVal_456 v_ArrVal_454) .cse5 v_arrayElimArr_5) .cse0 v_ArrVal_475) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (let ((.cse1 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse4 |v_ULTIMATE.start_main_~x~0#1.offset_24| 0)) v_ArrVal_456 v_ArrVal_450) .cse5 v_ArrVal_476) .cse0 v_ArrVal_468))) (select (select .cse1 .cse2) (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) 0) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse2))))))))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_24| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_24| Int)) (or (forall ((v_ArrVal_456 Int)) (or (not (= (select |c_#valid| v_ArrVal_456) 0)) (forall ((v_ArrVal_446 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_450 (Array Int Int)) (v_ArrVal_454 (Array Int Int)) (v_subst_1 Int)) (let ((.cse11 (select v_arrayElimArr_5 (+ 8 v_subst_1)))) (or (forall ((v_ArrVal_468 (Array Int Int)) (v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse7 |v_ULTIMATE.start_main_~x~0#1.offset_24| v_ArrVal_456)))) (let ((.cse10 (select (select (store .cse12 v_ArrVal_456 v_ArrVal_446) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_24|))) (let ((.cse8 (store (store (store .cse12 v_ArrVal_456 v_ArrVal_454) .cse10 v_arrayElimArr_5) .cse11 v_ArrVal_475))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (select .cse8 .cse9) (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse4 |v_ULTIMATE.start_main_~x~0#1.offset_24| 0)) v_ArrVal_456 v_ArrVal_450) .cse10 v_ArrVal_476) .cse11 v_ArrVal_468) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) 0) (= .cse9 |c_ULTIMATE.start_main_~head~0#1.base|))))))) (not (= (select (store |c_#valid| v_ArrVal_456 1) .cse11) 0))))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_24| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_24| Int)) (or (forall ((v_ArrVal_456 Int)) (or (not (= (select |c_#valid| v_ArrVal_456) 0)) (forall ((v_ArrVal_446 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_450 (Array Int Int)) (v_ArrVal_454 (Array Int Int)) (v_subst_2 Int)) (let ((.cse17 (select v_arrayElimArr_5 (+ 8 v_subst_2)))) (or (forall ((v_ArrVal_468 (Array Int Int)) (v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse7 |v_ULTIMATE.start_main_~x~0#1.offset_24| v_ArrVal_456)))) (let ((.cse16 (select (select (store .cse15 v_ArrVal_456 v_ArrVal_446) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_24|))) (let ((.cse14 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse4 |v_ULTIMATE.start_main_~x~0#1.offset_24| 0)) v_ArrVal_456 v_ArrVal_450) .cse16 v_ArrVal_476) .cse17 v_ArrVal_468))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse13 |c_ULTIMATE.start_main_~head~0#1.offset|) (= (select (select .cse14 (select (select (store (store (store .cse15 v_ArrVal_456 v_ArrVal_454) .cse16 v_arrayElimArr_5) .cse17 v_ArrVal_475) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) .cse13) 0))))))) (not (= (select (store |c_#valid| v_ArrVal_456 1) .cse17) 0))))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_24| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_24| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_24| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_456 Int)) (or (forall ((v_ArrVal_446 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_450 (Array Int Int)) (v_subst_4 Int) (v_ArrVal_454 (Array Int Int))) (let ((.cse18 (select v_arrayElimArr_5 (+ 8 v_subst_4)))) (or (not (= (select (store |c_#valid| v_ArrVal_456 1) .cse18) 0)) (forall ((v_ArrVal_468 (Array Int Int)) (v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse7 |v_ULTIMATE.start_main_~x~0#1.offset_24| v_ArrVal_456)))) (let ((.cse21 (select (select (store .cse20 v_ArrVal_456 v_ArrVal_446) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_24|))) (let ((.cse22 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse4 |v_ULTIMATE.start_main_~x~0#1.offset_24| 0)) v_ArrVal_456 v_ArrVal_450) .cse21 v_ArrVal_476) .cse18 v_ArrVal_468) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (let ((.cse19 (store (store (store .cse20 v_ArrVal_456 v_ArrVal_454) .cse21 v_arrayElimArr_5) .cse18 v_ArrVal_475))) (select .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) .cse22) 0) (= .cse22 |c_ULTIMATE.start_main_~head~0#1.offset|))))))))) (not (= (select |c_#valid| v_ArrVal_456) 0)))))))) is different from false [2022-11-25 17:02:55,137 INFO L321 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2022-11-25 17:02:55,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 3853 treesize of output 3532 [2022-11-25 17:03:04,523 WARN L233 SmtUtils]: Spent 9.35s on a formula simplification. DAG size of input: 25 DAG size of output: 22 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-25 17:03:04,524 INFO L321 Elim1Store]: treesize reduction 15, result has 67.4 percent of original size [2022-11-25 17:03:04,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 6261 treesize of output 4356 [2022-11-25 17:03:28,364 WARN L233 SmtUtils]: Spent 20.30s on a formula simplification. DAG size of input: 140 DAG size of output: 116 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-25 17:03:28,365 INFO L321 Elim1Store]: treesize reduction 576, result has 60.0 percent of original size [2022-11-25 17:03:28,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 2291269826 treesize of output 2262244066