./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/insertion_sort-2-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/insertion_sort-2-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f08b02f494e898be2e8c5098de245f701022f3f8b39ac6682b3bca3a03512826 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 16:57:31,339 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:57:31,341 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:57:31,354 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:57:31,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:57:31,355 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:57:31,356 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:57:31,357 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:57:31,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:57:31,359 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:57:31,360 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:57:31,360 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:57:31,361 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:57:31,362 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:57:31,362 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:57:31,363 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:57:31,364 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:57:31,364 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:57:31,366 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:57:31,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:57:31,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:57:31,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:57:31,370 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:57:31,370 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:57:31,373 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:57:31,373 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:57:31,373 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:57:31,374 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:57:31,374 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:57:31,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:57:31,375 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:57:31,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:57:31,376 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:57:31,377 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:57:31,378 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:57:31,378 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:57:31,378 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:57:31,378 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:57:31,379 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:57:31,379 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:57:31,380 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:57:31,380 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 16:57:31,395 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:57:31,396 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:57:31,396 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:57:31,396 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:57:31,397 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:57:31,397 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:57:31,397 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:57:31,397 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:57:31,397 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:57:31,398 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:57:31,398 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 16:57:31,398 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 16:57:31,398 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 16:57:31,398 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:57:31,399 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 16:57:31,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:57:31,399 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 16:57:31,399 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 16:57:31,399 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 16:57:31,399 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:57:31,399 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 16:57:31,400 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:57:31,400 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:57:31,400 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:57:31,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:57:31,400 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:57:31,400 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:57:31,401 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 16:57:31,401 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 16:57:31,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 16:57:31,401 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:57:31,401 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 16:57:31,401 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:57:31,401 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:57:31,402 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:57:31,402 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/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_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f08b02f494e898be2e8c5098de245f701022f3f8b39ac6682b3bca3a03512826 [2022-12-13 16:57:31,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:57:31,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:57:31,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:57:31,615 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:57:31,616 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:57:31,617 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/loops/insertion_sort-2-2.c [2022-12-13 16:57:34,301 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:57:34,454 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:57:34,454 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/sv-benchmarks/c/loops/insertion_sort-2-2.c [2022-12-13 16:57:34,459 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/data/5304f1146/668aa025482440c6b262a7b664fe3ac8/FLAG97ce88c64 [2022-12-13 16:57:34,473 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/data/5304f1146/668aa025482440c6b262a7b664fe3ac8 [2022-12-13 16:57:34,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:57:34,477 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:57:34,479 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:57:34,479 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:57:34,482 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:57:34,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:57:34" (1/1) ... [2022-12-13 16:57:34,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@124232c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:34, skipping insertion in model container [2022-12-13 16:57:34,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:57:34" (1/1) ... [2022-12-13 16:57:34,492 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:57:34,505 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:57:34,632 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/sv-benchmarks/c/loops/insertion_sort-2-2.c[330,343] [2022-12-13 16:57:34,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:57:34,658 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:57:34,666 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/sv-benchmarks/c/loops/insertion_sort-2-2.c[330,343] [2022-12-13 16:57:34,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:57:34,683 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:57:34,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:34 WrapperNode [2022-12-13 16:57:34,683 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:57:34,684 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:57:34,684 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:57:34,684 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:57:34,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:34" (1/1) ... [2022-12-13 16:57:34,695 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:34" (1/1) ... [2022-12-13 16:57:34,710 INFO L138 Inliner]: procedures = 15, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85 [2022-12-13 16:57:34,711 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:57:34,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:57:34,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:57:34,712 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:57:34,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:34" (1/1) ... [2022-12-13 16:57:34,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:34" (1/1) ... [2022-12-13 16:57:34,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:34" (1/1) ... [2022-12-13 16:57:34,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:34" (1/1) ... [2022-12-13 16:57:34,728 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:34" (1/1) ... [2022-12-13 16:57:34,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:34" (1/1) ... [2022-12-13 16:57:34,732 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:34" (1/1) ... [2022-12-13 16:57:34,733 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:34" (1/1) ... [2022-12-13 16:57:34,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:57:34,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:57:34,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:57:34,736 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:57:34,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:34" (1/1) ... [2022-12-13 16:57:34,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:57:34,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:57:34,765 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:57:34,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:57:34,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:57:34,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 16:57:34,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 16:57:34,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 16:57:34,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:57:34,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:57:34,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 16:57:34,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 16:57:34,859 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:57:34,860 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:57:34,981 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:57:34,986 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:57:34,986 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 16:57:34,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:57:34 BoogieIcfgContainer [2022-12-13 16:57:34,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:57:34,989 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:57:34,989 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:57:34,992 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:57:34,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:57:34" (1/3) ... [2022-12-13 16:57:34,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41c42e16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:57:34, skipping insertion in model container [2022-12-13 16:57:34,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:34" (2/3) ... [2022-12-13 16:57:34,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41c42e16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:57:34, skipping insertion in model container [2022-12-13 16:57:34,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:57:34" (3/3) ... [2022-12-13 16:57:34,994 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort-2-2.c [2022-12-13 16:57:35,009 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:57:35,009 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 16:57:35,045 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:57:35,051 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@17ecffbe, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:57:35,051 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 16:57:35,054 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:35,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-13 16:57:35,059 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:57:35,059 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:57:35,060 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:57:35,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:57:35,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1467561831, now seen corresponding path program 1 times [2022-12-13 16:57:35,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:57:35,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223282325] [2022-12-13 16:57:35,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:35,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:57:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:35,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:57:35,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:57:35,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223282325] [2022-12-13 16:57:35,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223282325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:57:35,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:57:35,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:57:35,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762221836] [2022-12-13 16:57:35,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:57:35,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 16:57:35,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:57:35,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 16:57:35,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 16:57:35,211 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:35,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:57:35,225 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2022-12-13 16:57:35,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 16:57:35,226 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-12-13 16:57:35,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:57:35,232 INFO L225 Difference]: With dead ends: 41 [2022-12-13 16:57:35,232 INFO L226 Difference]: Without dead ends: 19 [2022-12-13 16:57:35,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 16:57:35,237 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:57:35,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:57:35,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-12-13 16:57:35,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-12-13 16:57:35,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:35,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-12-13 16:57:35,262 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 10 [2022-12-13 16:57:35,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:57:35,262 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-12-13 16:57:35,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:35,263 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-12-13 16:57:35,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-13 16:57:35,263 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:57:35,263 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:57:35,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 16:57:35,264 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:57:35,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:57:35,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1773339129, now seen corresponding path program 1 times [2022-12-13 16:57:35,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:57:35,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636391810] [2022-12-13 16:57:35,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:35,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:57:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:35,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:57:35,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:57:35,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636391810] [2022-12-13 16:57:35,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636391810] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:57:35,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:57:35,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:57:35,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833057055] [2022-12-13 16:57:35,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:57:35,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:57:35,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:57:35,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:57:35,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:57:35,467 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:35,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:57:35,520 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-12-13 16:57:35,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:57:35,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-12-13 16:57:35,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:57:35,522 INFO L225 Difference]: With dead ends: 33 [2022-12-13 16:57:35,522 INFO L226 Difference]: Without dead ends: 25 [2022-12-13 16:57:35,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:57:35,524 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:57:35,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 49 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:57:35,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-12-13 16:57:35,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2022-12-13 16:57:35,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:35,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-12-13 16:57:35,531 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 10 [2022-12-13 16:57:35,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:57:35,531 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-12-13 16:57:35,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:35,532 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-12-13 16:57:35,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 16:57:35,532 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:57:35,533 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:57:35,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 16:57:35,533 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:57:35,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:57:35,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1732647764, now seen corresponding path program 1 times [2022-12-13 16:57:35,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:57:35,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134593304] [2022-12-13 16:57:35,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:35,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:57:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:35,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:57:35,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:57:35,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134593304] [2022-12-13 16:57:35,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134593304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:57:35,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:57:35,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:57:35,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936821065] [2022-12-13 16:57:35,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:57:35,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:57:35,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:57:35,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:57:35,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:57:35,724 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:35,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:57:35,763 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-12-13 16:57:35,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:57:35,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-13 16:57:35,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:57:35,764 INFO L225 Difference]: With dead ends: 37 [2022-12-13 16:57:35,764 INFO L226 Difference]: Without dead ends: 22 [2022-12-13 16:57:35,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:57:35,766 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:57:35,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 49 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:57:35,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-12-13 16:57:35,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-12-13 16:57:35,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:35,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-12-13 16:57:35,772 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 16 [2022-12-13 16:57:35,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:57:35,772 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-12-13 16:57:35,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:35,773 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-12-13 16:57:35,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-13 16:57:35,773 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:57:35,773 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:57:35,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 16:57:35,774 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:57:35,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:57:35,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1155103498, now seen corresponding path program 1 times [2022-12-13 16:57:35,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:57:35,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899566765] [2022-12-13 16:57:35,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:35,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:57:35,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:35,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:57:35,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:57:35,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899566765] [2022-12-13 16:57:35,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899566765] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:57:35,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233568021] [2022-12-13 16:57:35,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:35,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:57:35,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:57:35,915 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:57:35,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 16:57:35,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:35,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 16:57:35,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:57:36,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:57:36,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:57:36,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:57:36,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233568021] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:57:36,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 16:57:36,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-12-13 16:57:36,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197165567] [2022-12-13 16:57:36,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 16:57:36,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 16:57:36,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:57:36,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 16:57:36,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:57:36,110 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:36,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:57:36,174 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-12-13 16:57:36,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:57:36,175 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-13 16:57:36,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:57:36,175 INFO L225 Difference]: With dead ends: 44 [2022-12-13 16:57:36,175 INFO L226 Difference]: Without dead ends: 29 [2022-12-13 16:57:36,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:57:36,177 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 23 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:57:36,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 90 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:57:36,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-12-13 16:57:36,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2022-12-13 16:57:36,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:36,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-12-13 16:57:36,181 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 18 [2022-12-13 16:57:36,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:57:36,182 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-12-13 16:57:36,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:36,182 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-12-13 16:57:36,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 16:57:36,182 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:57:36,183 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:57:36,189 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 16:57:36,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:57:36,384 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:57:36,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:57:36,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1735193064, now seen corresponding path program 2 times [2022-12-13 16:57:36,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:57:36,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117727386] [2022-12-13 16:57:36,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:36,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:57:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:37,212 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:57:37,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:57:37,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117727386] [2022-12-13 16:57:37,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117727386] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:57:37,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77132490] [2022-12-13 16:57:37,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 16:57:37,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:57:37,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:57:37,214 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:57:37,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 16:57:37,262 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 16:57:37,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 16:57:37,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 16:57:37,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:57:37,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-12-13 16:57:37,494 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:57:37,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-12-13 16:57:37,508 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 16:57:37,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:57:37,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2022-12-13 16:57:37,650 INFO L321 Elim1Store]: treesize reduction 5, result has 76.2 percent of original size [2022-12-13 16:57:37,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 82 [2022-12-13 16:57:37,724 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 16:57:37,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77132490] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:57:37,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 16:57:37,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 25 [2022-12-13 16:57:37,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273077201] [2022-12-13 16:57:37,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 16:57:37,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-13 16:57:37,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:57:37,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 16:57:37,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2022-12-13 16:57:37,726 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:38,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:57:38,266 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-12-13 16:57:38,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 16:57:38,267 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-13 16:57:38,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:57:38,268 INFO L225 Difference]: With dead ends: 86 [2022-12-13 16:57:38,268 INFO L226 Difference]: Without dead ends: 73 [2022-12-13 16:57:38,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=421, Invalid=1471, Unknown=0, NotChecked=0, Total=1892 [2022-12-13 16:57:38,269 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 167 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:57:38,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 119 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 16:57:38,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-12-13 16:57:38,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 35. [2022-12-13 16:57:38,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:38,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2022-12-13 16:57:38,275 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 20 [2022-12-13 16:57:38,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:57:38,275 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2022-12-13 16:57:38,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:38,275 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-12-13 16:57:38,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-13 16:57:38,276 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:57:38,276 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:57:38,281 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 16:57:38,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:57:38,477 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:57:38,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:57:38,477 INFO L85 PathProgramCache]: Analyzing trace with hash -816173062, now seen corresponding path program 1 times [2022-12-13 16:57:38,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:57:38,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122303348] [2022-12-13 16:57:38,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:38,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:57:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:39,145 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:57:39,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:57:39,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122303348] [2022-12-13 16:57:39,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122303348] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:57:39,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062626848] [2022-12-13 16:57:39,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:39,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:57:39,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:57:39,146 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:57:39,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 16:57:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:39,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 16:57:39,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:57:39,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2022-12-13 16:57:39,467 INFO L321 Elim1Store]: treesize reduction 73, result has 14.1 percent of original size [2022-12-13 16:57:39,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 33 [2022-12-13 16:57:39,611 INFO L321 Elim1Store]: treesize reduction 50, result has 12.3 percent of original size [2022-12-13 16:57:39,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 18 [2022-12-13 16:57:39,635 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 16:57:39,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:57:39,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2022-12-13 16:57:39,913 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-12-13 16:57:39,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 681 treesize of output 621 [2022-12-13 16:57:40,075 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 16:57:40,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062626848] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:57:40,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 16:57:40,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 10] total 32 [2022-12-13 16:57:40,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575345663] [2022-12-13 16:57:40,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 16:57:40,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 16:57:40,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:57:40,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 16:57:40,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=849, Unknown=0, NotChecked=0, Total=992 [2022-12-13 16:57:40,077 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 32 states, 32 states have (on average 1.6875) internal successors, (54), 32 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:50,360 WARN L233 SmtUtils]: Spent 10.08s on a formula simplification. DAG size of input: 42 DAG size of output: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:57:57,246 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#v~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| 4))) (and (forall ((v_ArrVal_61 Int)) (or (let ((.cse0 (store .cse2 (+ .cse3 |c_ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_61))) (< (select .cse0 |c_ULTIMATE.start_main_~#v~0#1.offset|) (+ (select .cse0 .cse1) 1))) (not (<= v_ArrVal_61 |c_ULTIMATE.start_main_~key~0#1|)))) (= |c_ULTIMATE.start_main_~j~0#1| 1) (or (= .cse3 0) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) 0)) (< (select .cse2 |c_ULTIMATE.start_main_~#v~0#1.offset|) (+ (select .cse2 .cse1) 1)) (= |c_ULTIMATE.start_main_~#v~0#1.offset| 0))) is different from false [2022-12-13 16:58:05,454 WARN L233 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 38 DAG size of output: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:58:29,724 WARN L233 SmtUtils]: Spent 18.08s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:59:39,746 WARN L233 SmtUtils]: Spent 1.17m on a formula simplification. DAG size of input: 58 DAG size of output: 56 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:00:09,378 WARN L233 SmtUtils]: Spent 23.46s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:00:13,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:00:15,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:00:17,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:00:23,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:00:26,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 17:00:28,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:00:30,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:00:50,328 WARN L233 SmtUtils]: Spent 20.09s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:00:57,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-13 17:00:59,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:00:59,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:00:59,939 INFO L93 Difference]: Finished difference Result 126 states and 159 transitions. [2022-12-13 17:00:59,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-12-13 17:00:59,940 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.6875) internal successors, (54), 32 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-13 17:00:59,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:00:59,941 INFO L225 Difference]: With dead ends: 126 [2022-12-13 17:00:59,941 INFO L226 Difference]: Without dead ends: 103 [2022-12-13 17:00:59,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1388 ImplicationChecksByTransitivity, 181.8s TimeCoverageRelationStatistics Valid=697, Invalid=3994, Unknown=5, NotChecked=134, Total=4830 [2022-12-13 17:00:59,944 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 165 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 36 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 18.6s IncrementalHoareTripleChecker+Time [2022-12-13 17:00:59,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 186 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 506 Invalid, 8 Unknown, 1 Unchecked, 18.6s Time] [2022-12-13 17:00:59,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-12-13 17:00:59,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 43. [2022-12-13 17:00:59,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:00:59,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2022-12-13 17:00:59,955 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 23 [2022-12-13 17:00:59,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:00:59,955 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2022-12-13 17:00:59,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.6875) internal successors, (54), 32 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:00:59,955 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-12-13 17:00:59,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 17:00:59,956 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:00:59,956 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:00:59,961 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 17:01:00,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-13 17:01:00,157 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:01:00,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:01:00,157 INFO L85 PathProgramCache]: Analyzing trace with hash 726796030, now seen corresponding path program 1 times [2022-12-13 17:01:00,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:01:00,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738228160] [2022-12-13 17:01:00,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:01:00,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:01:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:01:00,305 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 17:01:00,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:01:00,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738228160] [2022-12-13 17:01:00,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738228160] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:01:00,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664269478] [2022-12-13 17:01:00,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:01:00,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:01:00,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:01:00,306 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:01:00,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 17:01:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:01:00,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 17:01:00,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:01:00,435 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 17:01:00,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:01:00,547 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 17:01:00,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664269478] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:01:00,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:01:00,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2022-12-13 17:01:00,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675316956] [2022-12-13 17:01:00,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:01:00,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 17:01:00,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:01:00,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 17:01:00,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-12-13 17:01:00,550 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:01:00,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:01:00,677 INFO L93 Difference]: Finished difference Result 125 states and 157 transitions. [2022-12-13 17:01:00,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 17:01:00,678 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-13 17:01:00,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:01:00,678 INFO L225 Difference]: With dead ends: 125 [2022-12-13 17:01:00,678 INFO L226 Difference]: Without dead ends: 74 [2022-12-13 17:01:00,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-12-13 17:01:00,679 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 76 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 17:01:00,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 145 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 17:01:00,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-12-13 17:01:00,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 55. [2022-12-13 17:01:00,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 54 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:01:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-12-13 17:01:00,687 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 24 [2022-12-13 17:01:00,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:01:00,687 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-12-13 17:01:00,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:01:00,687 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-12-13 17:01:00,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 17:01:00,687 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:01:00,687 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:01:00,692 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 17:01:00,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:01:00,889 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:01:00,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:01:00,890 INFO L85 PathProgramCache]: Analyzing trace with hash -99901895, now seen corresponding path program 3 times [2022-12-13 17:01:00,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:01:00,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420582514] [2022-12-13 17:01:00,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:01:00,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:01:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:01:01,725 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:01:01,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:01:01,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420582514] [2022-12-13 17:01:01,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420582514] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:01:01,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595377595] [2022-12-13 17:01:01,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 17:01:01,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:01:01,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:01:01,727 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:01:01,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 17:01:01,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 17:01:01,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:01:01,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 17:01:01,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:01:01,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2022-12-13 17:01:02,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:01:02,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:01:02,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:01:02,003 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:01:02,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-12-13 17:01:02,035 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:01:02,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-12-13 17:01:02,048 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 17:01:02,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:01:04,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 53 [2022-12-13 17:01:04,471 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:01:04,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 687 treesize of output 653 [2022-12-13 17:01:06,047 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 17:01:06,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595377595] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:01:06,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:01:06,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 33 [2022-12-13 17:01:06,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314286306] [2022-12-13 17:01:06,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:01:06,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-13 17:01:06,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:01:06,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-13 17:01:06,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=899, Unknown=1, NotChecked=0, Total=1056 [2022-12-13 17:01:06,050 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 33 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 33 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:01:32,613 WARN L233 SmtUtils]: Spent 24.30s on a formula simplification. DAG size of input: 36 DAG size of output: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:01:45,173 WARN L233 SmtUtils]: Spent 10.30s on a formula simplification. DAG size of input: 31 DAG size of output: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:02:01,781 WARN L233 SmtUtils]: Spent 12.30s on a formula simplification. DAG size of input: 31 DAG size of output: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:02:12,236 WARN L233 SmtUtils]: Spent 10.23s on a formula simplification. DAG size of input: 36 DAG size of output: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:02:24,672 WARN L233 SmtUtils]: Spent 12.23s on a formula simplification. DAG size of input: 40 DAG size of output: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:02:47,497 WARN L233 SmtUtils]: Spent 10.17s on a formula simplification. DAG size of input: 33 DAG size of output: 31 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:02:59,949 WARN L233 SmtUtils]: Spent 10.25s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:03:12,226 WARN L233 SmtUtils]: Spent 12.25s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:03:28,959 WARN L233 SmtUtils]: Spent 10.26s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:03:31,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:03:31,929 INFO L93 Difference]: Finished difference Result 176 states and 212 transitions. [2022-12-13 17:03:31,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-12-13 17:03:31,929 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 33 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-13 17:03:31,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:03:31,930 INFO L225 Difference]: With dead ends: 176 [2022-12-13 17:03:31,930 INFO L226 Difference]: Without dead ends: 145 [2022-12-13 17:03:31,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 37 SyntacticMatches, 6 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1575 ImplicationChecksByTransitivity, 147.6s TimeCoverageRelationStatistics Valid=777, Invalid=4472, Unknown=7, NotChecked=0, Total=5256 [2022-12-13 17:03:31,932 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 385 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 17:03:31,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 294 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 17:03:31,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-12-13 17:03:31,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 61. [2022-12-13 17:03:31,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 60 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:03:31,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2022-12-13 17:03:31,941 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 28 [2022-12-13 17:03:31,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:03:31,941 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2022-12-13 17:03:31,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 33 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:03:31,942 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-12-13 17:03:31,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-13 17:03:31,942 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:03:31,942 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:03:31,946 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 17:03:32,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:03:32,144 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:03:32,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:03:32,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1702821809, now seen corresponding path program 2 times [2022-12-13 17:03:32,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:03:32,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866813405] [2022-12-13 17:03:32,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:03:32,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:03:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:03:32,943 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:03:32,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:03:32,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866813405] [2022-12-13 17:03:32,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866813405] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:03:32,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227355967] [2022-12-13 17:03:32,944 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 17:03:32,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:03:32,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:03:32,945 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:03:32,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0acc8c66-c529-4395-b990-826be98e51ab/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 17:03:32,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 17:03:32,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:03:32,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-13 17:03:32,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:03:33,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:03:33,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2022-12-13 17:03:33,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:03:33,274 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 17:03:33,276 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:03:33,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2022-12-13 17:03:33,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:03:33,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:03:33,366 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:03:33,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2022-12-13 17:03:33,411 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 17:03:33,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2022-12-13 17:03:33,432 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 17:03:33,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:03:42,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 81 [2022-12-13 17:03:42,117 INFO L321 Elim1Store]: treesize reduction 11, result has 47.6 percent of original size [2022-12-13 17:03:42,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 10903 treesize of output 10517 [2022-12-13 17:03:56,231 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 10 refuted. 2 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 17:03:56,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227355967] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:03:56,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:03:56,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 14] total 34 [2022-12-13 17:03:56,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116273906] [2022-12-13 17:03:56,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:03:56,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-13 17:03:56,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:03:56,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 17:03:56,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=948, Unknown=6, NotChecked=0, Total=1122 [2022-12-13 17:03:56,233 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 34 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 34 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:04:04,674 WARN L233 SmtUtils]: Spent 8.10s on a formula simplification. DAG size of input: 43 DAG size of output: 42 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:04:16,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:04:42,681 WARN L233 SmtUtils]: Spent 20.26s on a formula simplification. DAG size of input: 54 DAG size of output: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:04:51,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:05:32,449 WARN L233 SmtUtils]: Spent 38.64s on a formula simplification. DAG size of input: 52 DAG size of output: 42 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:05:34,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:05:36,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:05:38,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:05:40,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:05:42,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:06:31,012 WARN L233 SmtUtils]: Spent 44.20s on a formula simplification. DAG size of input: 67 DAG size of output: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:06:47,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:06:49,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:06:52,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:06:54,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:06:56,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:06:58,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:07:39,087 WARN L233 SmtUtils]: Spent 24.44s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:07:41,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:07:43,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:07:45,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:07:47,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:07:49,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:07:51,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:07:53,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:07:55,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:07:57,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:07:59,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:08:01,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:08:03,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:08:05,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:08:09,939 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| 4)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#v~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| .cse2 4))) (and (let ((.cse1 (* 4 |c_ULTIMATE.start_main_~k~0#1|))) (< (select .cse0 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| (- 4) .cse1)) (+ (select .cse0 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| .cse1)) 1))) (or (not (<= 0 |c_ULTIMATE.start_main_~i~0#1|)) (< 0 |c_ULTIMATE.start_main_~i~0#1|) (and (not (= .cse2 0)) (not (= (+ .cse2 4) 0)))) (forall ((v_ArrVal_139 Int)) (let ((.cse3 (store .cse0 .cse5 v_ArrVal_139))) (< (select .cse3 |c_ULTIMATE.start_main_~#v~0#1.offset|) (+ (select .cse3 .cse4) 1)))) (forall ((v_ArrVal_139 Int)) (let ((.cse6 (store .cse0 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| .cse2) v_ArrVal_139))) (< (select .cse6 |c_ULTIMATE.start_main_~#v~0#1.offset|) (+ (select .cse6 .cse4) 1)))) (forall ((v_ArrVal_137 Int) (v_ArrVal_139 Int)) (or (let ((.cse7 (store (store .cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_137) .cse5 v_ArrVal_139))) (< (select .cse7 |c_ULTIMATE.start_main_~#v~0#1.offset|) (+ (select .cse7 .cse4) 1))) (not (<= v_ArrVal_137 |c_ULTIMATE.start_main_~key~0#1|)))) (= |c_ULTIMATE.start_main_~#v~0#1.offset| 0)))) is different from false [2022-12-13 17:08:11,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:08:13,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:08:16,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:08:18,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:08:20,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:08:22,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:09:53,805 WARN L233 SmtUtils]: Spent 1.26m on a formula simplification. DAG size of input: 51 DAG size of output: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:09:55,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:10:53,288 WARN L233 SmtUtils]: Spent 45.30s on a formula simplification. DAG size of input: 73 DAG size of output: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:10:57,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:10:59,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:11:01,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:11:43,314 WARN L233 SmtUtils]: Spent 41.49s on a formula simplification. DAG size of input: 67 DAG size of output: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 17:11:45,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 17:11:47,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]