./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f43a3a479ac35c9dcd12d66840981cacac59cfa14a55d9673c5274543b9a988 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:15:26,364 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:15:26,426 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 03:15:26,430 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:15:26,431 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:15:26,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:15:26,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:15:26,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:15:26,453 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:15:26,453 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:15:26,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:15:26,454 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:15:26,455 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:15:26,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:15:26,456 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:15:26,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:15:26,457 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 03:15:26,458 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:15:26,458 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:15:26,458 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:15:26,459 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:15:26,459 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 03:15:26,460 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:15:26,460 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 03:15:26,460 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:15:26,461 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 03:15:26,461 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:15:26,461 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:15:26,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:15:26,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:15:26,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:15:26,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:15:26,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:15:26,463 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:15:26,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 03:15:26,464 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:15:26,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:15:26,470 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:15:26,472 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:15:26,472 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 03:15:26,472 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:15:26,473 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:15:26,473 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f43a3a479ac35c9dcd12d66840981cacac59cfa14a55d9673c5274543b9a988 [2023-11-29 03:15:26,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:15:26,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:15:26,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:15:26,735 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:15:26,735 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:15:26,736 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i [2023-11-29 03:15:29,451 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:15:29,679 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:15:29,679 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i [2023-11-29 03:15:29,689 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/data/3408644d6/78ea61354d6141ed891a6912e2bfe79f/FLAG9ce0dfabe [2023-11-29 03:15:29,703 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/data/3408644d6/78ea61354d6141ed891a6912e2bfe79f [2023-11-29 03:15:29,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:15:29,707 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:15:29,709 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:15:29,709 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:15:29,714 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:15:29,714 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:15:29" (1/1) ... [2023-11-29 03:15:29,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@586ab877 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:29, skipping insertion in model container [2023-11-29 03:15:29,715 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:15:29" (1/1) ... [2023-11-29 03:15:29,754 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:15:29,890 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i[916,929] [2023-11-29 03:15:29,984 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:15:29,996 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:15:30,009 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i[916,929] [2023-11-29 03:15:30,069 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:15:30,087 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:15:30,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:30 WrapperNode [2023-11-29 03:15:30,088 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:15:30,089 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:15:30,089 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:15:30,089 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:15:30,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:30" (1/1) ... [2023-11-29 03:15:30,117 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:30" (1/1) ... [2023-11-29 03:15:30,168 INFO L138 Inliner]: procedures = 29, calls = 247, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 674 [2023-11-29 03:15:30,168 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:15:30,169 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:15:30,169 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:15:30,169 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:15:30,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:30" (1/1) ... [2023-11-29 03:15:30,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:30" (1/1) ... [2023-11-29 03:15:30,192 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:30" (1/1) ... [2023-11-29 03:15:30,219 INFO L175 MemorySlicer]: Split 206 memory accesses to 6 slices as follows [2, 14, 27, 43, 5, 115]. 56 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 2, 4, 5, 1, 6]. The 21 writes are split as follows [0, 2, 4, 6, 1, 8]. [2023-11-29 03:15:30,219 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:30" (1/1) ... [2023-11-29 03:15:30,219 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:30" (1/1) ... [2023-11-29 03:15:30,254 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:30" (1/1) ... [2023-11-29 03:15:30,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:30" (1/1) ... [2023-11-29 03:15:30,266 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:30" (1/1) ... [2023-11-29 03:15:30,271 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:30" (1/1) ... [2023-11-29 03:15:30,280 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:15:30,281 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:15:30,282 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:15:30,282 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:15:30,283 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:30" (1/1) ... [2023-11-29 03:15:30,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:15:30,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:15:30,308 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:15:30,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:15:30,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:15:30,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-11-29 03:15:30,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-11-29 03:15:30,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-11-29 03:15:30,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-11-29 03:15:30,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-11-29 03:15:30,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-11-29 03:15:30,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 03:15:30,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 03:15:30,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 03:15:30,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 03:15:30,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 03:15:30,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-29 03:15:30,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-11-29 03:15:30,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-11-29 03:15:30,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-11-29 03:15:30,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-11-29 03:15:30,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-11-29 03:15:30,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-11-29 03:15:30,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 03:15:30,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 03:15:30,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 03:15:30,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 03:15:30,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 03:15:30,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-29 03:15:30,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-11-29 03:15:30,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-11-29 03:15:30,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-11-29 03:15:30,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-11-29 03:15:30,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-11-29 03:15:30,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-11-29 03:15:30,344 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 03:15:30,344 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 03:15:30,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 03:15:30,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 03:15:30,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 03:15:30,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 03:15:30,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 03:15:30,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-29 03:15:30,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:15:30,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:15:30,499 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:15:30,501 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:15:31,091 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:15:31,127 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:15:31,127 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 03:15:31,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:15:31 BoogieIcfgContainer [2023-11-29 03:15:31,128 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:15:31,130 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:15:31,130 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:15:31,134 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:15:31,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:15:29" (1/3) ... [2023-11-29 03:15:31,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@555f8ab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:15:31, skipping insertion in model container [2023-11-29 03:15:31,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:30" (2/3) ... [2023-11-29 03:15:31,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@555f8ab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:15:31, skipping insertion in model container [2023-11-29 03:15:31,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:15:31" (3/3) ... [2023-11-29 03:15:31,136 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-86.i [2023-11-29 03:15:31,156 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:15:31,157 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 03:15:31,210 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:15:31,217 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@79136a24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:15:31,218 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 03:15:31,222 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 122 states have (on average 1.4672131147540983) internal successors, (179), 123 states have internal predecessors, (179), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 03:15:31,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2023-11-29 03:15:31,240 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:31,241 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:31,242 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:15:31,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:31,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1904993443, now seen corresponding path program 1 times [2023-11-29 03:15:31,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:15:31,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220306257] [2023-11-29 03:15:31,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:31,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:15:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:31,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:15:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:31,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:15:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:31,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:15:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:31,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:15:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:31,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:15:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:31,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:15:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:31,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:15:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:31,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:15:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:31,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:15:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:31,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:15:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:31,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:15:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:31,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:15:31,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:31,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:15:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:31,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:15:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:31,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 03:15:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:31,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 03:15:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:31,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 03:15:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:31,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 03:15:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:31,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 03:15:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:31,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 03:15:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:31,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 03:15:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:31,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 03:15:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:31,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-29 03:15:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:31,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-11-29 03:15:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:31,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 03:15:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:31,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 03:15:31,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:15:31,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220306257] [2023-11-29 03:15:31,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220306257] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:31,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:31,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:15:31,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121959401] [2023-11-29 03:15:31,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:31,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 03:15:31,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:15:31,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 03:15:31,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:15:31,756 INFO L87 Difference]: Start difference. First operand has 150 states, 122 states have (on average 1.4672131147540983) internal successors, (179), 123 states have internal predecessors, (179), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-29 03:15:31,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:31,810 INFO L93 Difference]: Finished difference Result 297 states and 481 transitions. [2023-11-29 03:15:31,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 03:15:31,812 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 180 [2023-11-29 03:15:31,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:31,822 INFO L225 Difference]: With dead ends: 297 [2023-11-29 03:15:31,822 INFO L226 Difference]: Without dead ends: 148 [2023-11-29 03:15:31,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:15:31,830 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:31,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:15:31,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-11-29 03:15:31,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2023-11-29 03:15:31,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 121 states have (on average 1.43801652892562) internal successors, (174), 121 states have internal predecessors, (174), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 03:15:31,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 224 transitions. [2023-11-29 03:15:31,883 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 224 transitions. Word has length 180 [2023-11-29 03:15:31,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:31,883 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 224 transitions. [2023-11-29 03:15:31,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-29 03:15:31,884 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 224 transitions. [2023-11-29 03:15:31,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2023-11-29 03:15:31,888 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:31,889 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:31,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 03:15:31,889 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:15:31,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:31,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1309702017, now seen corresponding path program 1 times [2023-11-29 03:15:31,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:15:31,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548824880] [2023-11-29 03:15:31,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:31,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:15:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:15:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:15:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:15:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:15:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:15:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:15:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:15:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:15:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:15:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:15:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:15:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:15:32,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:15:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:15:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 03:15:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 03:15:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 03:15:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 03:15:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 03:15:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 03:15:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 03:15:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 03:15:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-29 03:15:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-11-29 03:15:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 03:15:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 03:15:32,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:15:32,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548824880] [2023-11-29 03:15:32,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548824880] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:32,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:32,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:15:32,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968756292] [2023-11-29 03:15:32,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:32,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:15:32,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:15:32,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:15:32,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:15:32,276 INFO L87 Difference]: Start difference. First operand 148 states and 224 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-29 03:15:32,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:32,348 INFO L93 Difference]: Finished difference Result 301 states and 456 transitions. [2023-11-29 03:15:32,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:15:32,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 180 [2023-11-29 03:15:32,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:32,351 INFO L225 Difference]: With dead ends: 301 [2023-11-29 03:15:32,352 INFO L226 Difference]: Without dead ends: 154 [2023-11-29 03:15:32,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:15:32,355 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 10 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:32,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 652 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:15:32,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-11-29 03:15:32,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2023-11-29 03:15:32,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 123 states have (on average 1.4308943089430894) internal successors, (176), 123 states have internal predecessors, (176), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 03:15:32,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 226 transitions. [2023-11-29 03:15:32,377 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 226 transitions. Word has length 180 [2023-11-29 03:15:32,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:32,377 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 226 transitions. [2023-11-29 03:15:32,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-29 03:15:32,378 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 226 transitions. [2023-11-29 03:15:32,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2023-11-29 03:15:32,382 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:32,383 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:32,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 03:15:32,383 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:15:32,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:32,384 INFO L85 PathProgramCache]: Analyzing trace with hash 891813315, now seen corresponding path program 1 times [2023-11-29 03:15:32,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:15:32,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685683347] [2023-11-29 03:15:32,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:32,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:15:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:15:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:15:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:15:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:15:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:15:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:15:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:15:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:15:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:15:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:15:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:15:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:15:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:15:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:15:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 03:15:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 03:15:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 03:15:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 03:15:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 03:15:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 03:15:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 03:15:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 03:15:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-29 03:15:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-11-29 03:15:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 03:15:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 03:15:32,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:15:32,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685683347] [2023-11-29 03:15:32,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685683347] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:32,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:32,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:15:32,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781383956] [2023-11-29 03:15:32,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:32,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:15:32,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:15:32,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:15:32,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:15:32,691 INFO L87 Difference]: Start difference. First operand 150 states and 226 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 03:15:32,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:32,737 INFO L93 Difference]: Finished difference Result 303 states and 456 transitions. [2023-11-29 03:15:32,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:15:32,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 180 [2023-11-29 03:15:32,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:32,741 INFO L225 Difference]: With dead ends: 303 [2023-11-29 03:15:32,742 INFO L226 Difference]: Without dead ends: 154 [2023-11-29 03:15:32,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:15:32,744 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 3 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:32,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 648 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:15:32,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-11-29 03:15:32,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2023-11-29 03:15:32,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 125 states have (on average 1.424) internal successors, (178), 125 states have internal predecessors, (178), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 03:15:32,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 228 transitions. [2023-11-29 03:15:32,760 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 228 transitions. Word has length 180 [2023-11-29 03:15:32,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:32,761 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 228 transitions. [2023-11-29 03:15:32,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 03:15:32,762 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 228 transitions. [2023-11-29 03:15:32,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2023-11-29 03:15:32,765 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:32,765 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:32,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 03:15:32,766 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:15:32,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:32,767 INFO L85 PathProgramCache]: Analyzing trace with hash 891872897, now seen corresponding path program 1 times [2023-11-29 03:15:32,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:15:32,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924439924] [2023-11-29 03:15:32,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:32,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:15:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:15:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:15:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:15:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:15:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:15:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:15:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:15:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:15:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:15:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:15:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:15:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:15:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:15:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:15:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 03:15:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 03:15:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 03:15:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 03:15:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 03:15:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 03:15:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 03:15:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 03:15:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-29 03:15:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-11-29 03:15:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 03:15:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 03:15:33,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:15:33,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924439924] [2023-11-29 03:15:33,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924439924] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:33,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:33,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:15:33,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357702580] [2023-11-29 03:15:33,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:33,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:15:33,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:15:33,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:15:33,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:15:33,433 INFO L87 Difference]: Start difference. First operand 152 states and 228 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 03:15:33,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:33,582 INFO L93 Difference]: Finished difference Result 458 states and 689 transitions. [2023-11-29 03:15:33,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:15:33,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 180 [2023-11-29 03:15:33,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:33,586 INFO L225 Difference]: With dead ends: 458 [2023-11-29 03:15:33,586 INFO L226 Difference]: Without dead ends: 307 [2023-11-29 03:15:33,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:15:33,588 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 280 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:33,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 977 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:15:33,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2023-11-29 03:15:33,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 267. [2023-11-29 03:15:33,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 230 states have (on average 1.4521739130434783) internal successors, (334), 231 states have internal predecessors, (334), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2023-11-29 03:15:33,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 402 transitions. [2023-11-29 03:15:33,611 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 402 transitions. Word has length 180 [2023-11-29 03:15:33,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:33,612 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 402 transitions. [2023-11-29 03:15:33,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 03:15:33,612 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 402 transitions. [2023-11-29 03:15:33,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2023-11-29 03:15:33,615 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:33,615 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:33,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 03:15:33,616 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:15:33,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:33,616 INFO L85 PathProgramCache]: Analyzing trace with hash 550591240, now seen corresponding path program 1 times [2023-11-29 03:15:33,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:15:33,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001723558] [2023-11-29 03:15:33,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:33,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:15:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:15:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:15:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:15:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:15:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:15:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:15:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:15:33,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:15:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:15:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:15:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:15:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:15:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:15:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:15:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 03:15:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 03:15:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 03:15:33,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 03:15:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 03:15:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 03:15:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 03:15:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 03:15:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-29 03:15:33,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-11-29 03:15:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 03:15:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:33,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 03:15:33,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:15:33,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001723558] [2023-11-29 03:15:33,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001723558] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:33,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:33,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:15:33,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919264983] [2023-11-29 03:15:33,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:33,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:15:33,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:15:33,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:15:33,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:15:33,930 INFO L87 Difference]: Start difference. First operand 267 states and 402 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 03:15:34,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:34,099 INFO L93 Difference]: Finished difference Result 902 states and 1363 transitions. [2023-11-29 03:15:34,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:15:34,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 182 [2023-11-29 03:15:34,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:34,106 INFO L225 Difference]: With dead ends: 902 [2023-11-29 03:15:34,106 INFO L226 Difference]: Without dead ends: 636 [2023-11-29 03:15:34,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:15:34,108 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 403 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:34,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 953 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:15:34,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2023-11-29 03:15:34,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 332. [2023-11-29 03:15:34,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 295 states have (on average 1.4813559322033898) internal successors, (437), 296 states have internal predecessors, (437), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2023-11-29 03:15:34,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 505 transitions. [2023-11-29 03:15:34,132 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 505 transitions. Word has length 182 [2023-11-29 03:15:34,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:34,133 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 505 transitions. [2023-11-29 03:15:34,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 03:15:34,133 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 505 transitions. [2023-11-29 03:15:34,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2023-11-29 03:15:34,136 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:34,136 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:34,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 03:15:34,136 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:15:34,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:34,137 INFO L85 PathProgramCache]: Analyzing trace with hash -129467130, now seen corresponding path program 1 times [2023-11-29 03:15:34,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:15:34,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693897254] [2023-11-29 03:15:34,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:34,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:15:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:34,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:15:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:34,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 03:15:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:34,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 03:15:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:34,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 03:15:34,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:34,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 03:15:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:34,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 03:15:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:34,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-29 03:15:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:34,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:15:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:34,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:15:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:34,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 03:15:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:34,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 03:15:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:34,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 03:15:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:34,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 03:15:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:34,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 03:15:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:34,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 03:15:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:34,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 03:15:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:34,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 03:15:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:34,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 03:15:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:34,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 03:15:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:34,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 03:15:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:34,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 03:15:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:34,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 03:15:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:34,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-29 03:15:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:34,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-11-29 03:15:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:34,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 03:15:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:34,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 03:15:34,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:15:34,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693897254] [2023-11-29 03:15:34,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693897254] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:34,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:34,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:15:34,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603051215] [2023-11-29 03:15:34,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:34,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:15:34,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:15:34,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:15:34,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:15:34,924 INFO L87 Difference]: Start difference. First operand 332 states and 505 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-29 03:15:35,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:35,084 INFO L93 Difference]: Finished difference Result 717 states and 1085 transitions. [2023-11-29 03:15:35,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:15:35,085 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 182 [2023-11-29 03:15:35,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:35,088 INFO L225 Difference]: With dead ends: 717 [2023-11-29 03:15:35,088 INFO L226 Difference]: Without dead ends: 386 [2023-11-29 03:15:35,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:15:35,090 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 120 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:35,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1066 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:15:35,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2023-11-29 03:15:35,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 383. [2023-11-29 03:15:35,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 343 states have (on average 1.4723032069970845) internal successors, (505), 345 states have internal predecessors, (505), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 03:15:35,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 577 transitions. [2023-11-29 03:15:35,113 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 577 transitions. Word has length 182 [2023-11-29 03:15:35,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:35,113 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 577 transitions. [2023-11-29 03:15:35,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-29 03:15:35,114 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 577 transitions. [2023-11-29 03:15:35,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2023-11-29 03:15:35,117 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:35,117 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:35,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 03:15:35,117 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:15:35,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:35,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1458880772, now seen corresponding path program 1 times [2023-11-29 03:15:35,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:15:35,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697564006] [2023-11-29 03:15:35,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:35,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:15:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:15:35,264 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:15:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:15:35,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:15:35,451 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 03:15:35,452 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 03:15:35,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 03:15:35,457 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:35,460 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 03:15:35,512 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 03:15:35,514 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated [2023-11-29 03:15:35,515 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated [2023-11-29 03:15:35,515 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated [2023-11-29 03:15:35,516 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem89 could not be translated [2023-11-29 03:15:35,516 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 03:15:35,517 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem89 could not be translated [2023-11-29 03:15:35,517 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 03:15:35,517 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short91 could not be translated [2023-11-29 03:15:35,517 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short95 could not be translated [2023-11-29 03:15:35,517 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem89 could not be translated [2023-11-29 03:15:35,518 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem89 could not be translated [2023-11-29 03:15:35,518 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short91 could not be translated [2023-11-29 03:15:35,518 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 03:15:35,519 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short95 could not be translated [2023-11-29 03:15:35,519 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-29 03:15:35,519 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem98 could not be translated [2023-11-29 03:15:35,520 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-29 03:15:35,520 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-29 03:15:35,520 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short103 could not be translated [2023-11-29 03:15:35,520 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem98 could not be translated [2023-11-29 03:15:35,521 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short99 could not be translated [2023-11-29 03:15:35,521 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-29 03:15:35,522 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem98 could not be translated [2023-11-29 03:15:35,522 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short103 could not be translated [2023-11-29 03:15:35,522 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short99 could not be translated [2023-11-29 03:15:35,522 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem105 could not be translated [2023-11-29 03:15:35,523 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem106 could not be translated [2023-11-29 03:15:35,523 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem105 could not be translated [2023-11-29 03:15:35,523 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short107 could not be translated [2023-11-29 03:15:35,523 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem105 could not be translated [2023-11-29 03:15:35,524 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem106 could not be translated [2023-11-29 03:15:35,524 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated [2023-11-29 03:15:35,525 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated [2023-11-29 03:15:35,525 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short107 could not be translated [2023-11-29 03:15:35,525 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem105 could not be translated [2023-11-29 03:15:35,525 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem106 could not be translated [2023-11-29 03:15:35,526 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem113 could not be translated [2023-11-29 03:15:35,527 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem114 could not be translated [2023-11-29 03:15:35,528 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem116 could not be translated [2023-11-29 03:15:35,528 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem117 could not be translated [2023-11-29 03:15:35,529 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem119 could not be translated [2023-11-29 03:15:35,530 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated [2023-11-29 03:15:35,531 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem122 could not be translated [2023-11-29 03:15:35,531 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem123 could not be translated [2023-11-29 03:15:35,532 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem125 could not be translated [2023-11-29 03:15:35,532 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem126 could not be translated [2023-11-29 03:15:35,533 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem128 could not be translated [2023-11-29 03:15:35,534 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem129 could not be translated [2023-11-29 03:15:35,534 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem131 could not be translated [2023-11-29 03:15:35,535 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem132 could not be translated [2023-11-29 03:15:35,535 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem134 could not be translated [2023-11-29 03:15:35,536 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem135 could not be translated [2023-11-29 03:15:35,536 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem137 could not be translated [2023-11-29 03:15:35,537 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem138 could not be translated [2023-11-29 03:15:35,537 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short22 could not be translated [2023-11-29 03:15:35,537 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem20 could not be translated [2023-11-29 03:15:35,538 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short22 could not be translated [2023-11-29 03:15:35,538 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem20 could not be translated [2023-11-29 03:15:35,538 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem21 could not be translated [2023-11-29 03:15:35,538 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet38 could not be translated [2023-11-29 03:15:35,539 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem39 could not be translated [2023-11-29 03:15:35,539 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem37 could not be translated [2023-11-29 03:15:35,539 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem139 could not be translated [2023-11-29 03:15:35,539 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem151 could not be translated [2023-11-29 03:15:35,540 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite152 could not be translated [2023-11-29 03:15:35,540 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem150 could not be translated [2023-11-29 03:15:35,540 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem150 could not be translated [2023-11-29 03:15:35,540 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short159 could not be translated [2023-11-29 03:15:35,540 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem151 could not be translated [2023-11-29 03:15:35,540 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite152 could not be translated [2023-11-29 03:15:35,540 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem139 could not be translated [2023-11-29 03:15:35,541 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short159 could not be translated [2023-11-29 03:15:35,541 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem157 could not be translated [2023-11-29 03:15:35,541 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem154 could not be translated [2023-11-29 03:15:35,541 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem150 could not be translated [2023-11-29 03:15:35,541 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem151 could not be translated [2023-11-29 03:15:35,541 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite158 could not be translated [2023-11-29 03:15:35,541 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem153 could not be translated [2023-11-29 03:15:35,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite152 could not be translated [2023-11-29 03:15:35,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem156 could not be translated [2023-11-29 03:15:35,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem155 could not be translated [2023-11-29 03:15:35,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem139 could not be translated [2023-11-29 03:15:35,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem153 could not be translated [2023-11-29 03:15:35,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem139 could not be translated [2023-11-29 03:15:35,542 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem155 could not be translated [2023-11-29 03:15:35,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem157 could not be translated [2023-11-29 03:15:35,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem151 could not be translated [2023-11-29 03:15:35,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem154 could not be translated [2023-11-29 03:15:35,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short159 could not be translated [2023-11-29 03:15:35,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite152 could not be translated [2023-11-29 03:15:35,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem156 could not be translated [2023-11-29 03:15:35,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite158 could not be translated [2023-11-29 03:15:35,543 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem150 could not be translated [2023-11-29 03:15:35,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite158 could not be translated [2023-11-29 03:15:35,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite152 could not be translated [2023-11-29 03:15:35,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem156 could not be translated [2023-11-29 03:15:35,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem155 could not be translated [2023-11-29 03:15:35,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem154 could not be translated [2023-11-29 03:15:35,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem139 could not be translated [2023-11-29 03:15:35,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem150 could not be translated [2023-11-29 03:15:35,544 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short159 could not be translated [2023-11-29 03:15:35,545 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short227 could not be translated [2023-11-29 03:15:35,545 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem153 could not be translated [2023-11-29 03:15:35,545 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem151 could not be translated [2023-11-29 03:15:35,545 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem157 could not be translated [2023-11-29 03:15:35,545 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem156 could not be translated [2023-11-29 03:15:35,546 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short230 could not be translated [2023-11-29 03:15:35,546 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem150 could not be translated [2023-11-29 03:15:35,546 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem157 could not be translated [2023-11-29 03:15:35,546 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite158 could not be translated [2023-11-29 03:15:35,546 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem153 could not be translated [2023-11-29 03:15:35,546 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite152 could not be translated [2023-11-29 03:15:35,546 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem154 could not be translated [2023-11-29 03:15:35,546 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem151 could not be translated [2023-11-29 03:15:35,547 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem139 could not be translated [2023-11-29 03:15:35,547 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short159 could not be translated [2023-11-29 03:15:35,547 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short227 could not be translated [2023-11-29 03:15:35,547 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem155 could not be translated [2023-11-29 03:15:35,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 03:15:35 BoogieIcfgContainer [2023-11-29 03:15:35,570 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 03:15:35,571 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 03:15:35,571 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 03:15:35,571 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 03:15:35,571 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:15:31" (3/4) ... [2023-11-29 03:15:35,573 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 03:15:35,574 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 03:15:35,575 INFO L158 Benchmark]: Toolchain (without parser) took 5867.63ms. Allocated memory was 153.1MB in the beginning and 237.0MB in the end (delta: 83.9MB). Free memory was 119.2MB in the beginning and 111.6MB in the end (delta: 7.6MB). Peak memory consumption was 93.5MB. Max. memory is 16.1GB. [2023-11-29 03:15:35,575 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 153.1MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:15:35,575 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.37ms. Allocated memory is still 153.1MB. Free memory was 119.2MB in the beginning and 100.4MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 03:15:35,576 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.59ms. Allocated memory is still 153.1MB. Free memory was 99.9MB in the beginning and 94.1MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 03:15:35,576 INFO L158 Benchmark]: Boogie Preprocessor took 111.94ms. Allocated memory is still 153.1MB. Free memory was 94.1MB in the beginning and 86.2MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-29 03:15:35,576 INFO L158 Benchmark]: RCFGBuilder took 846.22ms. Allocated memory is still 153.1MB. Free memory was 86.2MB in the beginning and 94.3MB in the end (delta: -8.1MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. [2023-11-29 03:15:35,577 INFO L158 Benchmark]: TraceAbstraction took 4440.04ms. Allocated memory was 153.1MB in the beginning and 237.0MB in the end (delta: 83.9MB). Free memory was 93.6MB in the beginning and 111.6MB in the end (delta: -17.9MB). Peak memory consumption was 65.5MB. Max. memory is 16.1GB. [2023-11-29 03:15:35,577 INFO L158 Benchmark]: Witness Printer took 3.56ms. Allocated memory is still 237.0MB. Free memory is still 111.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:15:35,579 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 153.1MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 379.37ms. Allocated memory is still 153.1MB. Free memory was 119.2MB in the beginning and 100.4MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.59ms. Allocated memory is still 153.1MB. Free memory was 99.9MB in the beginning and 94.1MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 111.94ms. Allocated memory is still 153.1MB. Free memory was 94.1MB in the beginning and 86.2MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 846.22ms. Allocated memory is still 153.1MB. Free memory was 86.2MB in the beginning and 94.3MB in the end (delta: -8.1MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4440.04ms. Allocated memory was 153.1MB in the beginning and 237.0MB in the end (delta: 83.9MB). Free memory was 93.6MB in the beginning and 111.6MB in the end (delta: -17.9MB). Peak memory consumption was 65.5MB. Max. memory is 16.1GB. * Witness Printer took 3.56ms. Allocated memory is still 237.0MB. Free memory is still 111.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem86 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short91 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short91 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem98 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short103 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem98 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short99 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem98 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short103 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short99 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem105 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem106 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem105 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short107 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem105 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem106 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short107 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem105 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem106 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem113 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem114 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem116 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem117 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem119 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem120 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem122 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem123 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem125 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem126 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem128 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem129 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem131 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem132 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem134 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem135 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem137 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem138 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem20 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem20 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem21 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem39 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem139 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem151 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite152 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem150 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem150 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short159 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem151 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite152 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem139 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short159 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem157 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem154 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem150 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem151 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite158 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem153 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite152 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem156 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem155 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem139 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem153 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem139 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem155 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem157 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem151 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem154 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short159 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite152 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem156 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite158 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem150 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite158 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite152 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem156 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem155 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem154 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem139 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem150 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short159 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short227 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem153 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem151 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem157 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem156 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short230 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem150 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem157 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite158 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem153 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite152 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem154 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem151 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem139 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short159 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short227 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem155 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 104, overapproximation of shiftLeft at line 53, overapproximation of someBinaryArithmeticFLOAToperation at line 47. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L25-L27] float float_Array_0[2][2] = { {128.5, 499.3}, {127.8, 255.8} }; [L25-L27] float float_Array_0[2][2] = { {128.5, 499.3}, {127.8, 255.8} }; [L25-L27] float float_Array_0[2][2] = { {128.5, 499.3}, {127.8, 255.8} }; [L25-L27] float float_Array_0[2][2] = { {128.5, 499.3}, {127.8, 255.8} }; [L25-L27] float float_Array_0[2][2] = { {128.5, 499.3}, {127.8, 255.8} }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 2, -256, 256, 2, 0 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 2, -256, 256, 2, 0 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 2, -256, 256, 2, 0 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 2, -256, 256, 2, 0 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 2, -256, 256, 2, 0 }; [L28-L30] signed short int signed_short_int_Array_0[5] = { 2, -256, 256, 2, 0 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[1] = { 64 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[1] = { 64 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 16, 256}, {10, 57705, 1} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 16, 256}, {10, 57705, 1} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 16, 256}, {10, 57705, 1} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 16, 256}, {10, 57705, 1} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 16, 256}, {10, 57705, 1} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 16, 256}, {10, 57705, 1} }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 16, 256}, {10, 57705, 1} }; [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] FCALL updateLastVariables() [L112] CALL updateVariables() [L61] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L62] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L62] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L62] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L64] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L65] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] float_Array_0[0][0] = __VERIFIER_nondet_float() [L68] EXPR float_Array_0[0][0] [L68] EXPR float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] EXPR float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F [L68] EXPR float_Array_0[0][0] [L68] EXPR float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] EXPR (float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 4611686.018427382800e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] EXPR (float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 4611686.018427382800e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] CALL assume_abort_if_not((float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 4611686.018427382800e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] RET assume_abort_if_not((float_Array_0[0][0] >= 0.0F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 4611686.018427382800e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] float_Array_0[1][0] = __VERIFIER_nondet_float() [L70] EXPR float_Array_0[1][0] [L70] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F [L70] EXPR float_Array_0[1][0] [L70] EXPR float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR (float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 4611686.018427382800e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR (float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 4611686.018427382800e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] CALL assume_abort_if_not((float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 4611686.018427382800e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] RET assume_abort_if_not((float_Array_0[1][0] >= 0.0F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 4611686.018427382800e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] float_Array_0[0][1] = __VERIFIER_nondet_float() [L72] EXPR float_Array_0[0][1] [L72] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F [L72] EXPR float_Array_0[0][1] [L72] EXPR float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854765600e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR (float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854765600e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] CALL assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854765600e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] RET assume_abort_if_not((float_Array_0[0][1] >= 0.0F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854765600e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L74] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L77] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= -8191) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] RET assume_abort_if_not(signed_short_int_Array_0[1] >= -8191) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 8191) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 8191) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] signed_short_int_Array_0[2] = __VERIFIER_nondet_short() [L80] EXPR signed_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] CALL assume_abort_if_not(signed_short_int_Array_0[2] >= -8191) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] RET assume_abort_if_not(signed_short_int_Array_0[2] >= -8191) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] EXPR signed_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] CALL assume_abort_if_not(signed_short_int_Array_0[2] <= 8192) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] RET assume_abort_if_not(signed_short_int_Array_0[2] <= 8192) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] signed_short_int_Array_0[3] = __VERIFIER_nondet_short() [L83] EXPR signed_short_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] CALL assume_abort_if_not(signed_short_int_Array_0[3] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] RET assume_abort_if_not(signed_short_int_Array_0[3] >= -16383) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] EXPR signed_short_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(signed_short_int_Array_0[3] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] RET assume_abort_if_not(signed_short_int_Array_0[3] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] unsigned_short_int_Array_0[0][0] = __VERIFIER_nondet_ushort() [L86] EXPR unsigned_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] RET assume_abort_if_not(unsigned_short_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR unsigned_short_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] RET assume_abort_if_not(unsigned_short_int_Array_0[0][0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L88] unsigned_short_int_Array_0[0][1] = __VERIFIER_nondet_ushort() [L89] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L91] unsigned_short_int_Array_0[1][1] = __VERIFIER_nondet_ushort() [L92] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L94] unsigned_short_int_Array_0[0][2] = __VERIFIER_nondet_ushort() [L95] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L95] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L95] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L96] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L96] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L96] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L97] unsigned_short_int_Array_0[1][2] = __VERIFIER_nondet_ushort() [L98] EXPR unsigned_short_int_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L98] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L98] RET assume_abort_if_not(unsigned_short_int_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L99] EXPR unsigned_short_int_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L99] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][2] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L99] RET assume_abort_if_not(unsigned_short_int_Array_0[1][2] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L112] RET updateVariables() [L113] CALL step() [L40] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L40] COND FALSE !(! BOOL_unsigned_char_Array_0[1]) [L43] EXPR signed_short_int_Array_0[1] [L43] signed_short_int_Array_0[4] = signed_short_int_Array_0[1] [L45] EXPR signed_short_int_Array_0[1] [L45] signed short int stepLocal_0 = signed_short_int_Array_0[1]; [L46] COND TRUE stepLocal_0 > 2 [L47] EXPR float_Array_0[1][0] [L47] EXPR float_Array_0[0][0] [L47] EXPR float_Array_0[0][1] [L47] float_Array_0[1][1] = ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]) [L49] EXPR unsigned_short_int_Array_0[1][1] [L49] unsigned_long_int_Array_0[0] = unsigned_short_int_Array_0[1][1] [L50] EXPR BOOL_unsigned_char_Array_0[1] [L50] BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, stepLocal_0=8191, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L50] BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0] [L50] EXPR BOOL_unsigned_char_Array_0[0] [L50] BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, stepLocal_0=8191, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L50] COND FALSE !(BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) [L53] EXPR signed_short_int_Array_0[3] [L53] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L53] EXPR -25 << unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, stepLocal_0=8191, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L53] COND FALSE !(signed_short_int_Array_0[3] < (200 * (-25 << unsigned_long_int_Array_0[0]))) [L56] EXPR unsigned_short_int_Array_0[1][1] [L56] EXPR unsigned_short_int_Array_0[1][2] [L56] unsigned_short_int_Array_0[1][0] = (unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[1][2]) [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR (! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) [L104] EXPR signed_short_int_Array_0[4] [L104] EXPR signed_short_int_Array_0[1] [L104] EXPR (! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR ((! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) && ((signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR ((! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) && ((signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1) [L104] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR (signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1 [L104] EXPR float_Array_0[1][1] [L104] EXPR float_Array_0[1][0] [L104] EXPR float_Array_0[0][0] [L104] EXPR float_Array_0[0][1] [L104] EXPR (signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR ((! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) && ((signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR (((! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) && ((signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][0] + ((((((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) < (unsigned_short_int_Array_0[0][1])) ? (((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) : (unsigned_short_int_Array_0[0][1])))))) : ((signed_short_int_Array_0[3] < (200 * (-25 << unsigned_long_int_Array_0[0]))) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) ((((((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) < 0 ) ? -(((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) : (((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))))))) : (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[1][2]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR (((! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) && ((signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][0] + ((((((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) < (unsigned_short_int_Array_0[0][1])) ? (((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) : (unsigned_short_int_Array_0[0][1])))))) : ((signed_short_int_Array_0[3] < (200 * (-25 << unsigned_long_int_Array_0[0]))) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) ((((((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) < 0 ) ? -(((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) : (((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))))))) : (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[1][2]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR ((((! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) && ((signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][0] + ((((((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) < (unsigned_short_int_Array_0[0][1])) ? (((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) : (unsigned_short_int_Array_0[0][1])))))) : ((signed_short_int_Array_0[3] < (200 * (-25 << unsigned_long_int_Array_0[0]))) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) ((((((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) < 0 ) ? -(((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) : (((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))))))) : (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[1][2])))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_short_int_Array_0[1][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104] EXPR ((((! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) && ((signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][0] + ((((((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) < (unsigned_short_int_Array_0[0][1])) ? (((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) : (unsigned_short_int_Array_0[0][1])))))) : ((signed_short_int_Array_0[3] < (200 * (-25 << unsigned_long_int_Array_0[0]))) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) ((((((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) < 0 ) ? -(((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) : (((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))))))) : (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[1][2])))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_short_int_Array_0[1][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L104-L105] return ((((! BOOL_unsigned_char_Array_0[1]) ? (signed_short_int_Array_0[4] == ((signed short int) (((((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) < (signed_short_int_Array_0[0])) ? ((signed_short_int_Array_0[3] + (signed_short_int_Array_0[2] + signed_short_int_Array_0[1]))) : (signed_short_int_Array_0[0]))))) : (signed_short_int_Array_0[4] == ((signed short int) signed_short_int_Array_0[1]))) && ((signed_short_int_Array_0[1] > 2) ? (float_Array_0[1][1] == ((float) ((float_Array_0[1][0] + float_Array_0[0][0]) - float_Array_0[0][1]))) : 1)) && ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[0][0] + ((((((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) < (unsigned_short_int_Array_0[0][1])) ? (((((unsigned_short_int_Array_0[0][2]) > (unsigned_short_int_Array_0[1][2])) ? (unsigned_short_int_Array_0[0][2]) : (unsigned_short_int_Array_0[1][2])))) : (unsigned_short_int_Array_0[0][1])))))) : ((signed_short_int_Array_0[3] < (200 * (-25 << unsigned_long_int_Array_0[0]))) ? (unsigned_short_int_Array_0[1][0] == ((unsigned short int) ((((((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) < 0 ) ? -(((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))) : (((((unsigned_short_int_Array_0[1][1] - 10000)) > (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2]))))) ? ((unsigned_short_int_Array_0[1][1] - 10000)) : (((((unsigned_short_int_Array_0[1][2]) < (unsigned_short_int_Array_0[0][2])) ? (unsigned_short_int_Array_0[1][2]) : (unsigned_short_int_Array_0[0][2])))))))))) : (unsigned_short_int_Array_0[1][0] == ((unsigned short int) (unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[1][2])))))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_short_int_Array_0[1][1])) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, float_Array_0={5:0}, isInitial=1, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 150 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 7, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 818 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 816 mSDsluCounter, 4516 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3114 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 335 IncrementalHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 1402 mSDtfsCounter, 335 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 360 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=383occurred in iteration=6, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 353 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1266 NumberOfCodeBlocks, 1266 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1078 ConstructedInterpolants, 0 QuantifiedInterpolants, 1396 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 7200/7200 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 03:15:35,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f43a3a479ac35c9dcd12d66840981cacac59cfa14a55d9673c5274543b9a988 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:15:37,619 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:15:37,710 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 03:15:37,716 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:15:37,717 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:15:37,745 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:15:37,746 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:15:37,747 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:15:37,748 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:15:37,748 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:15:37,749 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:15:37,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:15:37,750 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:15:37,751 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:15:37,751 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:15:37,752 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:15:37,753 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 03:15:37,753 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:15:37,754 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:15:37,755 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:15:37,755 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 03:15:37,756 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:15:37,756 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 03:15:37,757 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 03:15:37,757 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 03:15:37,758 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 03:15:37,758 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:15:37,759 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 03:15:37,759 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:15:37,759 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:15:37,760 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:15:37,760 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:15:37,761 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:15:37,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:15:37,761 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:15:37,762 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:15:37,762 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 03:15:37,762 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 03:15:37,762 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 03:15:37,763 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:15:37,763 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:15:37,763 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 03:15:37,763 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:15:37,764 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:15:37,764 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 03:15:37,764 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f43a3a479ac35c9dcd12d66840981cacac59cfa14a55d9673c5274543b9a988 [2023-11-29 03:15:38,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:15:38,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:15:38,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:15:38,100 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:15:38,100 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:15:38,102 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i [2023-11-29 03:15:40,930 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:15:41,172 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:15:41,173 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i [2023-11-29 03:15:41,183 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/data/a3f7ab04e/d63f77159e5e46ab83ae42a0c918acda/FLAG7ec20ec14 [2023-11-29 03:15:41,198 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/data/a3f7ab04e/d63f77159e5e46ab83ae42a0c918acda [2023-11-29 03:15:41,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:15:41,203 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:15:41,204 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:15:41,204 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:15:41,209 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:15:41,210 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:15:41" (1/1) ... [2023-11-29 03:15:41,211 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d4aa5d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:41, skipping insertion in model container [2023-11-29 03:15:41,211 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:15:41" (1/1) ... [2023-11-29 03:15:41,250 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:15:41,401 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i[916,929] [2023-11-29 03:15:41,494 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:15:41,511 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:15:41,524 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-86.i[916,929] [2023-11-29 03:15:41,594 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:15:41,616 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:15:41,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:41 WrapperNode [2023-11-29 03:15:41,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:15:41,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:15:41,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:15:41,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:15:41,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:41" (1/1) ... [2023-11-29 03:15:41,650 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:41" (1/1) ... [2023-11-29 03:15:41,713 INFO L138 Inliner]: procedures = 36, calls = 247, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 661 [2023-11-29 03:15:41,713 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:15:41,714 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:15:41,714 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:15:41,714 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:15:41,726 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:41" (1/1) ... [2023-11-29 03:15:41,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:41" (1/1) ... [2023-11-29 03:15:41,739 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:41" (1/1) ... [2023-11-29 03:15:41,765 INFO L175 MemorySlicer]: Split 206 memory accesses to 6 slices as follows [2, 14, 27, 43, 5, 115]. 56 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 2, 4, 5, 1, 6]. The 21 writes are split as follows [0, 2, 4, 6, 1, 8]. [2023-11-29 03:15:41,766 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:41" (1/1) ... [2023-11-29 03:15:41,766 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:41" (1/1) ... [2023-11-29 03:15:41,805 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:41" (1/1) ... [2023-11-29 03:15:41,811 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:41" (1/1) ... [2023-11-29 03:15:41,817 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:41" (1/1) ... [2023-11-29 03:15:41,823 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:41" (1/1) ... [2023-11-29 03:15:41,833 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:15:41,834 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:15:41,834 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:15:41,834 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:15:41,835 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:41" (1/1) ... [2023-11-29 03:15:41,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:15:41,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:15:41,866 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:15:41,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:15:41,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:15:41,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 03:15:41,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 03:15:41,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 03:15:41,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 03:15:41,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-11-29 03:15:41,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2023-11-29 03:15:41,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2023-11-29 03:15:41,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2023-11-29 03:15:41,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2023-11-29 03:15:41,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2023-11-29 03:15:41,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2023-11-29 03:15:41,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2023-11-29 03:15:41,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 03:15:41,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 03:15:41,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 03:15:41,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 03:15:41,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-29 03:15:41,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2023-11-29 03:15:41,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-11-29 03:15:41,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-11-29 03:15:41,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-11-29 03:15:41,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-11-29 03:15:41,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2023-11-29 03:15:41,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2023-11-29 03:15:41,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2023-11-29 03:15:41,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2023-11-29 03:15:41,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2023-11-29 03:15:41,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2023-11-29 03:15:41,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2023-11-29 03:15:41,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2023-11-29 03:15:41,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 03:15:41,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 03:15:41,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 03:15:41,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 03:15:41,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-11-29 03:15:41,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2023-11-29 03:15:41,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2023-11-29 03:15:41,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2023-11-29 03:15:41,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2023-11-29 03:15:41,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2023-11-29 03:15:41,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2023-11-29 03:15:41,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2023-11-29 03:15:41,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2023-11-29 03:15:41,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2023-11-29 03:15:41,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2023-11-29 03:15:41,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2023-11-29 03:15:41,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2023-11-29 03:15:41,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2023-11-29 03:15:41,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2023-11-29 03:15:41,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2023-11-29 03:15:41,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2023-11-29 03:15:41,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2023-11-29 03:15:41,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2023-11-29 03:15:41,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2023-11-29 03:15:41,910 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 03:15:41,910 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 03:15:41,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:15:41,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:15:41,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-11-29 03:15:41,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-11-29 03:15:41,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-11-29 03:15:41,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-11-29 03:15:41,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-11-29 03:15:41,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2023-11-29 03:15:41,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2023-11-29 03:15:41,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2023-11-29 03:15:41,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2023-11-29 03:15:41,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2023-11-29 03:15:41,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2023-11-29 03:15:41,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2023-11-29 03:15:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 03:15:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 03:15:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 03:15:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 03:15:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-29 03:15:41,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2023-11-29 03:15:42,091 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:15:42,094 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:15:43,675 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:15:43,743 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:15:43,743 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 03:15:43,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:15:43 BoogieIcfgContainer [2023-11-29 03:15:43,744 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:15:43,746 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:15:43,746 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:15:43,749 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:15:43,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:15:41" (1/3) ... [2023-11-29 03:15:43,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60eed45f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:15:43, skipping insertion in model container [2023-11-29 03:15:43,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:41" (2/3) ... [2023-11-29 03:15:43,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60eed45f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:15:43, skipping insertion in model container [2023-11-29 03:15:43,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:15:43" (3/3) ... [2023-11-29 03:15:43,752 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-86.i [2023-11-29 03:15:43,768 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:15:43,768 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 03:15:43,815 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:15:43,821 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3b903e17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:15:43,821 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 03:15:43,825 INFO L276 IsEmpty]: Start isEmpty. Operand has 148 states, 120 states have (on average 1.4583333333333333) internal successors, (175), 121 states have internal predecessors, (175), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 03:15:43,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-11-29 03:15:43,843 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:43,844 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:43,845 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:15:43,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:43,850 INFO L85 PathProgramCache]: Analyzing trace with hash -824726874, now seen corresponding path program 1 times [2023-11-29 03:15:43,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:43,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53754417] [2023-11-29 03:15:43,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:43,863 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 [2023-11-29 03:15:43,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:43,864 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 03:15:43,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:44,347 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 03:15:44,358 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:44,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2023-11-29 03:15:44,405 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:44,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:44,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [53754417] [2023-11-29 03:15:44,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [53754417] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:44,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:44,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:15:44,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887432722] [2023-11-29 03:15:44,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:44,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 03:15:44,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:44,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 03:15:44,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:15:44,455 INFO L87 Difference]: Start difference. First operand has 148 states, 120 states have (on average 1.4583333333333333) internal successors, (175), 121 states have internal predecessors, (175), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-29 03:15:44,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:44,516 INFO L93 Difference]: Finished difference Result 293 states and 473 transitions. [2023-11-29 03:15:44,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 03:15:44,519 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 179 [2023-11-29 03:15:44,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:44,528 INFO L225 Difference]: With dead ends: 293 [2023-11-29 03:15:44,528 INFO L226 Difference]: Without dead ends: 146 [2023-11-29 03:15:44,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:15:44,536 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:44,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:15:44,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-11-29 03:15:44,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2023-11-29 03:15:44,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 119 states have (on average 1.4285714285714286) internal successors, (170), 119 states have internal predecessors, (170), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 03:15:44,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 220 transitions. [2023-11-29 03:15:44,590 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 220 transitions. Word has length 179 [2023-11-29 03:15:44,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:44,591 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 220 transitions. [2023-11-29 03:15:44,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-29 03:15:44,591 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2023-11-29 03:15:44,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-11-29 03:15:44,596 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:44,597 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:44,606 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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)] Forceful destruction successful, exit code 0 [2023-11-29 03:15:44,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:44,799 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:15:44,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:44,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1675213816, now seen corresponding path program 1 times [2023-11-29 03:15:44,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:44,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [730309074] [2023-11-29 03:15:44,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:44,801 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 [2023-11-29 03:15:44,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:44,803 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 03:15:44,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:45,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:15:45,259 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:45,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2023-11-29 03:15:45,316 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:45,316 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:45,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [730309074] [2023-11-29 03:15:45,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [730309074] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:45,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:45,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:15:45,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558488918] [2023-11-29 03:15:45,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:45,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:15:45,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:45,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:15:45,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:15:45,321 INFO L87 Difference]: Start difference. First operand 146 states and 220 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-29 03:15:45,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:45,426 INFO L93 Difference]: Finished difference Result 297 states and 448 transitions. [2023-11-29 03:15:45,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:15:45,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 179 [2023-11-29 03:15:45,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:45,429 INFO L225 Difference]: With dead ends: 297 [2023-11-29 03:15:45,430 INFO L226 Difference]: Without dead ends: 152 [2023-11-29 03:15:45,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:15:45,433 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 10 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:45,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 640 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:15:45,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-11-29 03:15:45,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 148. [2023-11-29 03:15:45,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 121 states have (on average 1.421487603305785) internal successors, (172), 121 states have internal predecessors, (172), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 03:15:45,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 222 transitions. [2023-11-29 03:15:45,452 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 222 transitions. Word has length 179 [2023-11-29 03:15:45,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:45,453 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 222 transitions. [2023-11-29 03:15:45,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-29 03:15:45,454 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 222 transitions. [2023-11-29 03:15:45,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-11-29 03:15:45,458 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:45,458 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:45,468 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:45,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:45,665 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:15:45,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:45,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1220799878, now seen corresponding path program 1 times [2023-11-29 03:15:45,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:45,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1074264516] [2023-11-29 03:15:45,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:45,666 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 [2023-11-29 03:15:45,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:45,667 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 03:15:45,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:46,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 03:15:46,145 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:47,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 282 proven. 63 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2023-11-29 03:15:47,125 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:15:47,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 03:15:47,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:47,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1074264516] [2023-11-29 03:15:47,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1074264516] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 03:15:47,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:15:47,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2023-11-29 03:15:47,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606039543] [2023-11-29 03:15:47,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:47,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:15:47,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:47,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:15:47,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:15:47,364 INFO L87 Difference]: Start difference. First operand 148 states and 222 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 03:15:47,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:47,567 INFO L93 Difference]: Finished difference Result 376 states and 564 transitions. [2023-11-29 03:15:47,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:15:47,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 179 [2023-11-29 03:15:47,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:47,572 INFO L225 Difference]: With dead ends: 376 [2023-11-29 03:15:47,572 INFO L226 Difference]: Without dead ends: 229 [2023-11-29 03:15:47,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-11-29 03:15:47,574 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 116 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:47,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 841 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:15:47,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-11-29 03:15:47,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2023-11-29 03:15:47,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 196 states have (on average 1.4591836734693877) internal successors, (286), 197 states have internal predecessors, (286), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-29 03:15:47,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 340 transitions. [2023-11-29 03:15:47,599 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 340 transitions. Word has length 179 [2023-11-29 03:15:47,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:47,601 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 340 transitions. [2023-11-29 03:15:47,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 03:15:47,601 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 340 transitions. [2023-11-29 03:15:47,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-11-29 03:15:47,605 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:47,605 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:47,615 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 03:15:47,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:47,806 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:15:47,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:47,807 INFO L85 PathProgramCache]: Analyzing trace with hash -2063050168, now seen corresponding path program 1 times [2023-11-29 03:15:47,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:47,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1809928476] [2023-11-29 03:15:47,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:47,808 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 [2023-11-29 03:15:47,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:47,809 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 03:15:47,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:48,214 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:15:48,218 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:48,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 03:15:48,251 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:48,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:48,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1809928476] [2023-11-29 03:15:48,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1809928476] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:48,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:48,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:15:48,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298724628] [2023-11-29 03:15:48,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:48,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:15:48,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:48,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:15:48,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:15:48,254 INFO L87 Difference]: Start difference. First operand 226 states and 340 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 03:15:48,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:48,366 INFO L93 Difference]: Finished difference Result 469 states and 703 transitions. [2023-11-29 03:15:48,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:15:48,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 179 [2023-11-29 03:15:48,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:48,372 INFO L225 Difference]: With dead ends: 469 [2023-11-29 03:15:48,372 INFO L226 Difference]: Without dead ends: 244 [2023-11-29 03:15:48,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:15:48,374 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 10 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:48,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 840 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:15:48,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2023-11-29 03:15:48,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 234. [2023-11-29 03:15:48,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 204 states have (on average 1.4411764705882353) internal successors, (294), 205 states have internal predecessors, (294), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-29 03:15:48,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 348 transitions. [2023-11-29 03:15:48,394 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 348 transitions. Word has length 179 [2023-11-29 03:15:48,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:48,395 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 348 transitions. [2023-11-29 03:15:48,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 03:15:48,396 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 348 transitions. [2023-11-29 03:15:48,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-11-29 03:15:48,399 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:48,399 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:48,409 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 03:15:48,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:48,601 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:15:48,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:48,601 INFO L85 PathProgramCache]: Analyzing trace with hash -2062990586, now seen corresponding path program 1 times [2023-11-29 03:15:48,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:48,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2109353346] [2023-11-29 03:15:48,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:48,602 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 [2023-11-29 03:15:48,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:48,603 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 03:15:48,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:49,056 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 03:15:49,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:49,216 INFO L378 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 77 treesize of output 41 [2023-11-29 03:15:49,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2023-11-29 03:15:49,264 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:49,264 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:49,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2109353346] [2023-11-29 03:15:49,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2109353346] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:49,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:49,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:15:49,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349176842] [2023-11-29 03:15:49,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:49,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:15:49,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:49,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:15:49,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:15:49,267 INFO L87 Difference]: Start difference. First operand 234 states and 348 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-29 03:15:50,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:50,457 INFO L93 Difference]: Finished difference Result 473 states and 704 transitions. [2023-11-29 03:15:50,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:15:50,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 179 [2023-11-29 03:15:50,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:50,459 INFO L225 Difference]: With dead ends: 473 [2023-11-29 03:15:50,459 INFO L226 Difference]: Without dead ends: 240 [2023-11-29 03:15:50,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:15:50,460 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 217 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:50,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 749 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 03:15:50,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2023-11-29 03:15:50,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 234. [2023-11-29 03:15:50,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 204 states have (on average 1.4362745098039216) internal successors, (293), 205 states have internal predecessors, (293), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-29 03:15:50,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 347 transitions. [2023-11-29 03:15:50,475 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 347 transitions. Word has length 179 [2023-11-29 03:15:50,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:50,476 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 347 transitions. [2023-11-29 03:15:50,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-29 03:15:50,476 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 347 transitions. [2023-11-29 03:15:50,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-11-29 03:15:50,479 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:50,479 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:50,489 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 03:15:50,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:50,688 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:15:50,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:50,689 INFO L85 PathProgramCache]: Analyzing trace with hash 723587530, now seen corresponding path program 1 times [2023-11-29 03:15:50,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:50,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1753205651] [2023-11-29 03:15:50,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:50,690 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 [2023-11-29 03:15:50,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:50,691 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 03:15:50,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:51,041 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 03:15:51,045 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:51,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 412 proven. 0 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2023-11-29 03:15:51,089 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:51,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:51,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1753205651] [2023-11-29 03:15:51,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1753205651] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:51,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:51,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:15:51,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469221556] [2023-11-29 03:15:51,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:51,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:15:51,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:51,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:15:51,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:15:51,091 INFO L87 Difference]: Start difference. First operand 234 states and 347 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2023-11-29 03:15:51,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:51,421 INFO L93 Difference]: Finished difference Result 473 states and 700 transitions. [2023-11-29 03:15:51,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:15:51,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) Word has length 181 [2023-11-29 03:15:51,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:51,424 INFO L225 Difference]: With dead ends: 473 [2023-11-29 03:15:51,424 INFO L226 Difference]: Without dead ends: 238 [2023-11-29 03:15:51,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:15:51,426 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 7 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:51,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 874 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:15:51,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2023-11-29 03:15:51,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2023-11-29 03:15:51,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 204 states have (on average 1.4313725490196079) internal successors, (292), 205 states have internal predecessors, (292), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-29 03:15:51,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 346 transitions. [2023-11-29 03:15:51,443 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 346 transitions. Word has length 181 [2023-11-29 03:15:51,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:51,444 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 346 transitions. [2023-11-29 03:15:51,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2023-11-29 03:15:51,444 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 346 transitions. [2023-11-29 03:15:51,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-11-29 03:15:51,447 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:51,447 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:51,456 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 03:15:51,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:51,649 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:15:51,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:51,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1170746356, now seen corresponding path program 1 times [2023-11-29 03:15:51,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:51,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927755415] [2023-11-29 03:15:51,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:51,650 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 [2023-11-29 03:15:51,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:51,651 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 03:15:51,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:52,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 03:15:52,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:52,169 INFO L378 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 95 treesize of output 41 [2023-11-29 03:15:52,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2023-11-29 03:15:52,211 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:52,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:52,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927755415] [2023-11-29 03:15:52,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927755415] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:52,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:52,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:15:52,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761933421] [2023-11-29 03:15:52,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:52,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:15:52,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:52,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:15:52,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:15:52,213 INFO L87 Difference]: Start difference. First operand 234 states and 346 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-29 03:15:53,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:53,176 INFO L93 Difference]: Finished difference Result 473 states and 700 transitions. [2023-11-29 03:15:53,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:15:53,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 181 [2023-11-29 03:15:53,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:53,179 INFO L225 Difference]: With dead ends: 473 [2023-11-29 03:15:53,179 INFO L226 Difference]: Without dead ends: 240 [2023-11-29 03:15:53,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:15:53,181 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 205 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:53,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 742 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 03:15:53,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2023-11-29 03:15:53,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 234. [2023-11-29 03:15:53,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 204 states have (on average 1.4264705882352942) internal successors, (291), 205 states have internal predecessors, (291), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-29 03:15:53,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 345 transitions. [2023-11-29 03:15:53,195 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 345 transitions. Word has length 181 [2023-11-29 03:15:53,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:53,195 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 345 transitions. [2023-11-29 03:15:53,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-29 03:15:53,195 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 345 transitions. [2023-11-29 03:15:53,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-11-29 03:15:53,197 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:53,197 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:53,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:53,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:53,398 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:15:53,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:53,398 INFO L85 PathProgramCache]: Analyzing trace with hash 947521862, now seen corresponding path program 1 times [2023-11-29 03:15:53,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:53,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [666439388] [2023-11-29 03:15:53,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:53,399 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 [2023-11-29 03:15:53,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:53,400 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 03:15:53,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:53,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 03:15:53,759 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:53,907 INFO L378 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 95 treesize of output 41 [2023-11-29 03:15:53,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2023-11-29 03:15:53,940 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:53,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:53,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [666439388] [2023-11-29 03:15:53,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [666439388] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:53,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:53,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:15:53,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305296455] [2023-11-29 03:15:53,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:53,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:15:53,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:53,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:15:53,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:15:53,942 INFO L87 Difference]: Start difference. First operand 234 states and 345 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-29 03:15:54,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:54,991 INFO L93 Difference]: Finished difference Result 471 states and 695 transitions. [2023-11-29 03:15:54,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:15:54,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 183 [2023-11-29 03:15:54,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:54,994 INFO L225 Difference]: With dead ends: 471 [2023-11-29 03:15:54,994 INFO L226 Difference]: Without dead ends: 238 [2023-11-29 03:15:54,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:15:54,995 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 211 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:54,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 732 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 03:15:54,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2023-11-29 03:15:55,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 232. [2023-11-29 03:15:55,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 202 states have (on average 1.4257425742574257) internal successors, (288), 203 states have internal predecessors, (288), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-29 03:15:55,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 342 transitions. [2023-11-29 03:15:55,008 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 342 transitions. Word has length 183 [2023-11-29 03:15:55,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:55,009 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 342 transitions. [2023-11-29 03:15:55,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-29 03:15:55,009 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 342 transitions. [2023-11-29 03:15:55,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-11-29 03:15:55,010 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:55,011 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:55,018 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 03:15:55,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:55,211 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:15:55,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:55,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1249569358, now seen corresponding path program 1 times [2023-11-29 03:15:55,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:55,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2109574015] [2023-11-29 03:15:55,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:55,212 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 [2023-11-29 03:15:55,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:55,213 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 03:15:55,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:55,611 INFO L262 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 03:15:55,615 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:55,825 INFO L378 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 94 treesize of output 40 [2023-11-29 03:15:55,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 504 proven. 24 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2023-11-29 03:15:55,902 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:15:56,149 INFO L378 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 58 treesize of output 22 [2023-11-29 03:15:56,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 18 proven. 54 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2023-11-29 03:15:56,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:56,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2109574015] [2023-11-29 03:15:56,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2109574015] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:15:56,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:15:56,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2023-11-29 03:15:56,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706793708] [2023-11-29 03:15:56,166 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:15:56,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 03:15:56,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:56,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 03:15:56,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-29 03:15:56,168 INFO L87 Difference]: Start difference. First operand 232 states and 342 transitions. Second operand has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 states have internal predecessors, (96), 4 states have call successors, (49), 3 states have call predecessors, (49), 4 states have return successors, (49), 3 states have call predecessors, (49), 4 states have call successors, (49) [2023-11-29 03:15:57,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:57,829 INFO L93 Difference]: Finished difference Result 478 states and 700 transitions. [2023-11-29 03:15:57,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 03:15:57,830 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 states have internal predecessors, (96), 4 states have call successors, (49), 3 states have call predecessors, (49), 4 states have return successors, (49), 3 states have call predecessors, (49), 4 states have call successors, (49) Word has length 185 [2023-11-29 03:15:57,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:57,831 INFO L225 Difference]: With dead ends: 478 [2023-11-29 03:15:57,832 INFO L226 Difference]: Without dead ends: 236 [2023-11-29 03:15:57,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2023-11-29 03:15:57,833 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 195 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:57,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1238 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 03:15:57,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-11-29 03:15:57,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 232. [2023-11-29 03:15:57,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 202 states have (on average 1.4158415841584158) internal successors, (286), 203 states have internal predecessors, (286), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-29 03:15:57,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 340 transitions. [2023-11-29 03:15:57,841 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 340 transitions. Word has length 185 [2023-11-29 03:15:57,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:57,841 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 340 transitions. [2023-11-29 03:15:57,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 12 states have internal predecessors, (96), 4 states have call successors, (49), 3 states have call predecessors, (49), 4 states have return successors, (49), 3 states have call predecessors, (49), 4 states have call successors, (49) [2023-11-29 03:15:57,842 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 340 transitions. [2023-11-29 03:15:57,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-11-29 03:15:57,843 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:57,843 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:57,852 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:58,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:58,044 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:15:58,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:58,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1179921484, now seen corresponding path program 1 times [2023-11-29 03:15:58,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:58,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [520221002] [2023-11-29 03:15:58,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:58,045 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 [2023-11-29 03:15:58,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:58,046 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 03:15:58,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:15:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:58,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-29 03:15:58,676 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:58,686 INFO L378 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 14 treesize of output 10 [2023-11-29 03:15:58,896 INFO L378 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 0 case distinctions, treesize of input 36 treesize of output 29 [2023-11-29 03:15:59,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:15:59,172 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 42 [2023-11-29 03:16:00,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:16:00,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 51 [2023-11-29 03:16:01,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:16:01,442 INFO L378 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 102 treesize of output 48 [2023-11-29 03:16:01,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 745 proven. 42 refuted. 0 times theorem prover too weak. 413 trivial. 0 not checked. [2023-11-29 03:16:01,515 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:16:01,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-29 03:16:01,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:16:01,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [520221002] [2023-11-29 03:16:01,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [520221002] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 03:16:01,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 03:16:01,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 18 [2023-11-29 03:16:01,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016907278] [2023-11-29 03:16:01,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:16:01,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:16:01,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:16:01,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:16:01,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2023-11-29 03:16:01,798 INFO L87 Difference]: Start difference. First operand 232 states and 340 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 03:16:02,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:16:02,793 INFO L93 Difference]: Finished difference Result 602 states and 873 transitions. [2023-11-29 03:16:02,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:16:02,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 185 [2023-11-29 03:16:02,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:16:02,796 INFO L225 Difference]: With dead ends: 602 [2023-11-29 03:16:02,797 INFO L226 Difference]: Without dead ends: 371 [2023-11-29 03:16:02,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2023-11-29 03:16:02,798 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 702 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:16:02,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 1123 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 03:16:02,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2023-11-29 03:16:02,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 304. [2023-11-29 03:16:02,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 256 states have (on average 1.3515625) internal successors, (346), 258 states have internal predecessors, (346), 43 states have call successors, (43), 4 states have call predecessors, (43), 4 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2023-11-29 03:16:02,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 432 transitions. [2023-11-29 03:16:02,813 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 432 transitions. Word has length 185 [2023-11-29 03:16:02,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:16:02,814 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 432 transitions. [2023-11-29 03:16:02,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-29 03:16:02,814 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 432 transitions. [2023-11-29 03:16:02,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2023-11-29 03:16:02,816 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:16:02,816 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:16:02,824 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 03:16:03,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 03:16:03,017 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:16:03,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:16:03,017 INFO L85 PathProgramCache]: Analyzing trace with hash 409332561, now seen corresponding path program 1 times [2023-11-29 03:16:03,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:16:03,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [586763222] [2023-11-29 03:16:03,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:16:03,018 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 [2023-11-29 03:16:03,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:16:03,019 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 03:16:03,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce8bce86-d007-41dc-aea9-795689ee4b32/bin/uautomizer-verify-BQ2R08f2Ya/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