./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows 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_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/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_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cac2372de612a50e6cea0e2672ab51101a6ffa3bb2603a06b5c5aa59090db116 --- 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 13:27:09,347 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:27:09,349 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:27:09,363 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:27:09,363 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:27:09,364 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:27:09,364 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:27:09,365 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:27:09,366 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:27:09,367 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:27:09,368 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:27:09,369 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:27:09,369 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:27:09,369 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:27:09,370 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:27:09,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:27:09,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:27:09,372 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:27:09,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:27:09,374 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:27:09,375 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:27:09,376 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:27:09,377 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:27:09,377 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:27:09,380 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:27:09,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:27:09,380 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:27:09,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:27:09,381 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:27:09,382 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:27:09,382 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:27:09,382 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:27:09,383 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:27:09,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:27:09,384 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:27:09,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:27:09,385 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:27:09,385 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:27:09,385 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:27:09,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:27:09,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:27:09,387 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-12-13 13:27:09,402 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:27:09,403 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:27:09,403 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:27:09,403 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:27:09,403 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 13:27:09,404 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 13:27:09,404 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:27:09,404 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:27:09,404 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:27:09,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:27:09,405 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:27:09,405 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 13:27:09,405 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:27:09,405 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:27:09,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:27:09,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 13:27:09,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:27:09,405 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 13:27:09,405 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-13 13:27:09,406 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:27:09,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:27:09,406 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:27:09,406 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 13:27:09,406 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:27:09,406 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:27:09,406 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:27:09,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:27:09,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:27:09,407 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:27:09,407 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 13:27:09,407 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:27:09,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:27:09,407 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 13:27:09,407 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 13:27:09,407 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 13:27:09,407 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 13:27:09,408 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 13:27:09,408 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_dff4c068-413f-4e44-9745-76eb58129161/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_dff4c068-413f-4e44-9745-76eb58129161/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 ! overflow) ) 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 -> cac2372de612a50e6cea0e2672ab51101a6ffa3bb2603a06b5c5aa59090db116 [2022-12-13 13:27:09,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:27:09,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:27:09,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:27:09,595 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:27:09,595 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:27:09,596 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2022-12-13 13:27:12,094 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:27:12,276 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:27:12,276 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2022-12-13 13:27:12,286 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/data/b5b0bc64c/e58298247dff44878da4cedde24cbf39/FLAG1586783f7 [2022-12-13 13:27:12,298 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/data/b5b0bc64c/e58298247dff44878da4cedde24cbf39 [2022-12-13 13:27:12,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:27:12,302 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:27:12,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:27:12,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:27:12,307 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:27:12,307 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:27:12" (1/1) ... [2022-12-13 13:27:12,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79dd9ad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:12, skipping insertion in model container [2022-12-13 13:27:12,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:27:12" (1/1) ... [2022-12-13 13:27:12,314 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:27:12,339 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:27:12,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:27:12,574 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:27:12,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:27:12,653 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:27:12,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:12 WrapperNode [2022-12-13 13:27:12,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:27:12,655 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:27:12,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:27:12,655 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:27:12,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:12" (1/1) ... [2022-12-13 13:27:12,678 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:12" (1/1) ... [2022-12-13 13:27:12,702 INFO L138 Inliner]: procedures = 166, calls = 73, calls flagged for inlining = 25, calls inlined = 19, statements flattened = 125 [2022-12-13 13:27:12,702 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:27:12,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:27:12,703 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:27:12,703 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:27:12,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:12" (1/1) ... [2022-12-13 13:27:12,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:12" (1/1) ... [2022-12-13 13:27:12,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:12" (1/1) ... [2022-12-13 13:27:12,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:12" (1/1) ... [2022-12-13 13:27:12,725 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:12" (1/1) ... [2022-12-13 13:27:12,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:12" (1/1) ... [2022-12-13 13:27:12,730 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:12" (1/1) ... [2022-12-13 13:27:12,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:12" (1/1) ... [2022-12-13 13:27:12,734 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:27:12,735 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:27:12,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:27:12,736 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:27:12,736 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:12" (1/1) ... [2022-12-13 13:27:12,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:27:12,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:27:12,764 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:27:12,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:27:12,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 13:27:12,806 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-12-13 13:27:12,807 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-12-13 13:27:12,807 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-12-13 13:27:12,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-12-13 13:27:12,807 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2022-12-13 13:27:12,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2022-12-13 13:27:12,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 13:27:12,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 13:27:12,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:27:12,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 13:27:12,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 13:27:12,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:27:12,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 13:27:12,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:27:12,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:27:12,925 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:27:12,927 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:27:13,100 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:27:13,107 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:27:13,108 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 13:27:13,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:27:13 BoogieIcfgContainer [2022-12-13 13:27:13,109 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:27:13,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:27:13,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:27:13,115 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:27:13,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:27:12" (1/3) ... [2022-12-13 13:27:13,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41f85ee6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:27:13, skipping insertion in model container [2022-12-13 13:27:13,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:27:12" (2/3) ... [2022-12-13 13:27:13,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41f85ee6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:27:13, skipping insertion in model container [2022-12-13 13:27:13,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:27:13" (3/3) ... [2022-12-13 13:27:13,119 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3-1.i [2022-12-13 13:27:13,138 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:27:13,138 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-12-13 13:27:13,190 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:27:13,196 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;@35e06dde, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 13:27:13,197 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 13:27:13,201 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 47 states have internal predecessors, (55), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-13 13:27:13,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-13 13:27:13,209 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:27:13,210 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:27:13,211 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 13:27:13,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:13,216 INFO L85 PathProgramCache]: Analyzing trace with hash -846947467, now seen corresponding path program 1 times [2022-12-13 13:27:13,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:13,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793940402] [2022-12-13 13:27:13,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:13,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:13,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:27:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:13,475 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 13:27:13,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:27:13,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793940402] [2022-12-13 13:27:13,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793940402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:27:13,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:27:13,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:27:13,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970133348] [2022-12-13 13:27:13,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:27:13,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:27:13,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:27:13,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:27:13,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:27:13,506 INFO L87 Difference]: Start difference. First operand has 54 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 47 states have internal predecessors, (55), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 13:27:13,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:27:13,645 INFO L93 Difference]: Finished difference Result 122 states and 145 transitions. [2022-12-13 13:27:13,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:27:13,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-12-13 13:27:13,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:27:13,653 INFO L225 Difference]: With dead ends: 122 [2022-12-13 13:27:13,653 INFO L226 Difference]: Without dead ends: 80 [2022-12-13 13:27:13,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:27:13,658 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 44 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:27:13,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 267 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:27:13,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-12-13 13:27:13,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 54. [2022-12-13 13:27:13,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 47 states have internal predecessors, (55), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 13:27:13,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-12-13 13:27:13,688 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 12 [2022-12-13 13:27:13,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:27:13,688 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-12-13 13:27:13,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 13:27:13,689 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-12-13 13:27:13,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-13 13:27:13,689 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:27:13,689 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:27:13,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:27:13,689 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 13:27:13,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:13,690 INFO L85 PathProgramCache]: Analyzing trace with hash 895862868, now seen corresponding path program 1 times [2022-12-13 13:27:13,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:13,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958656052] [2022-12-13 13:27:13,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:13,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:13,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:27:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:13,819 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 13:27:13,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:27:13,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958656052] [2022-12-13 13:27:13,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958656052] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:27:13,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:27:13,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:27:13,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115707964] [2022-12-13 13:27:13,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:27:13,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:27:13,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:27:13,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:27:13,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:27:13,823 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 13:27:13,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:27:13,931 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2022-12-13 13:27:13,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:27:13,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-12-13 13:27:13,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:27:13,933 INFO L225 Difference]: With dead ends: 100 [2022-12-13 13:27:13,933 INFO L226 Difference]: Without dead ends: 72 [2022-12-13 13:27:13,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:27:13,935 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 32 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:27:13,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 148 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:27:13,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-12-13 13:27:13,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 56. [2022-12-13 13:27:13,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 49 states have internal predecessors, (57), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 13:27:13,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2022-12-13 13:27:13,944 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 12 [2022-12-13 13:27:13,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:27:13,945 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2022-12-13 13:27:13,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 13:27:13,945 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2022-12-13 13:27:13,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 13:27:13,946 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:27:13,946 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:27:13,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:27:13,946 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 13:27:13,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:13,947 INFO L85 PathProgramCache]: Analyzing trace with hash 366281122, now seen corresponding path program 1 times [2022-12-13 13:27:13,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:13,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822117290] [2022-12-13 13:27:13,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:13,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:14,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:27:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:14,060 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 13:27:14,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:27:14,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822117290] [2022-12-13 13:27:14,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822117290] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:27:14,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:27:14,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 13:27:14,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131222606] [2022-12-13 13:27:14,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:27:14,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:27:14,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:27:14,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:27:14,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:27:14,063 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 13:27:14,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:27:14,164 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2022-12-13 13:27:14,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:27:14,165 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-12-13 13:27:14,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:27:14,166 INFO L225 Difference]: With dead ends: 113 [2022-12-13 13:27:14,166 INFO L226 Difference]: Without dead ends: 82 [2022-12-13 13:27:14,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:27:14,168 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 57 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:27:14,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 278 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:27:14,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-12-13 13:27:14,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 59. [2022-12-13 13:27:14,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.297872340425532) internal successors, (61), 52 states have internal predecessors, (61), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 13:27:14,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2022-12-13 13:27:14,177 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 16 [2022-12-13 13:27:14,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:27:14,177 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2022-12-13 13:27:14,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 13:27:14,178 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-12-13 13:27:14,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 13:27:14,178 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:27:14,179 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:27:14,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 13:27:14,179 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 13:27:14,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:14,179 INFO L85 PathProgramCache]: Analyzing trace with hash 495363841, now seen corresponding path program 1 times [2022-12-13 13:27:14,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:14,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083333791] [2022-12-13 13:27:14,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:14,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:14,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:27:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:14,278 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 13:27:14,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:27:14,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083333791] [2022-12-13 13:27:14,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083333791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:27:14,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:27:14,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:27:14,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364717203] [2022-12-13 13:27:14,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:27:14,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:27:14,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:27:14,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:27:14,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:27:14,281 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 13:27:14,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:27:14,368 INFO L93 Difference]: Finished difference Result 107 states and 124 transitions. [2022-12-13 13:27:14,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:27:14,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-12-13 13:27:14,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:27:14,370 INFO L225 Difference]: With dead ends: 107 [2022-12-13 13:27:14,370 INFO L226 Difference]: Without dead ends: 66 [2022-12-13 13:27:14,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:27:14,372 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 24 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:27:14,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 183 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:27:14,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-12-13 13:27:14,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2022-12-13 13:27:14,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.25) internal successors, (55), 49 states have internal predecessors, (55), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 13:27:14,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2022-12-13 13:27:14,379 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 16 [2022-12-13 13:27:14,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:27:14,379 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2022-12-13 13:27:14,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 13:27:14,379 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-12-13 13:27:14,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-13 13:27:14,380 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:27:14,380 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 13:27:14,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 13:27:14,380 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 13:27:14,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:14,381 INFO L85 PathProgramCache]: Analyzing trace with hash -835975854, now seen corresponding path program 1 times [2022-12-13 13:27:14,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:14,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246365803] [2022-12-13 13:27:14,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:14,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:14,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:27:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:14,486 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 13:27:14,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:27:14,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246365803] [2022-12-13 13:27:14,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246365803] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:27:14,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:27:14,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 13:27:14,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928615610] [2022-12-13 13:27:14,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:27:14,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:27:14,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:27:14,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:27:14,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:27:14,489 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 13:27:14,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:27:14,627 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2022-12-13 13:27:14,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:27:14,628 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-12-13 13:27:14,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:27:14,628 INFO L225 Difference]: With dead ends: 90 [2022-12-13 13:27:14,628 INFO L226 Difference]: Without dead ends: 56 [2022-12-13 13:27:14,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-12-13 13:27:14,629 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 36 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:27:14,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 255 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:27:14,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-12-13 13:27:14,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2022-12-13 13:27:14,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 44 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 13:27:14,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2022-12-13 13:27:14,633 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 18 [2022-12-13 13:27:14,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:27:14,633 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2022-12-13 13:27:14,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 13:27:14,633 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2022-12-13 13:27:14,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-13 13:27:14,634 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:27:14,634 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 13:27:14,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 13:27:14,634 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 13:27:14,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:14,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1292786891, now seen corresponding path program 1 times [2022-12-13 13:27:14,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:14,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881393932] [2022-12-13 13:27:14,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:14,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:14,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:27:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:14,707 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 13:27:14,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:27:14,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881393932] [2022-12-13 13:27:14,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881393932] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:27:14,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:27:14,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 13:27:14,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888785321] [2022-12-13 13:27:14,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:27:14,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:27:14,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:27:14,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:27:14,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:27:14,709 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 13:27:14,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:27:14,807 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2022-12-13 13:27:14,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:27:14,808 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-12-13 13:27:14,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:27:14,808 INFO L225 Difference]: With dead ends: 86 [2022-12-13 13:27:14,808 INFO L226 Difference]: Without dead ends: 54 [2022-12-13 13:27:14,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:27:14,810 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 70 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:27:14,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 151 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:27:14,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-12-13 13:27:14,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2022-12-13 13:27:14,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 43 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 13:27:14,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-12-13 13:27:14,815 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 18 [2022-12-13 13:27:14,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:27:14,816 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-12-13 13:27:14,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 13:27:14,816 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-12-13 13:27:14,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-13 13:27:14,816 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:27:14,816 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:27:14,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 13:27:14,817 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 13:27:14,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:14,817 INFO L85 PathProgramCache]: Analyzing trace with hash 259861478, now seen corresponding path program 1 times [2022-12-13 13:27:14,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:14,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482627088] [2022-12-13 13:27:14,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:14,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:14,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:27:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:14,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 13:27:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:14,932 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 13:27:14,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:27:14,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482627088] [2022-12-13 13:27:14,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482627088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:27:14,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:27:14,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:27:14,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634831517] [2022-12-13 13:27:14,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:27:14,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:27:14,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:27:14,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:27:14,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:27:14,934 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 13:27:15,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:27:15,010 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-12-13 13:27:15,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:27:15,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-12-13 13:27:15,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:27:15,012 INFO L225 Difference]: With dead ends: 97 [2022-12-13 13:27:15,012 INFO L226 Difference]: Without dead ends: 57 [2022-12-13 13:27:15,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:27:15,013 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 26 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:27:15,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 115 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:27:15,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-12-13 13:27:15,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2022-12-13 13:27:15,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.225) internal successors, (49), 44 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 13:27:15,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2022-12-13 13:27:15,020 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 23 [2022-12-13 13:27:15,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:27:15,020 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2022-12-13 13:27:15,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 13:27:15,020 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-12-13 13:27:15,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 13:27:15,021 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:27:15,021 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:27:15,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 13:27:15,021 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 13:27:15,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:15,022 INFO L85 PathProgramCache]: Analyzing trace with hash 451023015, now seen corresponding path program 1 times [2022-12-13 13:27:15,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:15,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411818834] [2022-12-13 13:27:15,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:15,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:15,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:27:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:15,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 13:27:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:15,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:27:15,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:27:15,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411818834] [2022-12-13 13:27:15,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411818834] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:27:15,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831571969] [2022-12-13 13:27:15,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:15,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:27:15,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:27:15,148 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:27:15,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 13:27:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:15,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 91 conjunts are in the unsatisfiable core [2022-12-13 13:27:15,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:27:15,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 13:27:15,446 WARN L859 $PredicateComparison]: unable to prove that (exists ((LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_107 Int) (v_ArrVal_106 Int)) (and (= (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_107) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_106)) |c_#memory_int|) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2022-12-13 13:27:15,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:27:15,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:27:15,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-12-13 13:27:15,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 13:27:15,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:27:15,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:27:15,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831571969] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:27:15,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:27:15,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 18 [2022-12-13 13:27:15,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546504717] [2022-12-13 13:27:15,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:27:15,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 13:27:15,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:27:15,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 13:27:15,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=234, Unknown=1, NotChecked=30, Total=306 [2022-12-13 13:27:15,566 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 13:27:15,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:27:15,801 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2022-12-13 13:27:15,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 13:27:15,802 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-12-13 13:27:15,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:27:15,802 INFO L225 Difference]: With dead ends: 63 [2022-12-13 13:27:15,802 INFO L226 Difference]: Without dead ends: 62 [2022-12-13 13:27:15,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=471, Unknown=1, NotChecked=44, Total=600 [2022-12-13 13:27:15,804 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 69 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:27:15,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 265 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 207 Invalid, 0 Unknown, 69 Unchecked, 0.1s Time] [2022-12-13 13:27:15,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-12-13 13:27:15,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2022-12-13 13:27:15,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 13:27:15,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-12-13 13:27:15,811 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 24 [2022-12-13 13:27:15,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:27:15,811 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-12-13 13:27:15,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 13:27:15,812 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-12-13 13:27:15,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 13:27:15,812 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:27:15,812 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:27:15,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 13:27:16,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-13 13:27:16,013 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 13:27:16,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:16,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1096811657, now seen corresponding path program 1 times [2022-12-13 13:27:16,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:16,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667504101] [2022-12-13 13:27:16,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:16,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:16,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:27:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:16,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 13:27:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:16,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:27:16,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:27:16,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667504101] [2022-12-13 13:27:16,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667504101] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:27:16,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456627125] [2022-12-13 13:27:16,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:16,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:27:16,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:27:16,157 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:27:16,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 13:27:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:16,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 91 conjunts are in the unsatisfiable core [2022-12-13 13:27:16,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:27:16,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 13:27:16,357 WARN L859 $PredicateComparison]: unable to prove that (exists ((LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_174 Int) (v_ArrVal_171 Int)) (and (= (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_174) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_171)) |c_#memory_int|) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2022-12-13 13:27:16,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:27:16,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:27:16,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-12-13 13:27:16,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 13:27:16,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:27:16,460 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:27:16,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456627125] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:27:16,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:27:16,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 18 [2022-12-13 13:27:16,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388392354] [2022-12-13 13:27:16,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:27:16,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 13:27:16,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:27:16,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 13:27:16,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=234, Unknown=1, NotChecked=30, Total=306 [2022-12-13 13:27:16,462 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 13:27:16,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:27:16,672 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-12-13 13:27:16,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 13:27:16,673 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-12-13 13:27:16,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:27:16,673 INFO L225 Difference]: With dead ends: 58 [2022-12-13 13:27:16,673 INFO L226 Difference]: Without dead ends: 57 [2022-12-13 13:27:16,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=430, Unknown=1, NotChecked=42, Total=552 [2022-12-13 13:27:16,674 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 53 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:27:16,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 309 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 220 Invalid, 0 Unknown, 63 Unchecked, 0.1s Time] [2022-12-13 13:27:16,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-12-13 13:27:16,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2022-12-13 13:27:16,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 13:27:16,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2022-12-13 13:27:16,681 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 25 [2022-12-13 13:27:16,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:27:16,682 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2022-12-13 13:27:16,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 13:27:16,682 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-12-13 13:27:16,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-13 13:27:16,683 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:27:16,683 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:27:16,688 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 13:27:16,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:27:16,884 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 13:27:16,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:16,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1913158811, now seen corresponding path program 1 times [2022-12-13 13:27:16,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:16,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930256115] [2022-12-13 13:27:16,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:16,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:17,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:27:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:17,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 13:27:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:17,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:27:17,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:27:17,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930256115] [2022-12-13 13:27:17,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930256115] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:27:17,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:27:17,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 13:27:17,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383001775] [2022-12-13 13:27:17,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:27:17,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:27:17,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:27:17,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:27:17,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:27:17,126 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 13:27:17,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:27:17,257 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-12-13 13:27:17,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:27:17,257 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-12-13 13:27:17,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:27:17,258 INFO L225 Difference]: With dead ends: 77 [2022-12-13 13:27:17,258 INFO L226 Difference]: Without dead ends: 55 [2022-12-13 13:27:17,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-12-13 13:27:17,258 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 56 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:27:17,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 147 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:27:17,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-12-13 13:27:17,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2022-12-13 13:27:17,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 13:27:17,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2022-12-13 13:27:17,263 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 30 [2022-12-13 13:27:17,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:27:17,263 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2022-12-13 13:27:17,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 13:27:17,263 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-12-13 13:27:17,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-13 13:27:17,264 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:27:17,264 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:27:17,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 13:27:17,264 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 13:27:17,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:17,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1920244181, now seen corresponding path program 1 times [2022-12-13 13:27:17,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:17,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710488421] [2022-12-13 13:27:17,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:17,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:17,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:27:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:17,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 13:27:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:17,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:27:17,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:27:17,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710488421] [2022-12-13 13:27:17,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710488421] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:27:17,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352593922] [2022-12-13 13:27:17,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:17,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:27:17,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:27:17,378 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:27:17,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 13:27:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:17,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 148 conjunts are in the unsatisfiable core [2022-12-13 13:27:17,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:27:17,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 13:27:17,595 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_286 Int) (v_ArrVal_285 Int) (LDV_INIT_LIST_HEAD_~list.offset Int)) (and (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (= |c_#memory_int| (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_285) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_286))))) is different from true [2022-12-13 13:27:17,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:27:17,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:27:17,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-12-13 13:27:17,722 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:27:17,725 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:27:17,725 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 1 case distinctions, treesize of input 32 treesize of output 28 [2022-12-13 13:27:17,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 13:27:17,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:27:17,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:27:18,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352593922] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:27:18,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 13:27:18,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 19] total 24 [2022-12-13 13:27:18,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743217782] [2022-12-13 13:27:18,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 13:27:18,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 13:27:18,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:27:18,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 13:27:18,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=968, Unknown=1, NotChecked=62, Total=1122 [2022-12-13 13:27:18,230 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 19 states have internal predecessors, (56), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 13:27:27,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:27:27,049 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2022-12-13 13:27:27,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 13:27:27,049 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 19 states have internal predecessors, (56), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2022-12-13 13:27:27,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:27:27,050 INFO L225 Difference]: With dead ends: 103 [2022-12-13 13:27:27,050 INFO L226 Difference]: Without dead ends: 63 [2022-12-13 13:27:27,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=260, Invalid=1994, Unknown=6, NotChecked=92, Total=2352 [2022-12-13 13:27:27,051 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 145 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 13:27:27,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 247 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 654 Invalid, 0 Unknown, 53 Unchecked, 0.3s Time] [2022-12-13 13:27:27,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-12-13 13:27:27,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2022-12-13 13:27:27,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 48 states have internal predecessors, (52), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 13:27:27,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2022-12-13 13:27:27,056 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 34 [2022-12-13 13:27:27,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:27:27,056 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2022-12-13 13:27:27,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 19 states have internal predecessors, (56), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 13:27:27,057 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-12-13 13:27:27,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 13:27:27,057 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:27:27,057 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:27:27,062 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 13:27:27,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:27:27,259 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 13:27:27,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:27,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1143461147, now seen corresponding path program 1 times [2022-12-13 13:27:27,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:27,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319780887] [2022-12-13 13:27:27,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:27,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:27,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:27:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:27,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 13:27:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:27,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:27:27,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:27:27,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319780887] [2022-12-13 13:27:27,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319780887] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:27:27,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981669705] [2022-12-13 13:27:27,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:27,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:27:27,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:27:27,437 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:27:27,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 13:27:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:27,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 157 conjunts are in the unsatisfiable core [2022-12-13 13:27:27,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:27:27,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 13:27:27,715 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_388 Int) (v_ArrVal_385 Int) (LDV_INIT_LIST_HEAD_~list.offset Int)) (and (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|) (= (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_385) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_388)) |c_#memory_int|))) is different from true [2022-12-13 13:27:27,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:27:27,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:27:27,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-12-13 13:27:27,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:27:27,853 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:27:27,853 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 1 case distinctions, treesize of input 32 treesize of output 28 [2022-12-13 13:27:27,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 13:27:27,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:27:27,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:27:30,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981669705] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:27:30,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 13:27:30,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 20] total 26 [2022-12-13 13:27:30,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773416271] [2022-12-13 13:27:30,663 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 13:27:30,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 13:27:30,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:27:30,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 13:27:30,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1090, Unknown=2, NotChecked=66, Total=1260 [2022-12-13 13:27:30,664 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 26 states, 25 states have (on average 2.4) internal successors, (60), 21 states have internal predecessors, (60), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 13:27:39,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:27:39,339 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2022-12-13 13:27:39,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 13:27:39,340 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.4) internal successors, (60), 21 states have internal predecessors, (60), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 36 [2022-12-13 13:27:39,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:27:39,340 INFO L225 Difference]: With dead ends: 122 [2022-12-13 13:27:39,340 INFO L226 Difference]: Without dead ends: 59 [2022-12-13 13:27:39,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=273, Invalid=2375, Unknown=8, NotChecked=100, Total=2756 [2022-12-13 13:27:39,341 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 147 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 13:27:39,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 253 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 619 Invalid, 0 Unknown, 59 Unchecked, 0.3s Time] [2022-12-13 13:27:39,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-12-13 13:27:39,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2022-12-13 13:27:39,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 47 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 13:27:39,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-12-13 13:27:39,346 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 36 [2022-12-13 13:27:39,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:27:39,346 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-12-13 13:27:39,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.4) internal successors, (60), 21 states have internal predecessors, (60), 4 states have call successors, (6), 6 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 13:27:39,346 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-12-13 13:27:39,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-13 13:27:39,346 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:27:39,347 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:27:39,351 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 13:27:39,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 13:27:39,548 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 13:27:39,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:39,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1304169571, now seen corresponding path program 1 times [2022-12-13 13:27:39,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:39,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064569114] [2022-12-13 13:27:39,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:39,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:39,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:27:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:39,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 13:27:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:39,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 13:27:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:39,774 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:27:39,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:27:39,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064569114] [2022-12-13 13:27:39,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064569114] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:27:39,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139131578] [2022-12-13 13:27:39,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:39,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:27:39,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:27:39,775 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:27:39,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 13:27:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:39,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 198 conjunts are in the unsatisfiable core [2022-12-13 13:27:39,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:27:40,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 13:27:40,077 WARN L859 $PredicateComparison]: unable to prove that (exists ((LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_518 Int) (v_ArrVal_516 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_518) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_516))) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2022-12-13 13:27:40,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:27:40,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:27:40,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-12-13 13:27:40,217 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:27:40,221 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:27:40,221 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 1 case distinctions, treesize of input 32 treesize of output 28 [2022-12-13 13:27:40,381 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_521 Int)) (let ((.cse0 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|)) (.cse1 (+ |c_ldv_kobject_put_#in~kobj#1.offset| 12))) (and (<= (select .cse0 .cse1) (+ v_ArrVal_521 1)) (= (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (store .cse0 .cse1 v_ArrVal_521)) |c_#memory_int|)))) is different from true [2022-12-13 13:27:40,413 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 34 treesize of output 18 [2022-12-13 13:27:40,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 13:27:40,522 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:27:40,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:27:40,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139131578] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:27:40,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 13:27:40,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 24] total 32 [2022-12-13 13:27:40,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481997848] [2022-12-13 13:27:40,829 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 13:27:40,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 13:27:40,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:27:40,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 13:27:40,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1086, Unknown=2, NotChecked=134, Total=1332 [2022-12-13 13:27:40,830 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 32 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 26 states have internal predecessors, (80), 5 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 13:27:53,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:27:53,652 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2022-12-13 13:27:53,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 13:27:53,652 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 26 states have internal predecessors, (80), 5 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2022-12-13 13:27:53,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:27:53,653 INFO L225 Difference]: With dead ends: 109 [2022-12-13 13:27:53,653 INFO L226 Difference]: Without dead ends: 67 [2022-12-13 13:27:53,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=300, Invalid=2455, Unknown=9, NotChecked=206, Total=2970 [2022-12-13 13:27:53,654 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 114 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 13:27:53,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 216 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 591 Invalid, 0 Unknown, 112 Unchecked, 0.3s Time] [2022-12-13 13:27:53,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-12-13 13:27:53,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2022-12-13 13:27:53,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 55 states have internal predecessors, (58), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 13:27:53,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2022-12-13 13:27:53,660 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 48 [2022-12-13 13:27:53,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:27:53,660 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2022-12-13 13:27:53,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 26 states have internal predecessors, (80), 5 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 13:27:53,660 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2022-12-13 13:27:53,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-13 13:27:53,660 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:27:53,660 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:27:53,665 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 13:27:53,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 13:27:53,862 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 13:27:53,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:53,863 INFO L85 PathProgramCache]: Analyzing trace with hash -710408717, now seen corresponding path program 1 times [2022-12-13 13:27:53,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:53,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061318626] [2022-12-13 13:27:53,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:53,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:54,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:27:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:54,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 13:27:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:54,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 13:27:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:54,119 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:27:54,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:27:54,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061318626] [2022-12-13 13:27:54,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061318626] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:27:54,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318921499] [2022-12-13 13:27:54,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:54,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:27:54,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:27:54,120 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:27:54,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 13:27:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:54,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 108 conjunts are in the unsatisfiable core [2022-12-13 13:27:54,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:27:54,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 13:27:54,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 13:27:54,437 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 13:27:54,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:27:54,654 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 30 treesize of output 24 [2022-12-13 13:27:54,671 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 34 treesize of output 28 [2022-12-13 13:27:54,690 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 13:27:54,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318921499] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:27:54,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:27:54,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 22 [2022-12-13 13:27:54,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071406380] [2022-12-13 13:27:54,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:27:54,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-13 13:27:54,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:27:54,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 13:27:54,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2022-12-13 13:27:54,692 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand has 22 states, 21 states have (on average 4.285714285714286) internal successors, (90), 19 states have internal predecessors, (90), 5 states have call successors, (9), 7 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 13:27:55,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:27:55,066 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2022-12-13 13:27:55,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 13:27:55,067 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.285714285714286) internal successors, (90), 19 states have internal predecessors, (90), 5 states have call successors, (9), 7 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 50 [2022-12-13 13:27:55,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:27:55,067 INFO L225 Difference]: With dead ends: 116 [2022-12-13 13:27:55,067 INFO L226 Difference]: Without dead ends: 55 [2022-12-13 13:27:55,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930 [2022-12-13 13:27:55,068 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 100 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 13:27:55,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 328 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 13:27:55,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-12-13 13:27:55,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-12-13 13:27:55,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 13:27:55,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2022-12-13 13:27:55,073 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 50 [2022-12-13 13:27:55,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:27:55,073 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2022-12-13 13:27:55,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.285714285714286) internal successors, (90), 19 states have internal predecessors, (90), 5 states have call successors, (9), 7 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 13:27:55,073 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-12-13 13:27:55,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-13 13:27:55,074 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:27:55,074 INFO L195 NwaCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:27:55,078 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 13:27:55,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 13:27:55,275 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-13 13:27:55,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:27:55,275 INFO L85 PathProgramCache]: Analyzing trace with hash -990130780, now seen corresponding path program 1 times [2022-12-13 13:27:55,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:27:55,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206238946] [2022-12-13 13:27:55,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:55,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:27:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:55,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:27:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:55,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 13:27:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:55,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 13:27:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:55,545 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:27:55,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:27:55,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206238946] [2022-12-13 13:27:55,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206238946] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:27:55,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646809469] [2022-12-13 13:27:55,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:27:55,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:27:55,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:27:55,546 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:27:55,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 13:27:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:27:55,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 105 conjunts are in the unsatisfiable core [2022-12-13 13:27:55,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:27:55,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 13:27:55,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 13:27:55,911 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 13:27:55,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:27:56,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2022-12-13 13:27:56,232 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 38 treesize of output 32 [2022-12-13 13:27:56,256 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 13:27:56,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646809469] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:27:56,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:27:56,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 27 [2022-12-13 13:27:56,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728188461] [2022-12-13 13:27:56,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:27:56,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-13 13:27:56,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:27:56,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 13:27:56,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702 [2022-12-13 13:27:56,258 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 27 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 24 states have internal predecessors, (100), 5 states have call successors, (9), 7 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 13:27:56,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:27:56,820 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2022-12-13 13:27:56,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 13:27:56,821 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 24 states have internal predecessors, (100), 5 states have call successors, (9), 7 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 54 [2022-12-13 13:27:56,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:27:56,821 INFO L225 Difference]: With dead ends: 95 [2022-12-13 13:27:56,821 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 13:27:56,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=1226, Unknown=0, NotChecked=0, Total=1406 [2022-12-13 13:27:56,822 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 66 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 13:27:56,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 529 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 13:27:56,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 13:27:56,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 13:27:56,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:27:56,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 13:27:56,822 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2022-12-13 13:27:56,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:27:56,822 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 13:27:56,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.8461538461538463) internal successors, (100), 24 states have internal predecessors, (100), 5 states have call successors, (9), 7 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 13:27:56,823 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 13:27:56,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 13:27:56,824 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-12-13 13:27:56,825 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-12-13 13:27:56,825 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-12-13 13:27:56,825 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-12-13 13:27:56,830 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 13:27:57,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 13:27:57,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 13:27:58,131 INFO L899 garLoopResultBuilder]: For program point L526(lines 526 530) no Hoare annotation was computed. [2022-12-13 13:27:58,131 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 525 531) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-12-13 13:27:58,131 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 525 531) no Hoare annotation was computed. [2022-12-13 13:27:58,131 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 525 531) no Hoare annotation was computed. [2022-12-13 13:27:58,131 INFO L899 garLoopResultBuilder]: For program point L659(line 659) no Hoare annotation was computed. [2022-12-13 13:27:58,131 INFO L895 garLoopResultBuilder]: At program point ldv_kobject_create_returnLabel#1(lines 738 747) the Hoare annotation is: (let ((.cse1 (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (.cse2 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) (.cse4 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0))) (or (let ((.cse3 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) 12)) (.cse0 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|)))) (and (<= .cse0 1) .cse1 (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) .cse2 (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (<= .cse3 1) (<= 1 .cse3) (not .cse4) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (<= 1 .cse0))) (and .cse1 .cse2 (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0) .cse4))) [2022-12-13 13:27:58,132 INFO L899 garLoopResultBuilder]: For program point L659-1(line 659) no Hoare annotation was computed. [2022-12-13 13:27:58,132 INFO L899 garLoopResultBuilder]: For program point L717(lines 717 718) no Hoare annotation was computed. [2022-12-13 13:27:58,132 INFO L899 garLoopResultBuilder]: For program point L684(lines 684 687) no Hoare annotation was computed. [2022-12-13 13:27:58,132 INFO L899 garLoopResultBuilder]: For program point L717-2(lines 717 718) no Hoare annotation was computed. [2022-12-13 13:27:58,132 INFO L895 garLoopResultBuilder]: At program point ldv_kobject_init_returnLabel#1(lines 728 737) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|)))) (and (<= .cse0 1) (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (<= 1 .cse0))) [2022-12-13 13:27:58,132 INFO L899 garLoopResultBuilder]: For program point L680(lines 680 683) no Hoare annotation was computed. [2022-12-13 13:27:58,132 INFO L899 garLoopResultBuilder]: For program point L742(lines 742 743) no Hoare annotation was computed. [2022-12-13 13:27:58,132 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 13:27:58,132 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 659) no Hoare annotation was computed. [2022-12-13 13:27:58,132 INFO L895 garLoopResultBuilder]: At program point L-1-2(line -1) the Hoare annotation is: (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0))) [2022-12-13 13:27:58,132 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 13:27:58,132 INFO L899 garLoopResultBuilder]: For program point L-1-3(line -1) no Hoare annotation was computed. [2022-12-13 13:27:58,132 INFO L899 garLoopResultBuilder]: For program point L730(lines 730 732) no Hoare annotation was computed. [2022-12-13 13:27:58,132 INFO L895 garLoopResultBuilder]: At program point L726(line 726) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|)))) (and (<= .cse0 1) (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (<= 1 .cse0))) [2022-12-13 13:27:58,132 INFO L895 garLoopResultBuilder]: At program point L726-1(lines 721 727) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|)))) (and (<= .cse0 1) (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (<= 1 .cse0))) [2022-12-13 13:27:58,132 INFO L895 garLoopResultBuilder]: At program point ldv_kobject_get_returnLabel#1(lines 715 720) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) (.cse3 (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0)) (.cse1 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0))) (or (let ((.cse2 (select (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|) 12))) (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) .cse0 (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|))) (not (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.base| 0)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) 12)) (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.offset| 0) (not .cse1) (<= .cse2 2) .cse3 (= (+ |ULTIMATE.start_entry_point_~kobj~2#1.offset| 12) |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (<= (select (select |#memory_int| |ULTIMATE.start_ldv_atomic_add_return_~v#1.base|) |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) |ULTIMATE.start_ldv_atomic_add_return_~temp~0#1|) (= |ULTIMATE.start_ldv_atomic_add_return_~v#1.base| |ULTIMATE.start_entry_point_~kobj~2#1.base|) (<= 1 |ULTIMATE.start_ldv_atomic_add_return_~i#1|) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| |ULTIMATE.start_ldv_kobject_get_~kobj#1.base|) (<= 2 .cse2))) (and .cse0 (= |ULTIMATE.start_entry_point_~kobj~2#1.base| 0) .cse3 .cse1))) [2022-12-13 13:27:58,133 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 659) no Hoare annotation was computed. [2022-12-13 13:27:58,133 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 13:27:58,133 INFO L895 garLoopResultBuilder]: At program point L768(line 768) the Hoare annotation is: (let ((.cse15 (select (select |#memory_int| |ULTIMATE.start_f_22_put_~kobj#1.base|) 12)) (.cse14 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0))) (let ((.cse0 (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (.cse1 (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|)) (.cse12 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) (.cse2 (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (.cse3 (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (.cse4 (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|)) (.cse5 (not (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.base| 0))) (.cse6 (not .cse14)) (.cse13 (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0)) (.cse7 (<= .cse15 2)) (.cse11 (+ |ULTIMATE.start_entry_point_~kobj~2#1.offset| 12)) (.cse8 (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0))) (.cse9 (= |ULTIMATE.start_f_22_put_~kobj#1.offset| 0)) (.cse10 (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_f_22_put_~kobj#1.offset| |ULTIMATE.start_entry_point_~kobj~2#1.offset|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 0 (select .cse10 .cse11)) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| |ULTIMATE.start_f_22_put_~kobj#1.base|)) (and (= |ULTIMATE.start_f_22_put_~kobj#1.base| 0) .cse12 (= |ULTIMATE.start_entry_point_~kobj~2#1.base| 0) .cse13 .cse9 .cse14) (let ((.cse16 (select .cse10 12))) (and (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.offset| |ULTIMATE.start_entry_point_~kobj~2#1.offset|) .cse0 .cse1 .cse12 .cse2 .cse3 .cse4 .cse5 (<= 2 .cse15) (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) 12)) .cse6 (<= .cse16 2) .cse13 .cse7 (= .cse11 |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) .cse8 .cse9 (<= (select (select |#memory_int| |ULTIMATE.start_ldv_atomic_add_return_~v#1.base|) |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) |ULTIMATE.start_ldv_atomic_add_return_~temp~0#1|) (= |ULTIMATE.start_ldv_atomic_add_return_~v#1.base| |ULTIMATE.start_entry_point_~kobj~2#1.base|) (<= 1 |ULTIMATE.start_ldv_atomic_add_return_~i#1|) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| |ULTIMATE.start_ldv_kobject_get_~kobj#1.base|) (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|))) (<= 2 .cse16)))))) [2022-12-13 13:27:58,133 INFO L899 garLoopResultBuilder]: For program point L768-1(lines 763 769) no Hoare annotation was computed. [2022-12-13 13:27:58,133 INFO L895 garLoopResultBuilder]: At program point ldv_atomic_add_return_returnLabel#1(lines 655 662) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|) 12))) (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (not (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.base| 0)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) 12)) (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.offset| 0) (not (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0)) (<= .cse0 2) (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0) (= (+ |ULTIMATE.start_entry_point_~kobj~2#1.offset| 12) |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (<= (select (select |#memory_int| |ULTIMATE.start_ldv_atomic_add_return_~v#1.base|) |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) |ULTIMATE.start_ldv_atomic_add_return_~temp~0#1|) (= |ULTIMATE.start_ldv_atomic_add_return_~v#1.base| |ULTIMATE.start_entry_point_~kobj~2#1.base|) (<= 1 |ULTIMATE.start_ldv_atomic_add_return_~i#1|) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| |ULTIMATE.start_ldv_kobject_get_~kobj#1.base|) (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|))) (<= 2 .cse0))) [2022-12-13 13:27:58,133 INFO L899 garLoopResultBuilder]: For program point L723(lines 723 724) no Hoare annotation was computed. [2022-12-13 13:27:58,133 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 13:27:58,133 INFO L895 garLoopResultBuilder]: At program point L761(line 761) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) (.cse2 (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0)) (.cse3 (= |ULTIMATE.start_f_22_put_~kobj#1.offset| 0)) (.cse1 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0))) (or (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) .cse0 (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|))) (not (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.base| 0)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) 12)) (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.offset| 0) (not .cse1) .cse2 (<= (select (select |#memory_int| |ULTIMATE.start_f_22_put_~kobj#1.base|) 12) 2) (= (+ |ULTIMATE.start_entry_point_~kobj~2#1.offset| 12) |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) .cse3 (<= (select (select |#memory_int| |ULTIMATE.start_ldv_atomic_add_return_~v#1.base|) |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) |ULTIMATE.start_ldv_atomic_add_return_~temp~0#1|) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| |ULTIMATE.start_f_22_put_~kobj#1.base|) (= |ULTIMATE.start_ldv_atomic_add_return_~v#1.base| |ULTIMATE.start_entry_point_~kobj~2#1.base|) (<= 1 |ULTIMATE.start_ldv_atomic_add_return_~i#1|) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| |ULTIMATE.start_ldv_kobject_get_~kobj#1.base|) (<= 2 (select (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|) 12))) (and (= |ULTIMATE.start_f_22_put_~kobj#1.base| 0) .cse0 (= |ULTIMATE.start_entry_point_~kobj~2#1.base| 0) .cse2 .cse3 .cse1))) [2022-12-13 13:27:58,133 INFO L899 garLoopResultBuilder]: For program point L761-1(lines 760 762) no Hoare annotation was computed. [2022-12-13 13:27:58,133 INFO L899 garLoopResultBuilder]: For program point L757(lines 757 759) no Hoare annotation was computed. [2022-12-13 13:27:58,133 INFO L902 garLoopResultBuilder]: At program point L741(line 741) the Hoare annotation is: true [2022-12-13 13:27:58,133 INFO L899 garLoopResultBuilder]: For program point L741-1(line 741) no Hoare annotation was computed. [2022-12-13 13:27:58,133 INFO L899 garLoopResultBuilder]: For program point L770(lines 770 772) no Hoare annotation was computed. [2022-12-13 13:27:58,134 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 538 542) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2022-12-13 13:27:58,134 INFO L899 garLoopResultBuilder]: For program point LDV_INIT_LIST_HEADFINAL(lines 538 542) no Hoare annotation was computed. [2022-12-13 13:27:58,134 INFO L899 garLoopResultBuilder]: For program point LDV_INIT_LIST_HEADEXIT(lines 538 542) no Hoare annotation was computed. [2022-12-13 13:27:58,134 INFO L899 garLoopResultBuilder]: For program point L667(line 667) no Hoare annotation was computed. [2022-12-13 13:27:58,134 INFO L899 garLoopResultBuilder]: For program point L667-1(line 667) no Hoare annotation was computed. [2022-12-13 13:27:58,134 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-12-13 13:27:58,134 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 709 714) the Hoare annotation is: (let ((.cse0 (= |old(#valid)| |#valid|))) (and (let ((.cse1 (select (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|) (+ |ldv_kobject_put_#in~kobj#1.offset| 12)))) (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) .cse0) (not (<= 0 .cse1)) (not (<= .cse1 2147483647)))) (or (not (= |ldv_kobject_put_#in~kobj#1.offset| 0)) (not (= |ldv_kobject_put_#in~kobj#1.base| 0)) .cse0))) [2022-12-13 13:27:58,134 INFO L899 garLoopResultBuilder]: For program point L711(lines 711 713) no Hoare annotation was computed. [2022-12-13 13:27:58,134 INFO L899 garLoopResultBuilder]: For program point L711-2(lines 709 714) no Hoare annotation was computed. [2022-12-13 13:27:58,134 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putEXIT(lines 709 714) no Hoare annotation was computed. [2022-12-13 13:27:58,134 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 677) no Hoare annotation was computed. [2022-12-13 13:27:58,134 INFO L899 garLoopResultBuilder]: For program point L705(lines 705 708) no Hoare annotation was computed. [2022-12-13 13:27:58,134 INFO L899 garLoopResultBuilder]: For program point L701(lines 701 703) no Hoare annotation was computed. [2022-12-13 13:27:58,135 INFO L895 garLoopResultBuilder]: At program point ldv_atomic_sub_return_returnLabel#1(lines 663 670) the Hoare annotation is: (let ((.cse4 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|)) (.cse3 (+ |ldv_kobject_put_#in~kobj#1.offset| 12))) (let ((.cse1 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (.cse0 (select .cse4 .cse3))) (and (or (not (<= 0 .cse0)) (not (<= .cse0 2147483647)) (= |old(#valid)| |#valid|)) (or .cse1 (not (= |ldv_kobject_put_#in~kobj#1.base| 0))) (let ((.cse2 (select .cse4 12))) (or (not (<= .cse2 2)) .cse1 (not (<= 2 .cse2)) (and (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| .cse3) (= |ldv_kobject_put_~kobj#1.base| |ldv_kobject_put_#in~kobj#1.base|) (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 2) (<= |ldv_kobject_put_ldv_atomic_sub_return_#res#1| (select (select |#memory_int| |ldv_kobject_put_#in~kobj#1.base|) .cse3)) (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| |ldv_kobject_put_#in~kobj#1.base|) (= |ldv_kobject_put_~kobj#1.offset| 0) (exists ((v_ArrVal_521 Int)) (and (= |#memory_int| (store |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base| (store .cse4 .cse3 v_ArrVal_521))) (<= .cse0 (+ v_ArrVal_521 1)))) (<= (select (select |#memory_int| |ldv_kobject_put_~kobj#1.base|) 12) 2) (<= 1 |ldv_kobject_put_ldv_atomic_sub_return_~i#1|))))))) [2022-12-13 13:27:58,135 INFO L899 garLoopResultBuilder]: For program point L697(lines 697 704) no Hoare annotation was computed. [2022-12-13 13:27:58,135 INFO L895 garLoopResultBuilder]: At program point ##fun~$Pointer$~TO~VOID_returnLabel#1(line -1) the Hoare annotation is: (let ((.cse1 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0)))) (and (let ((.cse0 (select (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|) 12))) (or (not (<= .cse0 2)) .cse1 (let ((.cse2 (+ |ldv_kobject_put_#in~kobj#1.offset| 12)) (.cse3 (select |#memory_int| |ldv_kobject_put_~kobj#1.base|))) (and (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| .cse2) (= |ldv_kobject_put_~kobj#1.base| |ldv_kobject_put_#in~kobj#1.base|) (<= 0 (select .cse3 (+ 12 |ldv_kobject_put_~kobj#1.offset|))) (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 2) (<= |ldv_kobject_put_ldv_atomic_sub_return_#res#1| (select (select |#memory_int| |ldv_kobject_put_#in~kobj#1.base|) .cse2)) (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| |ldv_kobject_put_#in~kobj#1.base|) (= |ldv_kobject_put_~kobj#1.offset| 0) (<= (select .cse3 12) 2) (<= 1 |ldv_kobject_put_ldv_atomic_sub_return_~i#1|))) (not (<= 2 .cse0)))) (or .cse1 (not (= |ldv_kobject_put_#in~kobj#1.base| 0))))) [2022-12-13 13:27:58,135 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-12-13 13:27:58,135 INFO L895 garLoopResultBuilder]: At program point ldv_kref_put_returnLabel#1(lines 688 691) the Hoare annotation is: (let ((.cse9 (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (let ((.cse0 (not .cse9))) (and (or .cse0 (not (= |ldv_kobject_put_#in~kobj#1.base| 0))) (let ((.cse12 (select |#memory_int| |ldv_kobject_put_~kobj#1.base|)) (.cse8 (+ |ldv_kobject_put_#in~kobj#1.offset| 12)) (.cse7 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|))) (let ((.cse1 (select .cse7 12)) (.cse2 (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| .cse8)) (.cse3 (= |ldv_kobject_put_~kobj#1.base| |ldv_kobject_put_#in~kobj#1.base|)) (.cse4 (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 2)) (.cse5 (= |ldv_kobject_put_#in~kobj#1.offset| |ldv_kobject_put_~kobj#1.offset|)) (.cse6 (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| |ldv_kobject_put_#in~kobj#1.base|)) (.cse10 (<= (select .cse12 12) 2)) (.cse11 (<= 1 |ldv_kobject_put_ldv_atomic_sub_return_~i#1|))) (or (not (<= .cse1 2)) .cse0 (and .cse2 .cse3 .cse4 .cse5 .cse6 (exists ((v_ArrVal_521 Int)) (and (= |#memory_int| (store |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base| (store .cse7 .cse8 v_ArrVal_521))) (<= (select .cse7 .cse8) (+ v_ArrVal_521 1)))) .cse9 .cse10 (= |old(#valid)| |#valid|) .cse11) (not (<= 2 .cse1)) (and .cse2 .cse3 (<= 0 (select .cse12 (+ 12 |ldv_kobject_put_~kobj#1.offset|))) .cse4 .cse5 (<= |ldv_kobject_put_ldv_atomic_sub_return_#res#1| (select (select |#memory_int| |ldv_kobject_put_#in~kobj#1.base|) .cse8)) .cse6 .cse9 .cse10 .cse11))))))) [2022-12-13 13:27:58,135 INFO L895 garLoopResultBuilder]: At program point ldv_kref_sub_returnLabel#1(lines 671 679) the Hoare annotation is: (let ((.cse9 (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (let ((.cse0 (not .cse9))) (and (or .cse0 (not (= |ldv_kobject_put_#in~kobj#1.base| 0))) (let ((.cse12 (select |#memory_int| |ldv_kobject_put_~kobj#1.base|)) (.cse8 (+ |ldv_kobject_put_#in~kobj#1.offset| 12)) (.cse7 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|))) (let ((.cse1 (select .cse7 12)) (.cse2 (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| .cse8)) (.cse3 (= |ldv_kobject_put_~kobj#1.base| |ldv_kobject_put_#in~kobj#1.base|)) (.cse4 (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 2)) (.cse5 (= |ldv_kobject_put_#in~kobj#1.offset| |ldv_kobject_put_~kobj#1.offset|)) (.cse6 (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| |ldv_kobject_put_#in~kobj#1.base|)) (.cse10 (<= (select .cse12 12) 2)) (.cse11 (<= 1 |ldv_kobject_put_ldv_atomic_sub_return_~i#1|))) (or (not (<= .cse1 2)) .cse0 (and .cse2 .cse3 .cse4 .cse5 .cse6 (exists ((v_ArrVal_521 Int)) (and (= |#memory_int| (store |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base| (store .cse7 .cse8 v_ArrVal_521))) (<= (select .cse7 .cse8) (+ v_ArrVal_521 1)))) .cse9 .cse10 (= |old(#valid)| |#valid|) .cse11) (not (<= 2 .cse1)) (and .cse2 .cse3 (<= 0 (select .cse12 (+ 12 |ldv_kobject_put_~kobj#1.offset|))) .cse4 .cse5 (<= |ldv_kobject_put_ldv_atomic_sub_return_#res#1| (select (select |#memory_int| |ldv_kobject_put_#in~kobj#1.base|) .cse8)) .cse6 .cse9 .cse10 .cse11))))))) [2022-12-13 13:27:58,138 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:27:58,139 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 13:27:58,151 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 13:27:58,152 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 13:27:58,153 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 13:27:58,153 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 13:27:58,154 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 13:27:58,154 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 13:27:58,155 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 13:27:58,155 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 13:27:58,157 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 13:27:58,157 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 13:27:58,158 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 13:27:58,158 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 13:27:58,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:27:58 BoogieIcfgContainer [2022-12-13 13:27:58,159 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 13:27:58,159 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 13:27:58,159 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 13:27:58,160 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 13:27:58,160 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:27:13" (3/4) ... [2022-12-13 13:27:58,162 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 13:27:58,167 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-12-13 13:27:58,167 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2022-12-13 13:27:58,167 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2022-12-13 13:27:58,170 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2022-12-13 13:27:58,170 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-12-13 13:27:58,171 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-13 13:27:58,187 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((unknown-#memory_int-unknown[kobj][12 + kobj] <= 1 && 0 == kobj) && kobj == kobj) && 0 == \result) && kobj == kobj) && kobj == kobj) && kobj == kobj) && unknown-#memory_int-unknown[\result][12] <= 1) && 1 <= unknown-#memory_int-unknown[\result][12]) && !(\result == 0)) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) || (((0 == kobj && 0 == \result) && kobj == 0) && \result == 0) [2022-12-13 13:27:58,188 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((0 == kobj && kobj == kobj) && 0 == \result) && kobj == kobj) && kobj == kobj) && kobj == kobj) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[\result][12]) && kobj == 0) && !(\result == 0)) && unknown-#memory_int-unknown[kobj][12] <= 2) && kobj == 0) && kobj + 12 == v) && !(kobj == 0)) && unknown-#memory_int-unknown[v][v] <= temp) && v == kobj) && 1 <= i) && kobj == kobj) && 2 <= unknown-#memory_int-unknown[kobj][12]) || (((0 == \result && kobj == 0) && kobj == 0) && \result == 0) [2022-12-13 13:27:58,188 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((0 == kobj && kobj == kobj) && 0 == \result) && kobj == kobj) && kobj == kobj) && kobj == kobj) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[\result][12]) && kobj == 0) && !(\result == 0)) && unknown-#memory_int-unknown[kobj][12] <= 2) && kobj == 0) && kobj + 12 == v) && !(kobj == 0)) && unknown-#memory_int-unknown[v][v] <= temp) && v == kobj) && 1 <= i) && kobj == kobj) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && 2 <= unknown-#memory_int-unknown[kobj][12] [2022-12-13 13:27:58,188 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(0 <= \old(unknown-#memory_int-unknown)[kobj][kobj + 12]) || !(\old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= 2147483647)) || \old(\valid) == \valid) && (!(kobj == 0) || !(kobj == 0))) && (((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || !(kobj == 0)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) || ((((((((v == kobj + 12 && kobj == kobj) && temp <= 2) && \result <= unknown-#memory_int-unknown[kobj][kobj + 12]) && v == kobj) && kobj == 0) && (\exists v_ArrVal_521 : int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_521]] && \old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= v_ArrVal_521 + 1)) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) [2022-12-13 13:27:58,188 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(kobj == 0) || !(kobj == 0)) && ((((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || !(kobj == 0)) || (((((((((v == kobj + 12 && kobj == kobj) && temp <= 2) && kobj == kobj) && v == kobj) && (\exists v_ArrVal_521 : int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_521]] && \old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= v_ArrVal_521 + 1)) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && \old(\valid) == \valid) && 1 <= i)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) || (((((((((v == kobj + 12 && kobj == kobj) && 0 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && temp <= 2) && kobj == kobj) && \result <= unknown-#memory_int-unknown[kobj][kobj + 12]) && v == kobj) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) [2022-12-13 13:27:58,189 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(kobj == 0) || !(kobj == 0)) && ((((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || !(kobj == 0)) || (((((((((v == kobj + 12 && kobj == kobj) && temp <= 2) && kobj == kobj) && v == kobj) && (\exists v_ArrVal_521 : int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_521]] && \old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= v_ArrVal_521 + 1)) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && \old(\valid) == \valid) && 1 <= i)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) || (((((((((v == kobj + 12 && kobj == kobj) && 0 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && temp <= 2) && kobj == kobj) && \result <= unknown-#memory_int-unknown[kobj][kobj + 12]) && v == kobj) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) [2022-12-13 13:27:58,189 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || !(kobj == 0)) || ((((((((v == kobj + 12 && kobj == kobj) && 0 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && temp <= 2) && \result <= unknown-#memory_int-unknown[kobj][kobj + 12]) && v == kobj) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) && (!(kobj == 0) || !(kobj == 0)) [2022-12-13 13:27:58,198 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 13:27:58,198 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 13:27:58,199 INFO L158 Benchmark]: Toolchain (without parser) took 45896.74ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 80.3MB in the beginning and 32.5MB in the end (delta: 47.8MB). Peak memory consumption was 74.4MB. Max. memory is 16.1GB. [2022-12-13 13:27:58,199 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory was 61.3MB in the beginning and 61.2MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:27:58,199 INFO L158 Benchmark]: CACSL2BoogieTranslator took 350.65ms. Allocated memory is still 117.4MB. Free memory was 80.0MB in the beginning and 58.7MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-13 13:27:58,199 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.42ms. Allocated memory is still 117.4MB. Free memory was 58.7MB in the beginning and 55.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 13:27:58,200 INFO L158 Benchmark]: Boogie Preprocessor took 31.86ms. Allocated memory is still 117.4MB. Free memory was 55.9MB in the beginning and 54.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 13:27:58,200 INFO L158 Benchmark]: RCFGBuilder took 374.34ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 54.1MB in the beginning and 98.9MB in the end (delta: -44.7MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2022-12-13 13:27:58,200 INFO L158 Benchmark]: TraceAbstraction took 45047.00ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 36.7MB in the end (delta: 61.3MB). Peak memory consumption was 70.6MB. Max. memory is 16.1GB. [2022-12-13 13:27:58,200 INFO L158 Benchmark]: Witness Printer took 39.09ms. Allocated memory is still 142.6MB. Free memory was 36.7MB in the beginning and 32.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 13:27:58,201 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory was 61.3MB in the beginning and 61.2MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 350.65ms. Allocated memory is still 117.4MB. Free memory was 80.0MB in the beginning and 58.7MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.42ms. Allocated memory is still 117.4MB. Free memory was 58.7MB in the beginning and 55.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.86ms. Allocated memory is still 117.4MB. Free memory was 55.9MB in the beginning and 54.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 374.34ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 54.1MB in the beginning and 98.9MB in the end (delta: -44.7MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * TraceAbstraction took 45047.00ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 36.7MB in the end (delta: 61.3MB). Peak memory consumption was 70.6MB. Max. memory is 16.1GB. * Witness Printer took 39.09ms. Allocated memory is still 142.6MB. Free memory was 36.7MB in the beginning and 32.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 659]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 659]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 667]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 667]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 54 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 45.0s, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 32.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1053 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1039 mSDsluCounter, 3691 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 356 IncrementalHoareTripleChecker+Unchecked, 3144 mSDsCounter, 214 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4103 IncrementalHoareTripleChecker+Invalid, 4673 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 214 mSolverCounterUnsat, 547 mSDtfsCounter, 4103 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 649 GetRequests, 333 SyntacticMatches, 2 SemanticMatches, 314 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 35.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=13, InterpolantAutomatonStates: 198, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 129 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 184 PreInvPairs, 295 NumberOfFragments, 1217 HoareAnnotationTreeSize, 184 FomulaSimplifications, 12 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 17 FomulaSimplificationsInter, 2401 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 767 ConstructedInterpolants, 16 QuantifiedInterpolants, 3600 SizeOfPredicates, 382 NumberOfNonLiveVariables, 2502 ConjunctsInSsa, 898 ConjunctsInUnsatCore, 24 InterpolantComputations, 10 PerfectInterpolantSequences, 52/127 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 655]: Loop Invariant Derived loop invariant: ((((((((((((((((((0 == kobj && kobj == kobj) && 0 == \result) && kobj == kobj) && kobj == kobj) && kobj == kobj) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[\result][12]) && kobj == 0) && !(\result == 0)) && unknown-#memory_int-unknown[kobj][12] <= 2) && kobj == 0) && kobj + 12 == v) && !(kobj == 0)) && unknown-#memory_int-unknown[v][v] <= temp) && v == kobj) && 1 <= i) && kobj == kobj) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && 2 <= unknown-#memory_int-unknown[kobj][12] - InvariantResult [Line: 715]: Loop Invariant Derived loop invariant: (((((((((((((((((((0 == kobj && kobj == kobj) && 0 == \result) && kobj == kobj) && kobj == kobj) && kobj == kobj) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[\result][12]) && kobj == 0) && !(\result == 0)) && unknown-#memory_int-unknown[kobj][12] <= 2) && kobj == 0) && kobj + 12 == v) && !(kobj == 0)) && unknown-#memory_int-unknown[v][v] <= temp) && v == kobj) && 1 <= i) && kobj == kobj) && 2 <= unknown-#memory_int-unknown[kobj][12]) || (((0 == \result && kobj == 0) && kobj == 0) && \result == 0) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || !(kobj == 0)) || ((((((((v == kobj + 12 && kobj == kobj) && 0 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && temp <= 2) && \result <= unknown-#memory_int-unknown[kobj][kobj + 12]) && v == kobj) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) && (!(kobj == 0) || !(kobj == 0)) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 == kobj && !(kobj == 0) - InvariantResult [Line: 728]: Loop Invariant Derived loop invariant: ((((((unknown-#memory_int-unknown[kobj][12 + kobj] <= 1 && 0 == kobj) && kobj == kobj) && kobj == kobj) && kobj == kobj) && kobj == kobj) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj] - InvariantResult [Line: 663]: Loop Invariant [2022-12-13 13:27:58,208 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 13:27:58,208 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 13:27:58,209 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 13:27:58,209 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] Derived loop invariant: (((!(0 <= \old(unknown-#memory_int-unknown)[kobj][kobj + 12]) || !(\old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= 2147483647)) || \old(\valid) == \valid) && (!(kobj == 0) || !(kobj == 0))) && (((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || !(kobj == 0)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) || ((((((((v == kobj + 12 && kobj == kobj) && temp <= 2) && \result <= unknown-#memory_int-unknown[kobj][kobj + 12]) && v == kobj) && kobj == 0) && (\exists v_ArrVal_521 : int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_521]] && \old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= v_ArrVal_521 + 1)) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) - InvariantResult [Line: 721]: Loop Invariant Derived loop invariant: ((((((unknown-#memory_int-unknown[kobj][12 + kobj] <= 1 && 0 == kobj) && kobj == kobj) && kobj == kobj) && kobj == kobj) && kobj == kobj) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj] - InvariantResult [Line: 671]: Loop Invariant [2022-12-13 13:27:58,210 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 13:27:58,210 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 13:27:58,210 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 13:27:58,210 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] Derived loop invariant: (!(kobj == 0) || !(kobj == 0)) && ((((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || !(kobj == 0)) || (((((((((v == kobj + 12 && kobj == kobj) && temp <= 2) && kobj == kobj) && v == kobj) && (\exists v_ArrVal_521 : int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_521]] && \old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= v_ArrVal_521 + 1)) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && \old(\valid) == \valid) && 1 <= i)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) || (((((((((v == kobj + 12 && kobj == kobj) && 0 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && temp <= 2) && kobj == kobj) && \result <= unknown-#memory_int-unknown[kobj][kobj + 12]) && v == kobj) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) - InvariantResult [Line: 738]: Loop Invariant Derived loop invariant: (((((((((((unknown-#memory_int-unknown[kobj][12 + kobj] <= 1 && 0 == kobj) && kobj == kobj) && 0 == \result) && kobj == kobj) && kobj == kobj) && kobj == kobj) && unknown-#memory_int-unknown[\result][12] <= 1) && 1 <= unknown-#memory_int-unknown[\result][12]) && !(\result == 0)) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) || (((0 == kobj && 0 == \result) && kobj == 0) && \result == 0) - InvariantResult [Line: 688]: Loop Invariant [2022-12-13 13:27:58,212 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 13:27:58,212 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 13:27:58,212 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-12-13 13:27:58,212 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] Derived loop invariant: (!(kobj == 0) || !(kobj == 0)) && ((((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || !(kobj == 0)) || (((((((((v == kobj + 12 && kobj == kobj) && temp <= 2) && kobj == kobj) && v == kobj) && (\exists v_ArrVal_521 : int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_521]] && \old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= v_ArrVal_521 + 1)) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && \old(\valid) == \valid) && 1 <= i)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) || (((((((((v == kobj + 12 && kobj == kobj) && 0 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && temp <= 2) && kobj == kobj) && \result <= unknown-#memory_int-unknown[kobj][kobj + 12]) && v == kobj) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) RESULT: Ultimate proved your program to be correct! [2022-12-13 13:27:58,226 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dff4c068-413f-4e44-9745-76eb58129161/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE