./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f 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_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8 --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 6070ac475d5b3c3d5905eb0c203232134efabc1c427fcfbbf8cf82789693617b --- 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-e04fb08 [2022-11-16 12:46:22,235 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:46:22,239 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:46:22,275 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:46:22,276 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:46:22,280 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:46:22,283 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:46:22,290 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:46:22,292 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:46:22,299 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:46:22,301 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:46:22,304 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:46:22,304 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:46:22,307 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:46:22,310 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:46:22,313 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:46:22,315 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:46:22,316 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:46:22,318 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:46:22,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:46:22,328 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:46:22,330 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:46:22,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:46:22,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:46:22,345 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:46:22,345 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:46:22,346 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:46:22,348 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:46:22,348 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:46:22,350 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:46:22,351 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:46:22,352 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:46:22,354 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:46:22,356 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:46:22,358 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:46:22,359 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:46:22,360 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:46:22,360 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:46:22,360 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:46:22,361 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:46:22,362 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:46:22,363 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 12:46:22,404 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:46:22,405 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:46:22,405 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:46:22,405 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:46:22,406 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:46:22,406 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:46:22,411 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:46:22,412 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:46:22,412 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:46:22,412 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:46:22,413 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:46:22,414 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:46:22,414 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:46:22,414 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:46:22,414 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:46:22,415 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:46:22,415 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:46:22,415 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:46:22,415 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:46:22,416 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:46:22,416 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:46:22,416 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:46:22,416 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:46:22,417 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:46:22,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:46:22,417 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:46:22,419 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:46:22,420 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:46:22,420 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:46:22,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:46:22,420 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:46:22,420 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:46:22,421 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:46:22,421 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/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_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8 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 -> 6070ac475d5b3c3d5905eb0c203232134efabc1c427fcfbbf8cf82789693617b [2022-11-16 12:46:22,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:46:22,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:46:22,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:46:22,810 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:46:22,811 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:46:22,813 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i [2022-11-16 12:46:22,903 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/data/f5f5a1b32/6c096b7e6ad3482b925e9c42a9a083fb/FLAGd84c612b2 [2022-11-16 12:46:23,495 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:46:23,495 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i [2022-11-16 12:46:23,508 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/data/f5f5a1b32/6c096b7e6ad3482b925e9c42a9a083fb/FLAGd84c612b2 [2022-11-16 12:46:23,779 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/data/f5f5a1b32/6c096b7e6ad3482b925e9c42a9a083fb [2022-11-16 12:46:23,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:46:23,787 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:46:23,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:46:23,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:46:23,800 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:46:23,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:46:23" (1/1) ... [2022-11-16 12:46:23,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@713e7414 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:23, skipping insertion in model container [2022-11-16 12:46:23,803 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:46:23" (1/1) ... [2022-11-16 12:46:23,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:46:23,856 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:46:24,245 WARN L229 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_f07e6ff6-04d4-4c33-bef5-aff6616bde92/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i[22480,22493] [2022-11-16 12:46:24,249 WARN L229 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_f07e6ff6-04d4-4c33-bef5-aff6616bde92/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i[22552,22565] [2022-11-16 12:46:24,251 WARN L229 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_f07e6ff6-04d4-4c33-bef5-aff6616bde92/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i[22704,22717] [2022-11-16 12:46:24,252 WARN L229 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_f07e6ff6-04d4-4c33-bef5-aff6616bde92/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i[22778,22791] [2022-11-16 12:46:24,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:46:24,267 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:46:24,308 WARN L229 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_f07e6ff6-04d4-4c33-bef5-aff6616bde92/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i[22480,22493] [2022-11-16 12:46:24,309 WARN L229 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_f07e6ff6-04d4-4c33-bef5-aff6616bde92/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i[22552,22565] [2022-11-16 12:46:24,311 WARN L229 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_f07e6ff6-04d4-4c33-bef5-aff6616bde92/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i[22704,22717] [2022-11-16 12:46:24,312 WARN L229 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_f07e6ff6-04d4-4c33-bef5-aff6616bde92/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i[22778,22791] [2022-11-16 12:46:24,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:46:24,341 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:46:24,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:24 WrapperNode [2022-11-16 12:46:24,342 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:46:24,343 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:46:24,344 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:46:24,344 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:46:24,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:24" (1/1) ... [2022-11-16 12:46:24,394 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:24" (1/1) ... [2022-11-16 12:46:24,432 INFO L138 Inliner]: procedures = 119, calls = 32, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 116 [2022-11-16 12:46:24,433 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:46:24,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:46:24,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:46:24,435 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:46:24,444 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:24" (1/1) ... [2022-11-16 12:46:24,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:24" (1/1) ... [2022-11-16 12:46:24,454 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:24" (1/1) ... [2022-11-16 12:46:24,455 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:24" (1/1) ... [2022-11-16 12:46:24,471 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:24" (1/1) ... [2022-11-16 12:46:24,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:24" (1/1) ... [2022-11-16 12:46:24,486 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:24" (1/1) ... [2022-11-16 12:46:24,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:24" (1/1) ... [2022-11-16 12:46:24,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:46:24,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:46:24,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:46:24,503 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:46:24,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:24" (1/1) ... [2022-11-16 12:46:24,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:46:24,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:24,537 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:46:24,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:46:24,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 12:46:24,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:46:24,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:46:24,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:46:24,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 12:46:24,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 12:46:24,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:46:24,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:46:24,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:46:24,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:46:24,710 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:46:24,713 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:46:24,931 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:46:24,948 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:46:24,948 INFO L300 CfgBuilder]: Removed 11 assume(true) statements. [2022-11-16 12:46:24,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:46:24 BoogieIcfgContainer [2022-11-16 12:46:24,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:46:24,962 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:46:24,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:46:24,979 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:46:24,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:46:23" (1/3) ... [2022-11-16 12:46:24,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2123bec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:46:24, skipping insertion in model container [2022-11-16 12:46:24,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:46:24" (2/3) ... [2022-11-16 12:46:24,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2123bec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:46:24, skipping insertion in model container [2022-11-16 12:46:24,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:46:24" (3/3) ... [2022-11-16 12:46:24,983 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-1.i [2022-11-16 12:46:25,021 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:46:25,035 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-16 12:46:25,127 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:46:25,145 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;@70487682, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:46:25,147 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-16 12:46:25,153 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 32 states have internal predecessors, (53), 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-16 12:46:25,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 12:46:25,166 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:25,167 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 12:46:25,168 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-16 12:46:25,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:25,180 INFO L85 PathProgramCache]: Analyzing trace with hash 889968582, now seen corresponding path program 1 times [2022-11-16 12:46:25,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:25,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231083359] [2022-11-16 12:46:25,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:25,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:25,474 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-16 12:46:25,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:25,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231083359] [2022-11-16 12:46:25,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231083359] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:46:25,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:46:25,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:46:25,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032029137] [2022-11-16 12:46:25,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:46:25,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:46:25,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:25,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:46:25,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:46:25,540 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 32 states have internal predecessors, (53), 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 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-16 12:46:25,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:25,561 INFO L93 Difference]: Finished difference Result 61 states and 98 transitions. [2022-11-16 12:46:25,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:46:25,566 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2022-11-16 12:46:25,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:25,574 INFO L225 Difference]: With dead ends: 61 [2022-11-16 12:46:25,575 INFO L226 Difference]: Without dead ends: 27 [2022-11-16 12:46:25,578 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-16 12:46:25,582 INFO L413 NwaCegarLoop]: 38 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, 38 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-16 12:46:25,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:46:25,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-16 12:46:25,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-16 12:46:25,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 26 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-16 12:46:25,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-11-16 12:46:25,625 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 6 [2022-11-16 12:46:25,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:25,626 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-11-16 12:46:25,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-16 12:46:25,626 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-11-16 12:46:25,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 12:46:25,627 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:25,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:25,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:46:25,628 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-16 12:46:25,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:25,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1806853233, now seen corresponding path program 1 times [2022-11-16 12:46:25,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:25,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89302486] [2022-11-16 12:46:25,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:25,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:25,824 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-16 12:46:25,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:25,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89302486] [2022-11-16 12:46:25,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89302486] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:46:25,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:46:25,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:46:25,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746295013] [2022-11-16 12:46:25,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:46:25,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:46:25,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:25,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:46:25,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:46:25,830 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-16 12:46:25,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:25,944 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-11-16 12:46:25,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:46:25,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2022-11-16 12:46:25,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:25,947 INFO L225 Difference]: With dead ends: 30 [2022-11-16 12:46:25,948 INFO L226 Difference]: Without dead ends: 28 [2022-11-16 12:46:25,948 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-16 12:46:25,951 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 40 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:25,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 28 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:46:25,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-16 12:46:25,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-11-16 12:46:25,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 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-16 12:46:25,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-11-16 12:46:25,975 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 7 [2022-11-16 12:46:25,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:25,977 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-11-16 12:46:25,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-16 12:46:25,978 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-11-16 12:46:25,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 12:46:25,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:25,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:25,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:46:25,982 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-16 12:46:25,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:25,983 INFO L85 PathProgramCache]: Analyzing trace with hash -856511048, now seen corresponding path program 1 times [2022-11-16 12:46:25,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:25,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575337223] [2022-11-16 12:46:25,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:25,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:26,394 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-16 12:46:26,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:26,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575337223] [2022-11-16 12:46:26,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575337223] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:46:26,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:46:26,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:46:26,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529989802] [2022-11-16 12:46:26,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:46:26,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:46:26,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:26,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:46:26,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:46:26,404 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-16 12:46:26,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:26,608 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2022-11-16 12:46:26,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:46:26,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2022-11-16 12:46:26,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:26,613 INFO L225 Difference]: With dead ends: 50 [2022-11-16 12:46:26,614 INFO L226 Difference]: Without dead ends: 48 [2022-11-16 12:46:26,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:46:26,621 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 32 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:26,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 53 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:46:26,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-16 12:46:26,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2022-11-16 12:46:26,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 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-16 12:46:26,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-11-16 12:46:26,640 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 10 [2022-11-16 12:46:26,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:26,641 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-11-16 12:46:26,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-16 12:46:26,641 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-11-16 12:46:26,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 12:46:26,643 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:26,643 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:26,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:46:26,644 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-16 12:46:26,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:26,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1594081566, now seen corresponding path program 1 times [2022-11-16 12:46:26,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:26,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571754029] [2022-11-16 12:46:26,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:26,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:27,429 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-16 12:46:27,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:27,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571754029] [2022-11-16 12:46:27,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571754029] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:46:27,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046816179] [2022-11-16 12:46:27,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:27,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:27,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:27,439 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:46:27,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:46:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:27,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-16 12:46:27,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:46:27,675 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-16 12:46:27,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-16 12:46:27,795 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:46:27,796 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 17 treesize of output 21 [2022-11-16 12:46:27,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:46:27,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-16 12:46:27,830 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:46:27,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:46:27,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:46:27,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-16 12:46:27,956 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 12:46:27,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:46:28,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-11-16 12:46:28,054 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-16 12:46:28,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:46:28,337 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:46:28,341 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-16 12:46:28,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 1 [2022-11-16 12:46:28,343 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-16 12:46:28,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046816179] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:46:28,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:46:28,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-11-16 12:46:28,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697161854] [2022-11-16 12:46:28,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:46:28,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 12:46:28,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:28,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 12:46:28,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-11-16 12:46:28,347 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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-16 12:46:28,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:28,745 INFO L93 Difference]: Finished difference Result 77 states and 91 transitions. [2022-11-16 12:46:28,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:46:28,746 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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 13 [2022-11-16 12:46:28,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:28,751 INFO L225 Difference]: With dead ends: 77 [2022-11-16 12:46:28,751 INFO L226 Difference]: Without dead ends: 75 [2022-11-16 12:46:28,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2022-11-16 12:46:28,756 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 76 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:28,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 104 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 110 Invalid, 0 Unknown, 73 Unchecked, 0.2s Time] [2022-11-16 12:46:28,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-16 12:46:28,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 38. [2022-11-16 12:46:28,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 37 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-16 12:46:28,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-11-16 12:46:28,776 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 13 [2022-11-16 12:46:28,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:28,776 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-11-16 12:46:28,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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-16 12:46:28,777 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-11-16 12:46:28,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 12:46:28,783 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:28,783 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:28,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:46:28,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:28,990 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-16 12:46:28,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:28,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1689639521, now seen corresponding path program 1 times [2022-11-16 12:46:28,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:28,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663033394] [2022-11-16 12:46:28,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:28,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:29,090 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-16 12:46:29,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:29,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663033394] [2022-11-16 12:46:29,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663033394] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:46:29,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:46:29,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:46:29,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410545636] [2022-11-16 12:46:29,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:46:29,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:46:29,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:29,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:46:29,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:46:29,094 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-16 12:46:29,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:29,185 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-11-16 12:46:29,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:46:29,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2022-11-16 12:46:29,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:29,187 INFO L225 Difference]: With dead ends: 53 [2022-11-16 12:46:29,187 INFO L226 Difference]: Without dead ends: 41 [2022-11-16 12:46:29,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:46:29,188 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:29,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 56 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:46:29,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-16 12:46:29,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2022-11-16 12:46:29,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 39 states have internal predecessors, (48), 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-16 12:46:29,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2022-11-16 12:46:29,197 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 14 [2022-11-16 12:46:29,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:29,197 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2022-11-16 12:46:29,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-16 12:46:29,198 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2022-11-16 12:46:29,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 12:46:29,198 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:29,199 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:29,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:46:29,199 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-16 12:46:29,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:29,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1344547832, now seen corresponding path program 2 times [2022-11-16 12:46:29,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:29,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639593193] [2022-11-16 12:46:29,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:29,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:30,057 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:46:30,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:30,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639593193] [2022-11-16 12:46:30,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639593193] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:46:30,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460060302] [2022-11-16 12:46:30,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:46:30,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:30,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:30,063 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:46:30,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:46:30,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:46:30,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:46:30,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 12:46:30,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:46:30,244 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-16 12:46:30,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-16 12:46:30,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:46:30,313 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 24 treesize of output 26 [2022-11-16 12:46:30,329 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:46:30,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 16 treesize of output 22 [2022-11-16 12:46:30,348 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 7 treesize of output 3 [2022-11-16 12:46:30,374 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:46:30,375 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 17 treesize of output 21 [2022-11-16 12:46:30,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:46:30,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:46:30,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-16 12:46:30,469 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-16 12:46:30,469 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 22 treesize of output 33 [2022-11-16 12:46:30,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:46:30,591 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:46:30,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 27 [2022-11-16 12:46:30,625 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 12:46:30,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:46:30,700 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-16 12:46:30,701 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2022-11-16 12:46:30,709 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 8 treesize of output 7 [2022-11-16 12:46:30,723 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 7 treesize of output 3 [2022-11-16 12:46:30,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-11-16 12:46:30,850 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:46:30,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:46:30,874 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:46:30,875 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 18 treesize of output 22 [2022-11-16 12:46:30,884 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~end~0#1.base_35| Int) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_392 (Array Int Int))) (or (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_392) |v_ULTIMATE.start_main_~end~0#1.base_35| v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_4 4))))) is different from false [2022-11-16 12:46:30,922 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~end~0#1.base_35| Int) (|v_ULTIMATE.start_main_~end~0#1.base_36| Int) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_392 (Array Int Int)) (v_ArrVal_388 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_36|) 0)) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_388) |v_ULTIMATE.start_main_~end~0#1.base_36| v_ArrVal_392) |v_ULTIMATE.start_main_~end~0#1.base_35| v_arrayElimArr_4) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_4 4))))) is different from false [2022-11-16 12:46:31,257 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:46:31,262 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-16 12:46:31,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 1 [2022-11-16 12:46:31,263 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-16 12:46:31,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460060302] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:46:31,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:46:31,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2022-11-16 12:46:31,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325246797] [2022-11-16 12:46:31,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:46:31,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 12:46:31,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:31,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 12:46:31,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=185, Unknown=3, NotChecked=58, Total=306 [2022-11-16 12:46:31,267 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 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-16 12:46:32,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:32,057 INFO L93 Difference]: Finished difference Result 113 states and 130 transitions. [2022-11-16 12:46:32,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-16 12:46:32,057 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 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-16 12:46:32,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:32,061 INFO L225 Difference]: With dead ends: 113 [2022-11-16 12:46:32,061 INFO L226 Difference]: Without dead ends: 111 [2022-11-16 12:46:32,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=189, Invalid=623, Unknown=8, NotChecked=110, Total=930 [2022-11-16 12:46:32,064 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 118 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 179 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:32,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 180 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 148 Invalid, 0 Unknown, 179 Unchecked, 0.2s Time] [2022-11-16 12:46:32,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-16 12:46:32,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 46. [2022-11-16 12:46:32,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 45 states have internal predecessors, (58), 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-16 12:46:32,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2022-11-16 12:46:32,092 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 16 [2022-11-16 12:46:32,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:32,092 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2022-11-16 12:46:32,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 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-16 12:46:32,095 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-11-16 12:46:32,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 12:46:32,097 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:32,097 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:32,110 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:46:32,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-16 12:46:32,312 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-16 12:46:32,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:32,313 INFO L85 PathProgramCache]: Analyzing trace with hash 406324024, now seen corresponding path program 1 times [2022-11-16 12:46:32,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:32,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265935177] [2022-11-16 12:46:32,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:32,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:32,782 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:46:32,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:32,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265935177] [2022-11-16 12:46:32,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265935177] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:46:32,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398511245] [2022-11-16 12:46:32,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:32,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:32,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:32,784 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:46:32,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:46:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:32,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-16 12:46:32,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:46:32,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-16 12:46:32,949 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-16 12:46:33,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:46:33,027 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 24 treesize of output 26 [2022-11-16 12:46:33,040 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:46:33,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 16 treesize of output 22 [2022-11-16 12:46:33,047 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 7 treesize of output 3 [2022-11-16 12:46:33,068 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:46:33,068 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 17 treesize of output 21 [2022-11-16 12:46:33,109 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:46:33,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:46:33,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:46:33,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-16 12:46:33,171 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 12:46:33,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:46:33,198 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:46:33,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-11-16 12:46:33,258 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:46:33,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:46:33,463 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:46:33,467 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-16 12:46:33,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 1 [2022-11-16 12:46:33,468 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:46:33,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398511245] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:46:33,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:46:33,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2022-11-16 12:46:33,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345065682] [2022-11-16 12:46:33,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:46:33,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 12:46:33,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:33,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 12:46:33,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=159, Unknown=1, NotChecked=0, Total=210 [2022-11-16 12:46:33,470 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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-16 12:46:33,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:33,731 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2022-11-16 12:46:33,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:46:33,731 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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-16 12:46:33,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:33,732 INFO L225 Difference]: With dead ends: 54 [2022-11-16 12:46:33,732 INFO L226 Difference]: Without dead ends: 52 [2022-11-16 12:46:33,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=247, Unknown=1, NotChecked=0, Total=342 [2022-11-16 12:46:33,733 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 68 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:33,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 84 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 94 Invalid, 0 Unknown, 31 Unchecked, 0.1s Time] [2022-11-16 12:46:33,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-16 12:46:33,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 25. [2022-11-16 12:46:33,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 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-16 12:46:33,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-11-16 12:46:33,740 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2022-11-16 12:46:33,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:33,740 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-11-16 12:46:33,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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-16 12:46:33,740 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-11-16 12:46:33,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 12:46:33,741 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:33,741 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:33,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 12:46:33,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:33,948 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-16 12:46:33,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:33,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2084817261, now seen corresponding path program 1 times [2022-11-16 12:46:33,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:33,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040925030] [2022-11-16 12:46:33,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:33,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:34,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:46:34,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:34,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040925030] [2022-11-16 12:46:34,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040925030] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:46:34,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738573439] [2022-11-16 12:46:34,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:34,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:34,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:34,054 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:46:34,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 12:46:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:34,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-16 12:46:34,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:46:34,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:46:34,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-16 12:46:34,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:46:34,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-16 12:46:34,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-11-16 12:46:34,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-11-16 12:46:34,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:46:34,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:46:34,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:46:34,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738573439] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:46:34,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:46:34,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-11-16 12:46:34,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499582439] [2022-11-16 12:46:34,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:46:34,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:46:34,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:34,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:46:34,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:46:34,394 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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-16 12:46:34,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:34,506 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-11-16 12:46:34,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:46:34,506 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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-16 12:46:34,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:34,507 INFO L225 Difference]: With dead ends: 49 [2022-11-16 12:46:34,507 INFO L226 Difference]: Without dead ends: 27 [2022-11-16 12:46:34,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:46:34,508 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 27 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:34,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 60 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:46:34,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-16 12:46:34,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-16 12:46:34,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.2) internal successors, (30), 26 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-16 12:46:34,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-11-16 12:46:34,515 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 17 [2022-11-16 12:46:34,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:34,516 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-11-16 12:46:34,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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-16 12:46:34,516 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-11-16 12:46:34,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 12:46:34,517 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:34,517 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:34,528 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 12:46:34,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:34,728 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-16 12:46:34,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:34,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1088473273, now seen corresponding path program 1 times [2022-11-16 12:46:34,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:34,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280753091] [2022-11-16 12:46:34,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:34,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:35,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:46:35,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:46:35,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280753091] [2022-11-16 12:46:35,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280753091] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:46:35,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814367380] [2022-11-16 12:46:35,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:35,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:46:35,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:46:35,306 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:46:35,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 12:46:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:35,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-16 12:46:35,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:46:35,469 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-16 12:46:35,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-16 12:46:35,525 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:46:35,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 14 treesize of output 20 [2022-11-16 12:46:35,532 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 5 treesize of output 3 [2022-11-16 12:46:35,552 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:46:35,553 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 17 treesize of output 21 [2022-11-16 12:46:35,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-16 12:46:35,573 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:46:35,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:46:35,655 INFO L321 Elim1Store]: treesize reduction 35, result has 34.0 percent of original size [2022-11-16 12:46:35,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 52 [2022-11-16 12:46:35,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:46:35,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:46:35,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 39 [2022-11-16 12:46:35,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-11-16 12:46:35,698 INFO L321 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2022-11-16 12:46:35,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 46 [2022-11-16 12:46:35,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 67 treesize of output 47 [2022-11-16 12:46:35,994 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:46:35,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 23 [2022-11-16 12:46:35,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:46:35,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:46:36,045 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:46:36,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2022-11-16 12:46:36,113 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:46:36,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 64 treesize of output 65 [2022-11-16 12:46:36,123 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:46:36,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 56 treesize of output 49 [2022-11-16 12:46:36,203 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:46:36,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 1632 treesize of output 1245 [2022-11-16 12:46:36,338 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:46:36,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1275 treesize of output 1049 [2022-11-16 12:46:36,421 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:46:36,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 917 treesize of output 823 [2022-11-16 12:46:36,472 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:46:36,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 540 treesize of output 511 [2022-11-16 12:46:36,564 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 496 treesize of output 460 [2022-11-16 12:46:36,621 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 460 treesize of output 442 [2022-11-16 12:46:58,599 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:46:58,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814367380] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:46:58,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:46:58,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2022-11-16 12:46:58,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325853488] [2022-11-16 12:46:58,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:46:58,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 12:46:58,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:46:58,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 12:46:58,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=173, Unknown=1, NotChecked=0, Total=210 [2022-11-16 12:46:58,602 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 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-16 12:46:58,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:46:58,903 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-11-16 12:46:58,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:46:58,904 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 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 20 [2022-11-16 12:46:58,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:46:58,905 INFO L225 Difference]: With dead ends: 52 [2022-11-16 12:46:58,905 INFO L226 Difference]: Without dead ends: 50 [2022-11-16 12:46:58,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=345, Unknown=1, NotChecked=0, Total=420 [2022-11-16 12:46:58,906 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 40 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:46:58,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 118 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 37 Unchecked, 0.1s Time] [2022-11-16 12:46:58,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-16 12:46:58,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-11-16 12:46:58,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 40 states have (on average 1.2) internal successors, (48), 41 states have internal predecessors, (48), 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-16 12:46:58,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2022-11-16 12:46:58,917 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 20 [2022-11-16 12:46:58,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:46:58,917 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-11-16 12:46:58,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 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-16 12:46:58,917 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-11-16 12:46:58,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 12:46:58,918 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:46:58,918 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:46:58,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 12:46:59,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-16 12:46:59,125 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-16 12:46:59,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:46:59,125 INFO L85 PathProgramCache]: Analyzing trace with hash -67404919, now seen corresponding path program 1 times [2022-11-16 12:46:59,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:46:59,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838511320] [2022-11-16 12:46:59,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:46:59,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:46:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:46:59,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:46:59,632 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.CCInterpolator.computeInterpolants(CCInterpolator.java:537) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:327) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:154) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:260) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:237) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:848) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:776) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:284) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-16 12:46:59,642 INFO L158 Benchmark]: Toolchain (without parser) took 35855.50ms. Allocated memory was 146.8MB in the beginning and 465.6MB in the end (delta: 318.8MB). Free memory was 111.2MB in the beginning and 218.6MB in the end (delta: -107.4MB). Peak memory consumption was 212.2MB. Max. memory is 16.1GB. [2022-11-16 12:46:59,643 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 92.3MB. Free memory was 63.6MB in the beginning and 63.6MB in the end (delta: 28.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:46:59,643 INFO L158 Benchmark]: CACSL2BoogieTranslator took 554.08ms. Allocated memory is still 146.8MB. Free memory was 110.9MB in the beginning and 114.7MB in the end (delta: -3.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 12:46:59,643 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.76ms. Allocated memory is still 146.8MB. Free memory was 114.7MB in the beginning and 112.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:46:59,644 INFO L158 Benchmark]: Boogie Preprocessor took 60.99ms. Allocated memory is still 146.8MB. Free memory was 112.8MB in the beginning and 111.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:46:59,644 INFO L158 Benchmark]: RCFGBuilder took 454.97ms. Allocated memory is still 146.8MB. Free memory was 110.7MB in the beginning and 95.2MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-16 12:46:59,645 INFO L158 Benchmark]: TraceAbstraction took 34679.23ms. Allocated memory was 146.8MB in the beginning and 465.6MB in the end (delta: 318.8MB). Free memory was 94.6MB in the beginning and 218.6MB in the end (delta: -123.9MB). Peak memory consumption was 198.0MB. Max. memory is 16.1GB. [2022-11-16 12:46:59,647 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 92.3MB. Free memory was 63.6MB in the beginning and 63.6MB in the end (delta: 28.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 554.08ms. Allocated memory is still 146.8MB. Free memory was 110.9MB in the beginning and 114.7MB in the end (delta: -3.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.76ms. Allocated memory is still 146.8MB. Free memory was 114.7MB in the beginning and 112.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.99ms. Allocated memory is still 146.8MB. Free memory was 112.8MB in the beginning and 111.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 454.97ms. Allocated memory is still 146.8MB. Free memory was 110.7MB in the beginning and 95.2MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 34679.23ms. Allocated memory was 146.8MB in the beginning and 465.6MB in the end (delta: 318.8MB). Free memory was 94.6MB in the beginning and 218.6MB in the end (delta: -123.9MB). Peak memory consumption was 198.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.CCInterpolator.computeInterpolants(CCInterpolator.java:537) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-11-16 12:46:59,682 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8 --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 6070ac475d5b3c3d5905eb0c203232134efabc1c427fcfbbf8cf82789693617b --- 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-e04fb08 [2022-11-16 12:47:02,304 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:47:02,306 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:47:02,339 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:47:02,341 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:47:02,346 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:47:02,349 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:47:02,355 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:47:02,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:47:02,361 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:47:02,363 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:47:02,366 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:47:02,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:47:02,372 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:47:02,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:47:02,376 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:47:02,378 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:47:02,379 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:47:02,382 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:47:02,387 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:47:02,394 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:47:02,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:47:02,397 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:47:02,398 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:47:02,402 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:47:02,407 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:47:02,408 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:47:02,409 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:47:02,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:47:02,411 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:47:02,412 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:47:02,413 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:47:02,415 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:47:02,416 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:47:02,417 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:47:02,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:47:02,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:47:02,419 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:47:02,419 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:47:02,421 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:47:02,422 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:47:02,423 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-16 12:47:02,469 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:47:02,470 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:47:02,471 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:47:02,472 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:47:02,473 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:47:02,473 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:47:02,475 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:47:02,475 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:47:02,475 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:47:02,475 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:47:02,477 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:47:02,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:47:02,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:47:02,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:47:02,478 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:47:02,478 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:47:02,478 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 12:47:02,479 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 12:47:02,479 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 12:47:02,479 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:47:02,479 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:47:02,480 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:47:02,480 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:47:02,480 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:47:02,480 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:47:02,481 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:47:02,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:47:02,482 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:47:02,482 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:47:02,482 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:47:02,482 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 12:47:02,482 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 12:47:02,483 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:47:02,483 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:47:02,483 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:47:02,484 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 12:47:02,484 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/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_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8 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 -> 6070ac475d5b3c3d5905eb0c203232134efabc1c427fcfbbf8cf82789693617b [2022-11-16 12:47:02,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:47:02,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:47:02,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:47:02,918 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:47:02,922 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:47:02,923 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i [2022-11-16 12:47:03,018 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/data/0f69d788d/ef3f14cd4cc244f5b4c54770a6d7ea12/FLAG155fd0cb7 [2022-11-16 12:47:03,715 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:47:03,716 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i [2022-11-16 12:47:03,729 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/data/0f69d788d/ef3f14cd4cc244f5b4c54770a6d7ea12/FLAG155fd0cb7 [2022-11-16 12:47:03,950 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/data/0f69d788d/ef3f14cd4cc244f5b4c54770a6d7ea12 [2022-11-16 12:47:03,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:47:03,954 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:47:03,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:47:03,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:47:03,967 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:47:03,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:47:03" (1/1) ... [2022-11-16 12:47:03,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b19ea71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:03, skipping insertion in model container [2022-11-16 12:47:03,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:47:03" (1/1) ... [2022-11-16 12:47:03,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:47:04,018 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:47:04,432 WARN L229 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_f07e6ff6-04d4-4c33-bef5-aff6616bde92/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i[22480,22493] [2022-11-16 12:47:04,439 WARN L229 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_f07e6ff6-04d4-4c33-bef5-aff6616bde92/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i[22552,22565] [2022-11-16 12:47:04,445 WARN L229 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_f07e6ff6-04d4-4c33-bef5-aff6616bde92/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i[22704,22717] [2022-11-16 12:47:04,448 WARN L229 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_f07e6ff6-04d4-4c33-bef5-aff6616bde92/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i[22778,22791] [2022-11-16 12:47:04,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:47:04,484 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:47:04,516 WARN L229 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_f07e6ff6-04d4-4c33-bef5-aff6616bde92/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i[22480,22493] [2022-11-16 12:47:04,517 WARN L229 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_f07e6ff6-04d4-4c33-bef5-aff6616bde92/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i[22552,22565] [2022-11-16 12:47:04,519 WARN L229 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_f07e6ff6-04d4-4c33-bef5-aff6616bde92/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i[22704,22717] [2022-11-16 12:47:04,531 WARN L229 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_f07e6ff6-04d4-4c33-bef5-aff6616bde92/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i[22778,22791] [2022-11-16 12:47:04,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:47:04,563 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:47:04,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:04 WrapperNode [2022-11-16 12:47:04,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:47:04,565 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:47:04,565 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:47:04,566 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:47:04,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:04" (1/1) ... [2022-11-16 12:47:04,589 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:04" (1/1) ... [2022-11-16 12:47:04,631 INFO L138 Inliner]: procedures = 122, calls = 32, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 115 [2022-11-16 12:47:04,632 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:47:04,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:47:04,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:47:04,633 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:47:04,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:04" (1/1) ... [2022-11-16 12:47:04,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:04" (1/1) ... [2022-11-16 12:47:04,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:04" (1/1) ... [2022-11-16 12:47:04,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:04" (1/1) ... [2022-11-16 12:47:04,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:04" (1/1) ... [2022-11-16 12:47:04,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:04" (1/1) ... [2022-11-16 12:47:04,667 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:04" (1/1) ... [2022-11-16 12:47:04,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:04" (1/1) ... [2022-11-16 12:47:04,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:47:04,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:47:04,674 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:47:04,674 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:47:04,675 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:04" (1/1) ... [2022-11-16 12:47:04,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:47:04,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:47:04,719 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:47:04,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:47:04,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-16 12:47:04,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:47:04,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:47:04,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 12:47:04,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 12:47:04,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:47:04,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 12:47:04,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 12:47:04,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:47:04,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:47:04,959 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:47:04,962 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:47:05,792 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:47:05,798 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:47:05,799 INFO L300 CfgBuilder]: Removed 11 assume(true) statements. [2022-11-16 12:47:05,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:47:05 BoogieIcfgContainer [2022-11-16 12:47:05,801 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:47:05,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:47:05,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:47:05,808 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:47:05,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:47:03" (1/3) ... [2022-11-16 12:47:05,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8155312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:47:05, skipping insertion in model container [2022-11-16 12:47:05,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:47:04" (2/3) ... [2022-11-16 12:47:05,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8155312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:47:05, skipping insertion in model container [2022-11-16 12:47:05,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:47:05" (3/3) ... [2022-11-16 12:47:05,812 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-1.i [2022-11-16 12:47:05,834 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:47:05,834 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-16 12:47:05,891 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:47:05,898 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;@3ab48cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:47:05,899 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-16 12:47:05,910 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 31 states have internal predecessors, (52), 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-16 12:47:05,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 12:47:05,917 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:05,918 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 12:47:05,918 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-16 12:47:05,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:05,926 INFO L85 PathProgramCache]: Analyzing trace with hash 889937798, now seen corresponding path program 1 times [2022-11-16 12:47:05,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:47:05,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967050244] [2022-11-16 12:47:05,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:05,943 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:47:05,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:47:05,951 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:47:05,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-16 12:47:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:06,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-16 12:47:06,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:47:06,128 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-16 12:47:06,128 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:47:06,129 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:47:06,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967050244] [2022-11-16 12:47:06,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967050244] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:06,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:06,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:47:06,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919585803] [2022-11-16 12:47:06,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:06,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:47:06,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:47:06,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:47:06,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:47:06,177 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 31 states have internal predecessors, (52), 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 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-16 12:47:06,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:06,195 INFO L93 Difference]: Finished difference Result 60 states and 97 transitions. [2022-11-16 12:47:06,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:47:06,197 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2022-11-16 12:47:06,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:06,203 INFO L225 Difference]: With dead ends: 60 [2022-11-16 12:47:06,204 INFO L226 Difference]: Without dead ends: 26 [2022-11-16 12:47:06,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 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-16 12:47:06,211 INFO L413 NwaCegarLoop]: 37 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, 37 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-16 12:47:06,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:47:06,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-16 12:47:06,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-16 12:47:06,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 25 states have internal predecessors, (29), 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-16 12:47:06,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-11-16 12:47:06,252 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 6 [2022-11-16 12:47:06,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:06,253 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-11-16 12:47:06,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-16 12:47:06,253 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-11-16 12:47:06,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 12:47:06,254 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:06,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 12:47:06,269 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-16 12:47:06,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:47:06,469 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-16 12:47:06,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:06,470 INFO L85 PathProgramCache]: Analyzing trace with hash 889639888, now seen corresponding path program 1 times [2022-11-16 12:47:06,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:47:06,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642998347] [2022-11-16 12:47:06,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:06,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:47:06,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:47:06,475 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:47:06,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-16 12:47:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:06,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 12:47:06,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:47:06,642 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-16 12:47:06,643 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:47:06,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:47:06,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642998347] [2022-11-16 12:47:06,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1642998347] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:06,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:06,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:47:06,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131121007] [2022-11-16 12:47:06,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:06,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:47:06,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:47:06,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:47:06,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:47:06,648 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-16 12:47:07,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:07,145 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-11-16 12:47:07,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:47:07,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2022-11-16 12:47:07,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:07,147 INFO L225 Difference]: With dead ends: 29 [2022-11-16 12:47:07,147 INFO L226 Difference]: Without dead ends: 27 [2022-11-16 12:47:07,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-16 12:47:07,149 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 39 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:07,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 27 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 12:47:07,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-16 12:47:07,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2022-11-16 12:47:07,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 23 states have internal predecessors, (27), 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-16 12:47:07,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-11-16 12:47:07,158 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 6 [2022-11-16 12:47:07,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:07,159 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-11-16 12:47:07,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-16 12:47:07,159 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-11-16 12:47:07,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 12:47:07,160 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:07,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:07,179 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-11-16 12:47:07,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:47:07,379 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-16 12:47:07,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:07,380 INFO L85 PathProgramCache]: Analyzing trace with hash -977335784, now seen corresponding path program 1 times [2022-11-16 12:47:07,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:47:07,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883094892] [2022-11-16 12:47:07,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:07,381 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:47:07,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:47:07,382 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:47:07,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-16 12:47:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:07,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 12:47:07,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:47:07,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-16 12:47:07,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 7 [2022-11-16 12:47:07,676 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-16 12:47:07,677 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:47:07,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:47:07,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883094892] [2022-11-16 12:47:07,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883094892] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:07,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:07,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:47:07,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199624290] [2022-11-16 12:47:07,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:07,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:47:07,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:47:07,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:47:07,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:47:07,680 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-16 12:47:08,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:08,632 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-11-16 12:47:08,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:47:08,633 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 9 [2022-11-16 12:47:08,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:08,634 INFO L225 Difference]: With dead ends: 48 [2022-11-16 12:47:08,634 INFO L226 Difference]: Without dead ends: 46 [2022-11-16 12:47:08,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:47:08,636 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 30 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:08,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 51 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-16 12:47:08,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-16 12:47:08,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 30. [2022-11-16 12:47:08,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 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-16 12:47:08,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-11-16 12:47:08,666 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 9 [2022-11-16 12:47:08,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:08,667 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-11-16 12:47:08,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-16 12:47:08,668 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-11-16 12:47:08,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 12:47:08,669 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:08,669 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:08,685 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-16 12:47:08,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:47:08,875 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-16 12:47:08,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:08,876 INFO L85 PathProgramCache]: Analyzing trace with hash -822388269, now seen corresponding path program 1 times [2022-11-16 12:47:08,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:47:08,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353525633] [2022-11-16 12:47:08,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:08,878 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:47:08,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:47:08,880 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:47:08,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-16 12:47:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:09,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-16 12:47:09,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:47:09,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-16 12:47:09,135 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 7 [2022-11-16 12:47:09,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:47:09,232 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 24 treesize of output 26 [2022-11-16 12:47:09,267 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:47:09,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 16 treesize of output 22 [2022-11-16 12:47:09,290 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 7 treesize of output 3 [2022-11-16 12:47:09,323 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:47:09,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:47:09,482 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-16 12:47:09,482 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2022-11-16 12:47:09,501 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 8 treesize of output 7 [2022-11-16 12:47:09,546 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 12:47:09,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-11-16 12:47:09,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:09,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:47:09,804 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:47:09,805 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 18 treesize of output 22 [2022-11-16 12:47:18,075 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-16 12:47:18,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 1 [2022-11-16 12:47:18,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:18,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:47:18,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353525633] [2022-11-16 12:47:18,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1353525633] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:47:18,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:47:18,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-11-16 12:47:18,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616889845] [2022-11-16 12:47:18,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:47:18,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:47:18,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:47:18,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:47:18,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=67, Unknown=14, NotChecked=0, Total=110 [2022-11-16 12:47:18,080 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 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-16 12:47:24,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:24,003 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2022-11-16 12:47:24,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:47:24,004 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 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 11 [2022-11-16 12:47:24,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:24,005 INFO L225 Difference]: With dead ends: 64 [2022-11-16 12:47:24,005 INFO L226 Difference]: Without dead ends: 62 [2022-11-16 12:47:24,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=64, Invalid=127, Unknown=19, NotChecked=0, Total=210 [2022-11-16 12:47:24,007 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 98 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:24,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 71 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 64 Invalid, 0 Unknown, 74 Unchecked, 1.5s Time] [2022-11-16 12:47:24,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-16 12:47:24,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 34. [2022-11-16 12:47:24,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 33 states have internal predecessors, (42), 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-16 12:47:24,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-11-16 12:47:24,022 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 11 [2022-11-16 12:47:24,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:24,022 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-11-16 12:47:24,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 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-16 12:47:24,023 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-11-16 12:47:24,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 12:47:24,023 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:24,024 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:24,047 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-16 12:47:24,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:47:24,239 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-16 12:47:24,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:24,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1674631615, now seen corresponding path program 1 times [2022-11-16 12:47:24,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:47:24,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614455489] [2022-11-16 12:47:24,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:24,241 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:47:24,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:47:24,243 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:47:24,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-16 12:47:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:24,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 12:47:24,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:47:24,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-16 12:47:24,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 7 [2022-11-16 12:47:24,450 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-16 12:47:24,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:47:24,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:47:24,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [614455489] [2022-11-16 12:47:24,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [614455489] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:47:24,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:47:24,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:47:24,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771249967] [2022-11-16 12:47:24,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:47:24,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:47:24,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:47:24,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:47:24,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:47:24,452 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-16 12:47:25,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:25,244 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-11-16 12:47:25,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:47:25,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2022-11-16 12:47:25,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:25,246 INFO L225 Difference]: With dead ends: 67 [2022-11-16 12:47:25,246 INFO L226 Difference]: Without dead ends: 55 [2022-11-16 12:47:25,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:47:25,247 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:25,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 71 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 12:47:25,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-16 12:47:25,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2022-11-16 12:47:25,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 41 states have internal predecessors, (50), 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-16 12:47:25,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-11-16 12:47:25,264 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 13 [2022-11-16 12:47:25,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:25,264 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-11-16 12:47:25,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-16 12:47:25,265 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-11-16 12:47:25,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 12:47:25,265 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:25,266 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:25,291 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-16 12:47:25,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:47:25,479 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-16 12:47:25,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:25,479 INFO L85 PathProgramCache]: Analyzing trace with hash 2053285582, now seen corresponding path program 2 times [2022-11-16 12:47:25,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:47:25,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [979180977] [2022-11-16 12:47:25,480 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:47:25,480 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:47:25,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:47:25,481 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:47:25,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-16 12:47:25,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:47:25,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:47:25,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-16 12:47:25,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:47:25,821 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 7 [2022-11-16 12:47:25,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-16 12:47:25,937 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 12:47:25,937 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 19 treesize of output 27 [2022-11-16 12:47:25,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:47:25,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-16 12:47:25,972 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:47:26,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:47:26,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:47:26,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-16 12:47:26,127 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-16 12:47:26,128 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 26 treesize of output 43 [2022-11-16 12:47:26,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:47:26,305 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:47:26,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 27 [2022-11-16 12:47:26,364 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-16 12:47:26,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-16 12:47:26,498 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-16 12:47:26,499 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2022-11-16 12:47:26,511 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 8 treesize of output 7 [2022-11-16 12:47:26,533 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 7 treesize of output 3 [2022-11-16 12:47:26,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-11-16 12:47:26,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:26,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:47:26,778 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:47:26,778 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 18 treesize of output 22 [2022-11-16 12:47:41,810 WARN L233 SmtUtils]: Spent 5.59s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:47:41,874 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-16 12:47:41,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 1 [2022-11-16 12:47:41,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:41,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:47:41,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [979180977] [2022-11-16 12:47:41,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [979180977] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:47:41,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:47:41,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-11-16 12:47:41,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680638376] [2022-11-16 12:47:41,881 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:47:41,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 12:47:41,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:47:41,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 12:47:41,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=130, Unknown=4, NotChecked=0, Total=182 [2022-11-16 12:47:41,884 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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-16 12:47:46,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:47:46,572 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2022-11-16 12:47:46,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:47:46,573 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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 13 [2022-11-16 12:47:46,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:47:46,575 INFO L225 Difference]: With dead ends: 56 [2022-11-16 12:47:46,575 INFO L226 Difference]: Without dead ends: 54 [2022-11-16 12:47:46,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=82, Invalid=186, Unknown=4, NotChecked=0, Total=272 [2022-11-16 12:47:46,577 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:47:46,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 107 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 29 Unchecked, 1.9s Time] [2022-11-16 12:47:46,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-16 12:47:46,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 44. [2022-11-16 12:47:46,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 43 states have internal predecessors, (54), 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-16 12:47:46,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2022-11-16 12:47:46,599 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 13 [2022-11-16 12:47:46,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:47:46,600 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2022-11-16 12:47:46,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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-16 12:47:46,601 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2022-11-16 12:47:46,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 12:47:46,602 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:47:46,602 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:47:46,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-16 12:47:46,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:47:46,819 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-16 12:47:46,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:47:46,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1848654704, now seen corresponding path program 1 times [2022-11-16 12:47:46,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:47:46,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049297574] [2022-11-16 12:47:46,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:47:46,820 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:47:46,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:47:46,821 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:47:46,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-16 12:47:47,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:47:47,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-16 12:47:47,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:47:47,094 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 7 [2022-11-16 12:47:47,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-16 12:47:47,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:47:47,161 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 24 treesize of output 26 [2022-11-16 12:47:47,190 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:47:47,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 16 treesize of output 22 [2022-11-16 12:47:47,206 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 7 treesize of output 3 [2022-11-16 12:47:47,243 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 12:47:47,243 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 19 treesize of output 27 [2022-11-16 12:47:47,295 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:47:47,379 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-16 12:47:47,380 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 31 [2022-11-16 12:47:47,392 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 7 treesize of output 3 [2022-11-16 12:47:47,418 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:47:47,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:47:47,527 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-16 12:47:47,527 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2022-11-16 12:47:47,543 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 8 treesize of output 7 [2022-11-16 12:47:47,560 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 12:47:47,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-11-16 12:47:47,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:47:47,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:47:47,784 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:47:47,785 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 18 treesize of output 22 [2022-11-16 12:47:47,803 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_44| (_ BitVec 32)) (v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_334) |v_ULTIMATE.start_main_~end~0#1.base_44| v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_8 (_ bv4 32)))))) is different from false [2022-11-16 12:47:47,835 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_331 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_44| (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_45| (_ BitVec 32)) (v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_45|) (_ bv0 1))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_331) |v_ULTIMATE.start_main_~end~0#1.base_45| v_ArrVal_334) |v_ULTIMATE.start_main_~end~0#1.base_44| v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_8 (_ bv4 32)))))) is different from false [2022-11-16 12:47:49,928 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_329 (_ BitVec 32)) (v_ArrVal_326 (_ BitVec 32)) (v_ArrVal_331 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_44| (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_45| (_ BitVec 32)) (v_arrayElimArr_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_327 (_ BitVec 1))) (or (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_329))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_326)) v_ArrVal_329 v_ArrVal_331) |v_ULTIMATE.start_main_~end~0#1.base_45| v_ArrVal_334) |v_ULTIMATE.start_main_~end~0#1.base_44| v_arrayElimArr_8) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= (_ bv0 1) (select (store |c_#valid| v_ArrVal_329 v_ArrVal_327) |v_ULTIMATE.start_main_~end~0#1.base_45|))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_8 (_ bv4 32)))))) is different from false [2022-11-16 12:47:49,955 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-16 12:47:49,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 1 [2022-11-16 12:47:49,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-16 12:47:49,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:47:49,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049297574] [2022-11-16 12:47:49,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049297574] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:47:49,957 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:47:49,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-11-16 12:47:49,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62413744] [2022-11-16 12:47:49,958 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:47:49,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 12:47:49,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:47:49,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 12:47:49,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=65, Unknown=3, NotChecked=54, Total=156 [2022-11-16 12:47:49,959 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 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-16 12:47:59,575 WARN L233 SmtUtils]: Spent 8.15s on a formula simplification. DAG size of input: 45 DAG size of output: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:48:00,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:48:00,600 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2022-11-16 12:48:00,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 12:48:00,601 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 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 13 [2022-11-16 12:48:00,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:48:00,602 INFO L225 Difference]: With dead ends: 87 [2022-11-16 12:48:00,602 INFO L226 Difference]: Without dead ends: 85 [2022-11-16 12:48:00,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=107, Invalid=207, Unknown=4, NotChecked=102, Total=420 [2022-11-16 12:48:00,604 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 71 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:48:00,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 102 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 115 Invalid, 0 Unknown, 174 Unchecked, 2.1s Time] [2022-11-16 12:48:00,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-16 12:48:00,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 45. [2022-11-16 12:48:00,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 44 states have internal predecessors, (56), 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-16 12:48:00,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2022-11-16 12:48:00,619 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 13 [2022-11-16 12:48:00,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:48:00,620 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-11-16 12:48:00,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 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-16 12:48:00,620 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-11-16 12:48:00,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 12:48:00,621 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:48:00,621 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:00,644 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-16 12:48:00,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:48:00,836 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-16 12:48:00,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:00,836 INFO L85 PathProgramCache]: Analyzing trace with hash -761736198, now seen corresponding path program 1 times [2022-11-16 12:48:00,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:48:00,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810825665] [2022-11-16 12:48:00,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:00,837 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:48:00,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:48:00,840 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:48:00,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-16 12:48:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:00,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:48:00,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:01,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 7 [2022-11-16 12:48:01,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:48:01,053 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:48:01,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:48:01,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810825665] [2022-11-16 12:48:01,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1810825665] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:01,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:48:01,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:48:01,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593434260] [2022-11-16 12:48:01,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:01,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:48:01,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:48:01,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:48:01,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:48:01,055 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-16 12:48:02,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:48:02,012 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2022-11-16 12:48:02,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:48:02,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-16 12:48:02,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:48:02,013 INFO L225 Difference]: With dead ends: 60 [2022-11-16 12:48:02,013 INFO L226 Difference]: Without dead ends: 48 [2022-11-16 12:48:02,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:48:02,015 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 3 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:48:02,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 53 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-16 12:48:02,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-16 12:48:02,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-11-16 12:48:02,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 37 states have internal predecessors, (48), 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-16 12:48:02,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2022-11-16 12:48:02,028 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 15 [2022-11-16 12:48:02,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:48:02,028 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2022-11-16 12:48:02,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-16 12:48:02,028 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-11-16 12:48:02,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 12:48:02,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:48:02,029 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:02,042 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-16 12:48:02,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:48:02,235 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-16 12:48:02,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:02,236 INFO L85 PathProgramCache]: Analyzing trace with hash -641247669, now seen corresponding path program 2 times [2022-11-16 12:48:02,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:48:02,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160814059] [2022-11-16 12:48:02,236 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:48:02,236 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:48:02,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:48:02,243 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:48:02,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-16 12:48:02,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:48:02,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:48:02,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-16 12:48:02,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:02,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-16 12:48:02,601 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 7 [2022-11-16 12:48:02,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:02,654 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 24 treesize of output 26 [2022-11-16 12:48:02,686 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:48:02,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 16 treesize of output 22 [2022-11-16 12:48:02,698 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 7 treesize of output 3 [2022-11-16 12:48:02,743 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 12:48:02,744 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 19 treesize of output 27 [2022-11-16 12:48:02,827 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:48:02,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:02,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:02,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-16 12:48:02,959 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-16 12:48:02,959 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 26 treesize of output 43 [2022-11-16 12:48:03,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:03,110 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:48:03,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 27 [2022-11-16 12:48:03,203 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-16 12:48:03,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2022-11-16 12:48:03,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:03,309 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:48:03,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 27 [2022-11-16 12:48:03,366 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-16 12:48:03,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-16 12:48:03,500 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-16 12:48:03,501 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2022-11-16 12:48:03,511 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 8 treesize of output 7 [2022-11-16 12:48:03,545 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 12:48:03,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-11-16 12:48:03,688 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:48:03,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:48:03,797 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:48:03,797 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 18 treesize of output 22 [2022-11-16 12:48:05,927 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_535 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_54| (_ BitVec 32)) (v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_55| (_ BitVec 32))) (or (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_11 (_ bv4 32)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_55|) (_ bv0 1))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_535) |v_ULTIMATE.start_main_~end~0#1.base_55| v_ArrVal_538) |v_ULTIMATE.start_main_~end~0#1.base_54| v_arrayElimArr_11) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))) is different from false [2022-11-16 12:48:06,111 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_533 (_ BitVec 1)) (v_ArrVal_538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_535 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_54| (_ BitVec 32)) (v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_55| (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_56| (_ BitVec 32))) (or (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_11 (_ bv4 32)))) (not (= (_ bv0 1) (select (store |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_56| v_ArrVal_533) |v_ULTIMATE.start_main_~end~0#1.base_55|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_56|))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_531) |v_ULTIMATE.start_main_~end~0#1.base_56| v_ArrVal_535) |v_ULTIMATE.start_main_~end~0#1.base_55| v_ArrVal_538) |v_ULTIMATE.start_main_~end~0#1.base_54| v_arrayElimArr_11) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))) is different from false [2022-11-16 12:48:08,196 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_533 (_ BitVec 1)) (|v_ULTIMATE.start_main_~end~0#1.base_57| (_ BitVec 32)) (v_ArrVal_538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_528 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_529 (_ BitVec 1)) (v_ArrVal_535 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_54| (_ BitVec 32)) (v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_55| (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_56| (_ BitVec 32))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_57| v_ArrVal_529))) (or (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_11 (_ bv4 32)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_57|) (_ bv0 1))) (not (= (select .cse0 |v_ULTIMATE.start_main_~end~0#1.base_56|) (_ bv0 1))) (not (= (select (store .cse0 |v_ULTIMATE.start_main_~end~0#1.base_56| v_ArrVal_533) |v_ULTIMATE.start_main_~end~0#1.base_55|) (_ bv0 1))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_528) |v_ULTIMATE.start_main_~end~0#1.base_57| v_ArrVal_531) |v_ULTIMATE.start_main_~end~0#1.base_56| v_ArrVal_535) |v_ULTIMATE.start_main_~end~0#1.base_55| v_ArrVal_538) |v_ULTIMATE.start_main_~end~0#1.base_54| v_arrayElimArr_11) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))))) is different from false [2022-11-16 12:48:10,396 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 (_ BitVec 1)) (v_ArrVal_538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_528 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_535 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_525 (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_58| (_ BitVec 32)) (v_ArrVal_529 (_ BitVec 1)) (|v_ULTIMATE.start_main_~end~0#1.base_54| (_ BitVec 32)) (v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_55| (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_56| (_ BitVec 32))) (let ((.cse1 (store |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_58| (_ bv1 1)))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~end~0#1.base_57| v_ArrVal_529))) (or (not (= (select (store .cse0 |v_ULTIMATE.start_main_~end~0#1.base_56| v_ArrVal_533) |v_ULTIMATE.start_main_~end~0#1.base_55|) (_ bv0 1))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_11 (_ bv4 32)))) (not (= (select .cse1 |v_ULTIMATE.start_main_~end~0#1.base_57|) (_ bv0 1))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_525)) |v_ULTIMATE.start_main_~end~0#1.base_58| v_ArrVal_528) |v_ULTIMATE.start_main_~end~0#1.base_57| v_ArrVal_531) |v_ULTIMATE.start_main_~end~0#1.base_56| v_ArrVal_535) |v_ULTIMATE.start_main_~end~0#1.base_55| v_ArrVal_538) |v_ULTIMATE.start_main_~end~0#1.base_54| v_arrayElimArr_11) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~end~0#1.base_56|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_58|) (_ bv0 1))))))) is different from false [2022-11-16 12:48:10,446 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-16 12:48:10,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 1 [2022-11-16 12:48:10,447 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-16 12:48:10,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:48:10,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160814059] [2022-11-16 12:48:10,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160814059] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:48:10,448 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:48:10,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2022-11-16 12:48:10,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733044704] [2022-11-16 12:48:10,449 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:48:10,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 12:48:10,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:48:10,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 12:48:10,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=89, Unknown=13, NotChecked=92, Total=240 [2022-11-16 12:48:10,450 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 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-16 12:48:17,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:48:17,845 INFO L93 Difference]: Finished difference Result 109 states and 141 transitions. [2022-11-16 12:48:17,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 12:48:17,845 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 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-16 12:48:17,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:48:17,847 INFO L225 Difference]: With dead ends: 109 [2022-11-16 12:48:17,847 INFO L226 Difference]: Without dead ends: 107 [2022-11-16 12:48:17,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=131, Invalid=287, Unknown=18, NotChecked=164, Total=600 [2022-11-16 12:48:17,848 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 56 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 318 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:48:17,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 125 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 121 Invalid, 0 Unknown, 318 Unchecked, 2.5s Time] [2022-11-16 12:48:17,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-16 12:48:17,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 44. [2022-11-16 12:48:17,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 43 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-16 12:48:17,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2022-11-16 12:48:17,863 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 60 transitions. Word has length 15 [2022-11-16 12:48:17,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:48:17,863 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 60 transitions. [2022-11-16 12:48:17,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 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-16 12:48:17,864 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2022-11-16 12:48:17,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 12:48:17,864 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:48:17,865 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:17,881 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-11-16 12:48:18,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:48:18,081 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-16 12:48:18,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:18,082 INFO L85 PathProgramCache]: Analyzing trace with hash -270590612, now seen corresponding path program 1 times [2022-11-16 12:48:18,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:48:18,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001239916] [2022-11-16 12:48:18,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:18,082 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:48:18,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:48:18,083 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:48:18,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-16 12:48:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:18,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 12:48:18,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:18,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 17 [2022-11-16 12:48:18,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-16 12:48:18,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-11-16 12:48:18,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-11-16 12:48:18,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:48:18,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:48:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:48:18,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:48:18,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001239916] [2022-11-16 12:48:18,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1001239916] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:48:18,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:48:18,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-11-16 12:48:18,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523355282] [2022-11-16 12:48:18,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:48:18,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:48:18,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:48:18,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:48:18,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:48:18,452 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-16 12:48:19,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:48:19,636 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2022-11-16 12:48:19,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:48:19,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-16 12:48:19,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:48:19,637 INFO L225 Difference]: With dead ends: 66 [2022-11-16 12:48:19,638 INFO L226 Difference]: Without dead ends: 44 [2022-11-16 12:48:19,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:48:19,639 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:48:19,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 65 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-16 12:48:19,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-16 12:48:19,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-16 12:48:19,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 43 states have internal predecessors, (59), 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-16 12:48:19,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2022-11-16 12:48:19,654 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 59 transitions. Word has length 16 [2022-11-16 12:48:19,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:48:19,655 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 59 transitions. [2022-11-16 12:48:19,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-16 12:48:19,655 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2022-11-16 12:48:19,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 12:48:19,656 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:48:19,656 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:19,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-16 12:48:19,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:48:19,871 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-16 12:48:19,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:19,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1233539642, now seen corresponding path program 3 times [2022-11-16 12:48:19,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:48:19,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334061318] [2022-11-16 12:48:19,872 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:48:19,873 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:48:19,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:48:19,873 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:48:19,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-16 12:48:20,477 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-16 12:48:20,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:48:20,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-16 12:48:20,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:20,510 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 7 [2022-11-16 12:48:20,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-16 12:48:20,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:20,558 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 24 treesize of output 26 [2022-11-16 12:48:20,584 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:48:20,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 16 treesize of output 22 [2022-11-16 12:48:20,597 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 7 treesize of output 3 [2022-11-16 12:48:20,630 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 12:48:20,631 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 19 treesize of output 27 [2022-11-16 12:48:20,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:20,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:20,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-16 12:48:20,757 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-16 12:48:20,758 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 26 treesize of output 43 [2022-11-16 12:48:20,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:20,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:20,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-11-16 12:48:20,958 INFO L321 Elim1Store]: treesize reduction 66, result has 34.0 percent of original size [2022-11-16 12:48:20,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 59 [2022-11-16 12:48:21,146 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:48:21,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:21,245 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:48:21,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 27 [2022-11-16 12:48:21,374 INFO L321 Elim1Store]: treesize reduction 66, result has 34.0 percent of original size [2022-11-16 12:48:21,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 59 [2022-11-16 12:48:21,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:21,560 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:48:21,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 27 [2022-11-16 12:48:21,689 INFO L321 Elim1Store]: treesize reduction 66, result has 34.0 percent of original size [2022-11-16 12:48:21,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 59 [2022-11-16 12:48:21,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:21,867 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:48:21,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 27 [2022-11-16 12:48:21,960 INFO L321 Elim1Store]: treesize reduction 18, result has 41.9 percent of original size [2022-11-16 12:48:21,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 31 [2022-11-16 12:48:22,073 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-16 12:48:22,074 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2022-11-16 12:48:22,083 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 8 treesize of output 7 [2022-11-16 12:48:22,103 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 7 treesize of output 3 [2022-11-16 12:48:22,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-11-16 12:48:22,227 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:48:22,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:48:22,342 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:48:22,342 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 18 treesize of output 22 [2022-11-16 12:48:22,360 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~end~0#1.base_73| (_ BitVec 32)) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_756 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_14 (_ bv4 32)))) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_756) |v_ULTIMATE.start_main_~end~0#1.base_73| v_arrayElimArr_14) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))) is different from false [2022-11-16 12:48:22,415 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_752 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_73| (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_74| (_ BitVec 32)) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_756 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_752) |v_ULTIMATE.start_main_~end~0#1.base_74| v_ArrVal_756) |v_ULTIMATE.start_main_~end~0#1.base_73| v_arrayElimArr_14) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_14 (_ bv4 32)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_74|))))) is different from false [2022-11-16 12:48:24,461 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_751 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_750 (_ BitVec 1)) (v_ArrVal_752 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_73| (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_74| (_ BitVec 32)) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_75| (_ BitVec 32)) (v_ArrVal_756 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_751) |v_ULTIMATE.start_main_~end~0#1.base_75| v_ArrVal_752) |v_ULTIMATE.start_main_~end~0#1.base_74| v_ArrVal_756) |v_ULTIMATE.start_main_~end~0#1.base_73| v_arrayElimArr_14) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_75| v_ArrVal_750) |v_ULTIMATE.start_main_~end~0#1.base_74|) (_ bv0 1))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_14 (_ bv4 32)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_75|))))) is different from false [2022-11-16 12:48:26,525 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_751 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_750 (_ BitVec 1)) (v_ArrVal_752 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_73| (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_74| (_ BitVec 32)) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_747 (_ BitVec 1)) (|v_ULTIMATE.start_main_~end~0#1.base_75| (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_76| (_ BitVec 32)) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_756 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_76| v_ArrVal_747))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_76|) (_ bv0 1))) (not (= (_ bv0 1) (select (store .cse0 |v_ULTIMATE.start_main_~end~0#1.base_75| v_ArrVal_750) |v_ULTIMATE.start_main_~end~0#1.base_74|))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_14 (_ bv4 32)))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_745) |v_ULTIMATE.start_main_~end~0#1.base_76| v_ArrVal_751) |v_ULTIMATE.start_main_~end~0#1.base_75| v_ArrVal_752) |v_ULTIMATE.start_main_~end~0#1.base_74| v_ArrVal_756) |v_ULTIMATE.start_main_~end~0#1.base_73| v_arrayElimArr_14) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~end~0#1.base_75|)))))) is different from false [2022-11-16 12:48:28,660 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_750 (_ BitVec 1)) (|v_ULTIMATE.start_main_~end~0#1.base_73| (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_74| (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 1)) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_756 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_751 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_752 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_742 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_747 (_ BitVec 1)) (|v_ULTIMATE.start_main_~end~0#1.base_75| (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_76| (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_77| (_ BitVec 32))) (let ((.cse1 (store |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_77| v_ArrVal_741))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~end~0#1.base_76| v_ArrVal_747))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_77|) (_ bv0 1))) (not (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~end~0#1.base_75|))) (not (= (_ bv0 1) (select (store .cse0 |v_ULTIMATE.start_main_~end~0#1.base_75| v_ArrVal_750) |v_ULTIMATE.start_main_~end~0#1.base_74|))) (= (select (select (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_742) |v_ULTIMATE.start_main_~end~0#1.base_77| v_ArrVal_745) |v_ULTIMATE.start_main_~end~0#1.base_76| v_ArrVal_751) |v_ULTIMATE.start_main_~end~0#1.base_75| v_ArrVal_752) |v_ULTIMATE.start_main_~end~0#1.base_74| v_ArrVal_756) |v_ULTIMATE.start_main_~end~0#1.base_73| v_arrayElimArr_14) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) ~unnamed1~0~BLACK) (not (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_main_~end~0#1.base_76|))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_14 (_ bv4 32)))))))) is different from false [2022-11-16 12:48:30,775 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_750 (_ BitVec 1)) (|v_ULTIMATE.start_main_~end~0#1.base_73| (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_74| (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 1)) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_756 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_740 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_751 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_752 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_742 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_747 (_ BitVec 1)) (|v_ULTIMATE.start_main_~end~0#1.base_75| (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_76| (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_77| (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_78| (_ BitVec 32))) (let ((.cse2 (store |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_78| (_ bv1 1)))) (let ((.cse1 (store .cse2 |v_ULTIMATE.start_main_~end~0#1.base_77| v_ArrVal_741))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~end~0#1.base_76| v_ArrVal_747))) (or (not (= (_ bv0 1) (select (store .cse0 |v_ULTIMATE.start_main_~end~0#1.base_75| v_ArrVal_750) |v_ULTIMATE.start_main_~end~0#1.base_74|))) (not (= (select .cse0 |v_ULTIMATE.start_main_~end~0#1.base_75|) (_ bv0 1))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_740) |v_ULTIMATE.start_main_~end~0#1.base_78| v_ArrVal_742) |v_ULTIMATE.start_main_~end~0#1.base_77| v_ArrVal_745) |v_ULTIMATE.start_main_~end~0#1.base_76| v_ArrVal_751) |v_ULTIMATE.start_main_~end~0#1.base_75| v_ArrVal_752) |v_ULTIMATE.start_main_~end~0#1.base_74| v_ArrVal_756) |v_ULTIMATE.start_main_~end~0#1.base_73| v_arrayElimArr_14) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_main_~end~0#1.base_76|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_78|) (_ bv0 1))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_14 (_ bv4 32)))) (not (= (_ bv0 1) (select .cse2 |v_ULTIMATE.start_main_~end~0#1.base_77|)))))))) is different from false [2022-11-16 12:48:32,985 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_750 (_ BitVec 1)) (|v_ULTIMATE.start_main_~end~0#1.base_73| (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_74| (_ BitVec 32)) (v_ArrVal_741 (_ BitVec 1)) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_756 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_740 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_751 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_752 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_735 (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_79| (_ BitVec 32)) (v_arrayElimArr_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_747 (_ BitVec 1)) (|v_ULTIMATE.start_main_~end~0#1.base_75| (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_76| (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_77| (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_78| (_ BitVec 32))) (let ((.cse2 (store |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_79| (_ bv1 1)))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~end~0#1.base_78| (_ bv1 1)))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_main_~end~0#1.base_77| v_ArrVal_741))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~end~0#1.base_76| v_ArrVal_747))) (or (not (= (_ bv0 1) (select (store .cse0 |v_ULTIMATE.start_main_~end~0#1.base_75| v_ArrVal_750) |v_ULTIMATE.start_main_~end~0#1.base_74|))) (not (= (select .cse0 |v_ULTIMATE.start_main_~end~0#1.base_75|) (_ bv0 1))) (not (= (select .cse1 |v_ULTIMATE.start_main_~end~0#1.base_76|) (_ bv0 1))) (not (= (select .cse2 |v_ULTIMATE.start_main_~end~0#1.base_78|) (_ bv0 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_79|))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_14 (_ bv4 32)))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_735)) |v_ULTIMATE.start_main_~end~0#1.base_79| v_ArrVal_740) |v_ULTIMATE.start_main_~end~0#1.base_78| v_ArrVal_742) |v_ULTIMATE.start_main_~end~0#1.base_77| v_ArrVal_745) |v_ULTIMATE.start_main_~end~0#1.base_76| v_ArrVal_751) |v_ULTIMATE.start_main_~end~0#1.base_75| v_ArrVal_752) |v_ULTIMATE.start_main_~end~0#1.base_74| v_ArrVal_756) |v_ULTIMATE.start_main_~end~0#1.base_73| v_arrayElimArr_14) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= (_ bv0 1) (select .cse3 |v_ULTIMATE.start_main_~end~0#1.base_77|))))))))) is different from false [2022-11-16 12:48:33,053 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-16 12:48:33,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 1 [2022-11-16 12:48:33,054 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-11-16 12:48:33,054 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:48:33,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334061318] [2022-11-16 12:48:33,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1334061318] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:48:33,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:48:33,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 19 [2022-11-16 12:48:33,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820228488] [2022-11-16 12:48:33,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:48:33,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-16 12:48:33,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:48:33,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-16 12:48:33,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=100, Unknown=7, NotChecked=182, Total=342 [2022-11-16 12:48:33,057 INFO L87 Difference]: Start difference. First operand 44 states and 59 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 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-16 12:48:36,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:48:36,450 INFO L93 Difference]: Finished difference Result 73 states and 97 transitions. [2022-11-16 12:48:36,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:48:36,451 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 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-16 12:48:36,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:48:36,452 INFO L225 Difference]: With dead ends: 73 [2022-11-16 12:48:36,452 INFO L226 Difference]: Without dead ends: 71 [2022-11-16 12:48:36,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=75, Invalid=156, Unknown=7, NotChecked=224, Total=462 [2022-11-16 12:48:36,453 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 13 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 217 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:48:36,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 154 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 94 Invalid, 0 Unknown, 217 Unchecked, 3.0s Time] [2022-11-16 12:48:36,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-16 12:48:36,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 42. [2022-11-16 12:48:36,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 39 states have (on average 1.4102564102564104) 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-16 12:48:36,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2022-11-16 12:48:36,469 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 17 [2022-11-16 12:48:36,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:48:36,469 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2022-11-16 12:48:36,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 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-16 12:48:36,470 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2022-11-16 12:48:36,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 12:48:36,470 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:48:36,471 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:36,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-16 12:48:36,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:48:36,671 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-16 12:48:36,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:36,672 INFO L85 PathProgramCache]: Analyzing trace with hash 35743046, now seen corresponding path program 4 times [2022-11-16 12:48:36,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:48:36,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192004474] [2022-11-16 12:48:36,673 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 12:48:36,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:48:36,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:48:36,674 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:48:36,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-16 12:48:37,269 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 12:48:37,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:48:37,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-16 12:48:37,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:48:37,309 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 7 [2022-11-16 12:48:37,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2022-11-16 12:48:37,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:48:37,357 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 24 treesize of output 26 [2022-11-16 12:48:37,387 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:48:37,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 16 treesize of output 22 [2022-11-16 12:48:37,396 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 7 treesize of output 3 [2022-11-16 12:48:37,438 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 12:48:37,438 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 19 treesize of output 27 [2022-11-16 12:48:37,481 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:48:37,567 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-16 12:48:37,567 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 31 [2022-11-16 12:48:37,581 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 7 treesize of output 3 [2022-11-16 12:48:37,615 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 12:48:37,616 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 19 treesize of output 27 [2022-11-16 12:48:37,665 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 12:48:37,665 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 19 treesize of output 27 [2022-11-16 12:48:37,713 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:48:37,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 27 [2022-11-16 12:48:37,764 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 12:48:37,765 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 19 treesize of output 27 [2022-11-16 12:48:37,813 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:48:37,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 27 [2022-11-16 12:48:37,889 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-16 12:48:37,889 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 31 [2022-11-16 12:48:37,902 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 7 treesize of output 3 [2022-11-16 12:48:37,937 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 12:48:37,937 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 19 treesize of output 27 [2022-11-16 12:48:38,027 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-16 12:48:38,027 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 31 [2022-11-16 12:48:38,036 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 7 treesize of output 3 [2022-11-16 12:48:38,061 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:48:38,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:48:38,162 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-11-16 12:48:38,163 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2022-11-16 12:48:38,172 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 8 treesize of output 7 [2022-11-16 12:48:38,188 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 12:48:38,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-11-16 12:48:38,316 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 12:48:38,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:48:38,409 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:48:38,409 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 18 treesize of output 22 [2022-11-16 12:48:38,425 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_954 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_89| (_ BitVec 32))) (or (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_954) |v_ULTIMATE.start_main_~end~0#1.base_89| v_arrayElimArr_17) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_17 (_ bv4 32)))))) is different from false [2022-11-16 12:48:40,456 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_90| (_ BitVec 32)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_954 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_89| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_90|) (_ bv0 1))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_17 (_ bv4 32)))) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_951) |v_ULTIMATE.start_main_~end~0#1.base_90| v_ArrVal_954) |v_ULTIMATE.start_main_~end~0#1.base_89| v_arrayElimArr_17) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))) is different from false [2022-11-16 12:48:40,502 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_90| (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_91| (_ BitVec 32)) (v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_947 (_ BitVec 1)) (v_ArrVal_954 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~end~0#1.base_89| (_ BitVec 32))) (or (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_17 (_ bv4 32)))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_948) |v_ULTIMATE.start_main_~end~0#1.base_91| v_ArrVal_951) |v_ULTIMATE.start_main_~end~0#1.base_90| v_ArrVal_954) |v_ULTIMATE.start_main_~end~0#1.base_89| v_arrayElimArr_17) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_91| v_ArrVal_947) |v_ULTIMATE.start_main_~end~0#1.base_90|) (_ bv0 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_91|) (_ bv0 1))))) is different from false [2022-11-16 12:48:45,527 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~end~0#1.base_93| (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_90| (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_91| (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_92| (_ BitVec 32)) (v_ArrVal_945 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_941 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_954 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_951 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_946 (_ BitVec 1)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_947 (_ BitVec 1)) (v_ArrVal_942 (_ BitVec 1)) (|v_ULTIMATE.start_main_~end~0#1.base_89| (_ BitVec 32))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_93| v_ArrVal_942))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~end~0#1.base_92| v_ArrVal_946))) (or (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_17 (_ bv4 32)))) (not (= (select .cse0 |v_ULTIMATE.start_main_~end~0#1.base_92|) (_ bv0 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_93|))) (not (= (select (store .cse1 |v_ULTIMATE.start_main_~end~0#1.base_91| v_ArrVal_947) |v_ULTIMATE.start_main_~end~0#1.base_90|) (_ bv0 1))) (not (= (select .cse1 |v_ULTIMATE.start_main_~end~0#1.base_91|) (_ bv0 1))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_941) |v_ULTIMATE.start_main_~end~0#1.base_93| v_ArrVal_945) |v_ULTIMATE.start_main_~end~0#1.base_92| v_ArrVal_948) |v_ULTIMATE.start_main_~end~0#1.base_91| v_ArrVal_951) |v_ULTIMATE.start_main_~end~0#1.base_90| v_ArrVal_954) |v_ULTIMATE.start_main_~end~0#1.base_89| v_arrayElimArr_17) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) is different from false [2022-11-16 12:48:45,641 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~end~0#1.base_93| (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_94| (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_90| (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_91| (_ BitVec 32)) (|v_ULTIMATE.start_main_~end~0#1.base_92| (_ BitVec 32)) (v_ArrVal_945 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_948 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_941 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_954 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_951 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_939 (_ BitVec 1)) (v_ArrVal_946 (_ BitVec 1)) (v_arrayElimArr_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_947 (_ BitVec 1)) (v_ArrVal_942 (_ BitVec 1)) (|v_ULTIMATE.start_main_~end~0#1.base_89| (_ BitVec 32))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_94| v_ArrVal_939))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_main_~end~0#1.base_93| v_ArrVal_942))) (let ((.cse1 (store .cse2 |v_ULTIMATE.start_main_~end~0#1.base_92| v_ArrVal_946))) (or (not (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~end~0#1.base_93|))) (not (= ~unnamed1~0~BLACK (select v_arrayElimArr_17 (_ bv4 32)))) (not (= (select (store .cse1 |v_ULTIMATE.start_main_~end~0#1.base_91| v_ArrVal_947) |v_ULTIMATE.start_main_~end~0#1.base_90|) (_ bv0 1))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_937) |v_ULTIMATE.start_main_~end~0#1.base_94| v_ArrVal_941) |v_ULTIMATE.start_main_~end~0#1.base_93| v_ArrVal_945) |v_ULTIMATE.start_main_~end~0#1.base_92| v_ArrVal_948) |v_ULTIMATE.start_main_~end~0#1.base_91| v_ArrVal_951) |v_ULTIMATE.start_main_~end~0#1.base_90| v_ArrVal_954) |v_ULTIMATE.start_main_~end~0#1.base_89| v_arrayElimArr_17) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_main_~end~0#1.base_91|))) (not (= (select .cse2 |v_ULTIMATE.start_main_~end~0#1.base_92|) (_ bv0 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~end~0#1.base_94|)))))))) is different from false [2022-11-16 12:48:51,971 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-16 12:48:51,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 1 [2022-11-16 12:48:51,973 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 13 not checked. [2022-11-16 12:48:51,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:48:51,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [192004474] [2022-11-16 12:48:51,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [192004474] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:48:51,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:48:51,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 17 [2022-11-16 12:48:51,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103455463] [2022-11-16 12:48:51,974 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:48:51,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-16 12:48:51,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:48:51,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-16 12:48:51,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=20, NotChecked=120, Total=272 [2022-11-16 12:48:51,975 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 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-16 12:49:01,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:49:01,409 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2022-11-16 12:49:01,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:49:01,410 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 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-16 12:49:01,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:49:01,410 INFO L225 Difference]: With dead ends: 48 [2022-11-16 12:49:01,410 INFO L226 Difference]: Without dead ends: 46 [2022-11-16 12:49:01,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=81, Invalid=155, Unknown=24, NotChecked=160, Total=420 [2022-11-16 12:49:01,412 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 65 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 180 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:49:01,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 53 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 53 Invalid, 0 Unknown, 180 Unchecked, 1.0s Time] [2022-11-16 12:49:01,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-16 12:49:01,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 25. [2022-11-16 12:49:01,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 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-16 12:49:01,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-11-16 12:49:01,424 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2022-11-16 12:49:01,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:49:01,424 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-11-16 12:49:01,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 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-16 12:49:01,425 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-11-16 12:49:01,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 12:49:01,425 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:49:01,425 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:49:01,445 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-16 12:49:01,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:49:01,645 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-16 12:49:01,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:49:01,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1451772591, now seen corresponding path program 1 times [2022-11-16 12:49:01,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:49:01,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [168331885] [2022-11-16 12:49:01,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:49:01,646 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:49:01,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:49:01,648 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:49:01,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-16 12:49:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:49:01,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-16 12:49:01,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:49:01,918 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 7 [2022-11-16 12:49:01,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-16 12:49:01,973 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:49:01,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 14 treesize of output 20 [2022-11-16 12:49:01,985 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 5 treesize of output 3 [2022-11-16 12:49:02,018 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 12:49:02,019 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 19 treesize of output 27 [2022-11-16 12:49:02,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-16 12:49:02,045 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:49:02,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:49:02,180 INFO L321 Elim1Store]: treesize reduction 31, result has 31.1 percent of original size [2022-11-16 12:49:02,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 50 [2022-11-16 12:49:02,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:49:02,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:49:02,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-11-16 12:49:02,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-16 12:49:02,250 INFO L321 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2022-11-16 12:49:02,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 42 [2022-11-16 12:49:02,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-11-16 12:49:02,675 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 12:49:02,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 23 [2022-11-16 12:49:02,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:49:02,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:49:02,892 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:49:02,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2022-11-16 12:49:02,927 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1032 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1033 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1027 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= (select |c_#valid| .cse0) (_ bv0 1))) (= .cse0 (_ bv0 32)) (not (= (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_21) .cse0 v_ArrVal_1032))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1033) .cse0 v_ArrVal_1027) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (_ bv0 32)))))) is different from false [2022-11-16 12:49:02,956 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:49:02,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 64 treesize of output 65 [2022-11-16 12:49:02,973 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:49:02,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 56 treesize of output 49 [2022-11-16 12:49:03,364 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:49:03,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 3444 treesize of output 2309 [2022-11-16 12:49:03,532 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:49:03,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3767 treesize of output 3678 [2022-11-16 12:49:03,684 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 3663 treesize of output 3567 [2022-11-16 12:49:03,770 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 3567 treesize of output 3519 [2022-11-16 12:49:04,078 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:49:04,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3081 treesize of output 2945 [2022-11-16 12:49:04,584 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:49:04,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 3375 treesize of output 2923 [2022-11-16 12:55:53,441 WARN L233 SmtUtils]: Spent 12.19s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:55:53,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:55:53,449 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:55:53,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [168331885] [2022-11-16 12:55:53,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [168331885] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:55:53,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:55:53,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-11-16 12:55:53,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679509236] [2022-11-16 12:55:53,450 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:55:53,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-16 12:55:53,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:55:53,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-16 12:55:53,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=106, Unknown=3, NotChecked=20, Total=156 [2022-11-16 12:55:53,451 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 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-16 12:55:58,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:55:58,336 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2022-11-16 12:55:58,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:55:58,337 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 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 18 [2022-11-16 12:55:58,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:55:58,337 INFO L225 Difference]: With dead ends: 62 [2022-11-16 12:55:58,337 INFO L226 Difference]: Without dead ends: 60 [2022-11-16 12:55:58,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=58, Invalid=249, Unknown=3, NotChecked=32, Total=342 [2022-11-16 12:55:58,339 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 39 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:55:58,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 161 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 173 Invalid, 0 Unknown, 73 Unchecked, 4.5s Time] [2022-11-16 12:55:58,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-16 12:55:58,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 39. [2022-11-16 12:55:58,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 38 states have internal predecessors, (45), 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-16 12:55:58,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-11-16 12:55:58,356 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 18 [2022-11-16 12:55:58,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:55:58,358 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-11-16 12:55:58,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 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-16 12:55:58,358 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-11-16 12:55:58,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 12:55:58,361 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:55:58,361 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:55:58,386 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-16 12:55:58,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:55:58,586 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-16 12:55:58,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:55:58,587 INFO L85 PathProgramCache]: Analyzing trace with hash -171908913, now seen corresponding path program 1 times [2022-11-16 12:55:58,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:55:58,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746238114] [2022-11-16 12:55:58,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:55:58,587 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:55:58,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:55:58,589 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:55:58,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-16 12:55:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:55:58,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-16 12:55:58,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:55:58,773 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 7 [2022-11-16 12:55:58,811 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:55:58,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:55:58,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-16 12:55:58,827 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:55:58,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-16 12:55:58,847 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:55:58,913 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:55:58,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 45 [2022-11-16 12:55:58,920 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-16 12:55:58,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-16 12:55:59,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-11-16 12:55:59,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 15 [2022-11-16 12:55:59,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-11-16 12:55:59,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:55:59,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:55:59,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 74 treesize of output 54 [2022-11-16 12:55:59,538 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:55:59,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 37 treesize of output 38 [2022-11-16 12:55:59,549 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:55:59,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 41 treesize of output 42 [2022-11-16 12:55:59,569 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:55:59,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 47 [2022-11-16 12:55:59,597 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:55:59,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 53 [2022-11-16 12:55:59,604 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 37 treesize of output 35 [2022-11-16 12:55:59,618 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 35 treesize of output 33 [2022-11-16 12:55:59,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:55:59,775 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:55:59,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746238114] [2022-11-16 12:55:59,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1746238114] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:55:59,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:55:59,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-11-16 12:55:59,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157581623] [2022-11-16 12:55:59,776 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:55:59,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 12:55:59,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:55:59,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 12:55:59,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=146, Unknown=5, NotChecked=0, Total=182 [2022-11-16 12:55:59,777 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 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-16 12:56:02,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:56:02,356 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2022-11-16 12:56:02,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:56:02,357 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 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 18 [2022-11-16 12:56:02,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:56:02,358 INFO L225 Difference]: With dead ends: 78 [2022-11-16 12:56:02,358 INFO L226 Difference]: Without dead ends: 66 [2022-11-16 12:56:02,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=67, Invalid=270, Unknown=5, NotChecked=0, Total=342 [2022-11-16 12:56:02,359 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 55 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:56:02,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 230 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 241 Invalid, 0 Unknown, 55 Unchecked, 2.3s Time] [2022-11-16 12:56:02,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-16 12:56:02,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 49. [2022-11-16 12:56:02,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 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-16 12:56:02,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2022-11-16 12:56:02,382 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 18 [2022-11-16 12:56:02,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:56:02,382 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2022-11-16 12:56:02,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 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-16 12:56:02,383 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-11-16 12:56:02,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 12:56:02,383 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:56:02,384 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:56:02,397 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-16 12:56:02,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:56:02,597 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-11-16 12:56:02,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:56:02,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1598679030, now seen corresponding path program 2 times [2022-11-16 12:56:02,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:56:02,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875763906] [2022-11-16 12:56:02,598 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:56:02,598 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:56:02,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:56:02,599 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:56:02,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f07e6ff6-04d4-4c33-bef5-aff6616bde92/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-16 12:56:02,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:56:02,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:56:02,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-16 12:56:02,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:56:02,984 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 7 [2022-11-16 12:56:03,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-16 12:56:03,036 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:56:03,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 14 treesize of output 20 [2022-11-16 12:56:03,044 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 5 treesize of output 3 [2022-11-16 12:56:03,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 14 treesize of output 14 [2022-11-16 12:56:03,081 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 12:56:03,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 14 treesize of output 20 [2022-11-16 12:56:03,089 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 5 treesize of output 3 [2022-11-16 12:56:03,129 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 12:56:03,130 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 19 treesize of output 27 [2022-11-16 12:56:03,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:56:03,244 INFO L321 Elim1Store]: treesize reduction 31, result has 31.1 percent of original size [2022-11-16 12:56:03,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 50 [2022-11-16 12:56:03,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-16 12:56:03,314 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2022-11-16 12:56:03,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 51 [2022-11-16 12:56:03,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-11-16 12:56:03,492 INFO L321 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2022-11-16 12:56:03,493 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 67 [2022-11-16 12:56:03,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:56:03,574 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-11-16 12:56:03,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 103 treesize of output 87 [2022-11-16 12:56:03,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-11-16 12:56:03,702 INFO L321 Elim1Store]: treesize reduction 36, result has 49.3 percent of original size [2022-11-16 12:56:03,702 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 2 case distinctions, treesize of input 29 treesize of output 50 [2022-11-16 12:56:03,737 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 5 treesize of output 3 [2022-11-16 12:56:03,763 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 5 treesize of output 3 [2022-11-16 12:56:03,787 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 5 treesize of output 3 [2022-11-16 12:56:03,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:56:03,925 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2022-11-16 12:56:03,925 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 30 treesize of output 51 [2022-11-16 12:56:04,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2022-11-16 12:56:04,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:56:04,372 INFO L321 Elim1Store]: treesize reduction 82, result has 39.3 percent of original size [2022-11-16 12:56:04,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 103 [2022-11-16 12:56:04,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:56:04,540 INFO L321 Elim1Store]: treesize reduction 99, result has 23.8 percent of original size [2022-11-16 12:56:04,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 142 treesize of output 125 [2022-11-16 12:56:04,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:56:04,644 INFO L321 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2022-11-16 12:56:04,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 30 [2022-11-16 12:56:04,667 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 0 case distinctions, treesize of input 14 treesize of output 17 [2022-11-16 12:56:04,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-16 12:56:04,768 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 5 treesize of output 3 [2022-11-16 12:56:05,194 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 45 treesize of output 35 [2022-11-16 12:56:05,250 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 49 treesize of output 39 [2022-11-16 12:56:05,296 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 49 treesize of output 39 [2022-11-16 12:56:06,656 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:56:06,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 4 case distinctions, treesize of input 240 treesize of output 284 [2022-11-16 12:56:10,467 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:56:10,596 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:56:10,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 328 treesize of output 430 [2022-11-16 12:56:51,877 WARN L233 SmtUtils]: Spent 19.51s on a formula simplification. DAG size of input: 314 DAG size of output: 58 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:56:54,924 INFO L321 Elim1Store]: treesize reduction 72, result has 83.2 percent of original size [2022-11-16 12:56:54,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 16 new quantified variables, introduced 45 case distinctions, treesize of input 205 treesize of output 431 [2022-11-16 12:57:35,516 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:57:35,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:57:35,936 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:57:35,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 85 [2022-11-16 12:57:35,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 117 treesize of output 84 [2022-11-16 12:57:35,990 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:57:35,990 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 128 treesize of output 125 [2022-11-16 12:57:53,009 WARN L233 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:57:53,317 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:57:53,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 270 treesize of output 262 [2022-11-16 12:57:53,728 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:57:53,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 279 treesize of output 297 [2022-11-16 12:57:54,255 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:57:54,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 270 treesize of output 282 [2022-11-16 12:57:54,920 INFO L217 Elim1Store]: Index analysis took 106 ms [2022-11-16 12:57:54,971 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 12:57:54,971 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 1 case distinctions, treesize of input 14 treesize of output 1 [2022-11-16 12:57:56,515 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 12:57:56,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 4 [2022-11-16 12:57:58,456 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1198 (_ BitVec 1)) (v_subst_2 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_subst_1 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (v_ArrVal_1203 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_20 (_ BitVec 1)) (v_arrayElimArr_39 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_19 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select v_arrayElimArr_39 v_subst_1)) (.cse2 (select v_prenex_18 (_ bv0 32))) (.cse3 (select v_arrayElimArr_36 |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse0 (store |c_#valid| .cse3 v_ArrVal_1198)) (.cse5 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1203) .cse3 v_arrayElimArr_37) .cse1 v_prenex_19) .cse2 v_prenex_16) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (not (= (select (store .cse0 .cse1 v_prenex_20) .cse2) (_ bv0 1))) (= .cse3 (_ bv0 32)) (not (= v_DerPreprocessor_1 (select (store (store v_arrayElimArr_39 v_subst_1 v_DerPreprocessor_1) v_subst_2 v_DerPreprocessor_2) v_subst_1))) (= .cse2 (_ bv0 32)) (not (= (_ bv0 32) (select (let ((.cse4 (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_36) .cse3 v_arrayElimArr_39) .cse1 v_prenex_18) .cse2 v_prenex_17))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) .cse5))) (not (= (select v_prenex_19 (_ bv0 32)) (_ bv0 32))) (not (= (_ bv0 1) (select .cse0 .cse1))) (not (= v_DerPreprocessor_3 (select (store (store v_arrayElimArr_37 v_subst_1 v_DerPreprocessor_3) v_subst_2 (_ bv0 32)) v_subst_1))) (not (= (select v_arrayElimArr_37 v_subst_1) (_ bv0 32))) (= .cse5 (_ bv0 32)) (not (= (select |c_#valid| .cse3) (_ bv0 1))))))) (forall ((v_subst_2 (_ BitVec 32)) (v_arrayElimArr_38 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_38 v_subst_2) (_ bv0 32))) (forall ((v_arrayElimArr_40 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1221 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1198 (_ BitVec 1)) (v_arrayElimArr_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1203 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1223 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_34 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1216 (_ BitVec 1)) (v_arrayElimArr_35 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select v_arrayElimArr_36 |c_ULTIMATE.start_main_~end~0#1.offset|)) (.cse7 (select v_arrayElimArr_40 v_subst_2)) (.cse8 (select v_arrayElimArr_34 (_ bv0 32)))) (let ((.cse11 (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_36) .cse10 v_arrayElimArr_40) .cse7 v_arrayElimArr_34) .cse8 v_ArrVal_1223))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse6 (store |c_#valid| .cse10 v_ArrVal_1198))) (or (not (= (_ bv0 1) (select .cse6 .cse7))) (not (= (_ bv0 32) (select v_arrayElimArr_35 (_ bv0 32)))) (= .cse8 .cse9) (= .cse10 (_ bv0 32)) (not (= (_ bv0 32) (select (select .cse11 .cse9) (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1203) .cse10 v_arrayElimArr_38) .cse7 v_arrayElimArr_35) .cse8 v_ArrVal_1221) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (= .cse8 (_ bv0 32)) (not (= (_ bv0 1) (select (store .cse6 .cse7 v_ArrVal_1216) .cse8))) (not (= (select |c_#valid| .cse10) (_ bv0 1))))))))))) is different from false [2022-11-16 12:57:58,615 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:57:58,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 423 treesize of output 408 [2022-11-16 12:57:58,999 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:57:59,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5884 treesize of output 5867 [2022-11-16 12:57:59,106 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:57:59,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 5851 treesize of output 4828