./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 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/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_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro --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-8393723 [2022-11-18 20:09:07,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:09:07,589 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:09:07,619 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:09:07,620 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:09:07,626 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:09:07,630 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:09:07,639 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:09:07,642 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:09:07,647 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:09:07,648 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:09:07,652 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:09:07,653 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:09:07,657 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:09:07,659 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:09:07,660 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:09:07,663 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:09:07,671 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:09:07,673 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:09:07,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:09:07,685 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:09:07,687 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:09:07,688 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:09:07,689 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:09:07,694 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:09:07,699 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:09:07,699 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:09:07,700 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:09:07,702 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:09:07,703 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:09:07,705 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:09:07,706 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:09:07,708 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:09:07,710 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:09:07,713 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:09:07,714 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:09:07,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:09:07,715 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:09:07,716 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:09:07,717 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:09:07,718 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:09:07,719 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-18 20:09:07,759 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:09:07,760 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:09:07,760 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:09:07,760 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:09:07,761 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:09:07,761 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:09:07,762 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:09:07,762 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:09:07,763 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:09:07,763 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:09:07,763 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:09:07,764 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:09:07,764 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:09:07,764 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:09:07,764 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:09:07,765 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:09:07,765 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:09:07,765 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:09:07,765 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-18 20:09:07,766 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:09:07,766 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:09:07,766 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:09:07,767 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:09:07,767 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:09:07,767 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:09:07,767 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:09:07,768 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:09:07,768 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:09:07,768 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:09:07,769 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:09:07,769 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:09:07,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:09:07,769 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:09:07,770 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:09:07,770 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:09:07,770 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/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_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro 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-11-18 20:09:08,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:09:08,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:09:08,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:09:08,207 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:09:08,208 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:09:08,210 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2022-11-18 20:09:08,291 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/data/8c827fd81/22cfc59b0bb94911adbcc1e11b5dcbf5/FLAG1e2207001 [2022-11-18 20:09:09,021 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:09:09,022 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2022-11-18 20:09:09,047 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/data/8c827fd81/22cfc59b0bb94911adbcc1e11b5dcbf5/FLAG1e2207001 [2022-11-18 20:09:09,283 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/data/8c827fd81/22cfc59b0bb94911adbcc1e11b5dcbf5 [2022-11-18 20:09:09,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:09:09,288 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:09:09,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:09:09,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:09:09,294 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:09:09,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:09:09" (1/1) ... [2022-11-18 20:09:09,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b8974df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:09, skipping insertion in model container [2022-11-18 20:09:09,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:09:09" (1/1) ... [2022-11-18 20:09:09,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:09:09,380 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:09:10,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:09:10,062 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:09:10,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:09:10,185 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:09:10,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:10 WrapperNode [2022-11-18 20:09:10,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:09:10,187 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:09:10,187 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:09:10,187 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:09:10,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:10" (1/1) ... [2022-11-18 20:09:10,216 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:10" (1/1) ... [2022-11-18 20:09:10,274 INFO L138 Inliner]: procedures = 166, calls = 73, calls flagged for inlining = 25, calls inlined = 19, statements flattened = 125 [2022-11-18 20:09:10,275 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:09:10,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:09:10,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:09:10,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:09:10,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:10" (1/1) ... [2022-11-18 20:09:10,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:10" (1/1) ... [2022-11-18 20:09:10,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:10" (1/1) ... [2022-11-18 20:09:10,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:10" (1/1) ... [2022-11-18 20:09:10,321 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:10" (1/1) ... [2022-11-18 20:09:10,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:10" (1/1) ... [2022-11-18 20:09:10,340 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:10" (1/1) ... [2022-11-18 20:09:10,342 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:10" (1/1) ... [2022-11-18 20:09:10,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:09:10,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:09:10,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:09:10,355 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:09:10,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:10" (1/1) ... [2022-11-18 20:09:10,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:09:10,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:09:10,395 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:09:10,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:09:10,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:09:10,456 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-11-18 20:09:10,456 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-11-18 20:09:10,456 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-18 20:09:10,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-18 20:09:10,457 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2022-11-18 20:09:10,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2022-11-18 20:09:10,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:09:10,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:09:10,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:09:10,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 20:09:10,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 20:09:10,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:09:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-18 20:09:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:09:10,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:09:10,711 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:09:10,714 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:09:10,995 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:09:11,003 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:09:11,003 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 20:09:11,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:09:11 BoogieIcfgContainer [2022-11-18 20:09:11,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:09:11,010 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:09:11,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:09:11,024 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:09:11,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:09:09" (1/3) ... [2022-11-18 20:09:11,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13fc09a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:09:11, skipping insertion in model container [2022-11-18 20:09:11,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:10" (2/3) ... [2022-11-18 20:09:11,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13fc09a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:09:11, skipping insertion in model container [2022-11-18 20:09:11,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:09:11" (3/3) ... [2022-11-18 20:09:11,028 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3-1.i [2022-11-18 20:09:11,050 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:09:11,051 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-18 20:09:11,153 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:09:11,161 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;@557ad38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:09:11,162 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-18 20:09:11,169 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-11-18 20:09:11,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 20:09:11,181 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:11,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:09:11,184 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-11-18 20:09:11,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:11,195 INFO L85 PathProgramCache]: Analyzing trace with hash -846947467, now seen corresponding path program 1 times [2022-11-18 20:09:11,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:11,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455332918] [2022-11-18 20:09:11,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:11,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:11,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:11,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:09:11,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:11,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:11,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:11,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455332918] [2022-11-18 20:09:11,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455332918] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:11,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:11,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:09:11,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092309727] [2022-11-18 20:09:11,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:11,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:09:11,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:11,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:09:11,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:09:11,852 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-11-18 20:09:12,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:12,177 INFO L93 Difference]: Finished difference Result 122 states and 145 transitions. [2022-11-18 20:09:12,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:09:12,180 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-11-18 20:09:12,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:12,190 INFO L225 Difference]: With dead ends: 122 [2022-11-18 20:09:12,190 INFO L226 Difference]: Without dead ends: 80 [2022-11-18 20:09:12,194 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-11-18 20:09:12,197 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 44 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:12,198 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.2s Time] [2022-11-18 20:09:12,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-18 20:09:12,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 54. [2022-11-18 20:09:12,241 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-11-18 20:09:12,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-11-18 20:09:12,245 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 12 [2022-11-18 20:09:12,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:12,245 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-11-18 20:09:12,246 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-11-18 20:09:12,246 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-11-18 20:09:12,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 20:09:12,247 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:12,247 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:09:12,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:09:12,248 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-11-18 20:09:12,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:12,248 INFO L85 PathProgramCache]: Analyzing trace with hash 895862868, now seen corresponding path program 1 times [2022-11-18 20:09:12,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:12,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740782084] [2022-11-18 20:09:12,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:12,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:12,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:09:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:12,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:12,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:12,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740782084] [2022-11-18 20:09:12,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740782084] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:12,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:12,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:09:12,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704899174] [2022-11-18 20:09:12,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:12,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:09:12,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:12,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:09:12,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:09:12,450 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-11-18 20:09:12,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:12,627 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2022-11-18 20:09:12,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:09:12,628 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-11-18 20:09:12,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:12,630 INFO L225 Difference]: With dead ends: 100 [2022-11-18 20:09:12,630 INFO L226 Difference]: Without dead ends: 72 [2022-11-18 20:09:12,631 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-11-18 20:09:12,632 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-11-18 20:09:12,633 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-11-18 20:09:12,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-18 20:09:12,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 56. [2022-11-18 20:09:12,642 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-11-18 20:09:12,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2022-11-18 20:09:12,644 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 12 [2022-11-18 20:09:12,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:12,644 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2022-11-18 20:09:12,644 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-11-18 20:09:12,644 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2022-11-18 20:09:12,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 20:09:12,645 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:12,645 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:09:12,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:09:12,646 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-11-18 20:09:12,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:12,647 INFO L85 PathProgramCache]: Analyzing trace with hash 366281122, now seen corresponding path program 1 times [2022-11-18 20:09:12,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:12,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868423401] [2022-11-18 20:09:12,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:12,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:12,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:09:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:12,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:12,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:12,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868423401] [2022-11-18 20:09:12,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868423401] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:12,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:12,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:09:12,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376682944] [2022-11-18 20:09:12,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:12,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:09:12,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:12,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:09:12,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:09:12,882 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-11-18 20:09:13,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:13,110 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2022-11-18 20:09:13,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:09:13,111 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-11-18 20:09:13,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:13,112 INFO L225 Difference]: With dead ends: 113 [2022-11-18 20:09:13,112 INFO L226 Difference]: Without dead ends: 82 [2022-11-18 20:09:13,113 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-11-18 20:09:13,114 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.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:13,115 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.2s Time] [2022-11-18 20:09:13,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-18 20:09:13,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 59. [2022-11-18 20:09:13,123 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-11-18 20:09:13,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2022-11-18 20:09:13,124 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 16 [2022-11-18 20:09:13,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:13,124 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2022-11-18 20:09:13,124 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-11-18 20:09:13,125 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-11-18 20:09:13,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 20:09:13,125 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:13,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:09:13,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:09:13,126 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-11-18 20:09:13,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:13,127 INFO L85 PathProgramCache]: Analyzing trace with hash 495363841, now seen corresponding path program 1 times [2022-11-18 20:09:13,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:13,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914798231] [2022-11-18 20:09:13,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:13,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:13,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:13,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:09:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:13,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:13,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:13,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914798231] [2022-11-18 20:09:13,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914798231] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:13,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:13,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:09:13,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418199854] [2022-11-18 20:09:13,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:13,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:09:13,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:13,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:09:13,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:09:13,262 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-11-18 20:09:13,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:13,420 INFO L93 Difference]: Finished difference Result 107 states and 124 transitions. [2022-11-18 20:09:13,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:09:13,421 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-11-18 20:09:13,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:13,423 INFO L225 Difference]: With dead ends: 107 [2022-11-18 20:09:13,424 INFO L226 Difference]: Without dead ends: 66 [2022-11-18 20:09:13,428 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-11-18 20:09:13,430 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-11-18 20:09:13,431 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-11-18 20:09:13,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-18 20:09:13,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2022-11-18 20:09:13,438 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-11-18 20:09:13,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2022-11-18 20:09:13,439 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 16 [2022-11-18 20:09:13,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:13,439 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2022-11-18 20:09:13,440 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-11-18 20:09:13,440 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-11-18 20:09:13,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-18 20:09:13,441 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:13,441 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:09:13,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:09:13,441 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-11-18 20:09:13,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:13,442 INFO L85 PathProgramCache]: Analyzing trace with hash -835975854, now seen corresponding path program 1 times [2022-11-18 20:09:13,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:13,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599486601] [2022-11-18 20:09:13,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:13,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:13,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:09:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:13,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:13,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:13,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599486601] [2022-11-18 20:09:13,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599486601] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:13,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:13,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:09:13,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799328659] [2022-11-18 20:09:13,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:13,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:09:13,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:13,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:09:13,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:09:13,604 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-11-18 20:09:13,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:13,860 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2022-11-18 20:09:13,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:09:13,861 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-11-18 20:09:13,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:13,862 INFO L225 Difference]: With dead ends: 90 [2022-11-18 20:09:13,862 INFO L226 Difference]: Without dead ends: 56 [2022-11-18 20:09:13,863 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-11-18 20:09:13,864 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.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:13,865 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.2s Time] [2022-11-18 20:09:13,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-18 20:09:13,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2022-11-18 20:09:13,870 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-11-18 20:09:13,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2022-11-18 20:09:13,872 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 18 [2022-11-18 20:09:13,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:13,872 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2022-11-18 20:09:13,873 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-11-18 20:09:13,873 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2022-11-18 20:09:13,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-18 20:09:13,874 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:13,874 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:09:13,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:09:13,875 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-11-18 20:09:13,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:13,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1292786891, now seen corresponding path program 1 times [2022-11-18 20:09:13,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:13,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934265922] [2022-11-18 20:09:13,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:13,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:13,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:09:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:14,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:14,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:14,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934265922] [2022-11-18 20:09:14,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934265922] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:14,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:14,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:09:14,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701778304] [2022-11-18 20:09:14,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:14,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:09:14,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:14,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:09:14,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:09:14,026 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-11-18 20:09:14,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:14,201 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2022-11-18 20:09:14,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:09:14,202 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-11-18 20:09:14,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:14,203 INFO L225 Difference]: With dead ends: 86 [2022-11-18 20:09:14,204 INFO L226 Difference]: Without dead ends: 54 [2022-11-18 20:09:14,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:09:14,205 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-11-18 20:09:14,206 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-11-18 20:09:14,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-18 20:09:14,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2022-11-18 20:09:14,213 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-11-18 20:09:14,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-11-18 20:09:14,214 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 18 [2022-11-18 20:09:14,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:14,215 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-11-18 20:09:14,215 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-11-18 20:09:14,216 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-11-18 20:09:14,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-18 20:09:14,217 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:14,217 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-11-18 20:09:14,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:09:14,218 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-11-18 20:09:14,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:14,218 INFO L85 PathProgramCache]: Analyzing trace with hash 259861478, now seen corresponding path program 1 times [2022-11-18 20:09:14,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:14,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310748388] [2022-11-18 20:09:14,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:14,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:14,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:09:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:14,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-18 20:09:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:14,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:14,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:14,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310748388] [2022-11-18 20:09:14,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310748388] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:14,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:14,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:09:14,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115778753] [2022-11-18 20:09:14,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:14,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:09:14,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:14,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:09:14,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:09:14,358 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-11-18 20:09:14,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:14,489 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-11-18 20:09:14,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:09:14,490 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-11-18 20:09:14,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:14,491 INFO L225 Difference]: With dead ends: 97 [2022-11-18 20:09:14,492 INFO L226 Difference]: Without dead ends: 57 [2022-11-18 20:09:14,492 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-11-18 20:09:14,493 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-11-18 20:09:14,494 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-11-18 20:09:14,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-18 20:09:14,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2022-11-18 20:09:14,501 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-11-18 20:09:14,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2022-11-18 20:09:14,507 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 23 [2022-11-18 20:09:14,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:14,508 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2022-11-18 20:09:14,508 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-11-18 20:09:14,509 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-11-18 20:09:14,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-18 20:09:14,511 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:14,511 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-11-18 20:09:14,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:09:14,512 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-11-18 20:09:14,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:14,513 INFO L85 PathProgramCache]: Analyzing trace with hash 451023015, now seen corresponding path program 1 times [2022-11-18 20:09:14,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:14,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271150434] [2022-11-18 20:09:14,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:14,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:14,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:09:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:14,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:09:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:14,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:14,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:14,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271150434] [2022-11-18 20:09:14,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271150434] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:09:14,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429259433] [2022-11-18 20:09:14,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:14,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:09:14,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:09:14,803 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:09:14,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:09:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:14,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 91 conjunts are in the unsatisfiable core [2022-11-18 20:09:14,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:09:15,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:09:15,368 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-11-18 20:09:15,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:15,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:15,424 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-11-18 20:09:15,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 20:09:15,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:09:15,552 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:09:15,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429259433] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:15,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:09:15,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 18 [2022-11-18 20:09:15,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264940291] [2022-11-18 20:09:15,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:15,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-18 20:09:15,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:15,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-18 20:09:15,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=234, Unknown=1, NotChecked=30, Total=306 [2022-11-18 20:09:15,554 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-11-18 20:09:15,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:15,936 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2022-11-18 20:09:15,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 20:09:15,937 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-11-18 20:09:15,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:15,938 INFO L225 Difference]: With dead ends: 59 [2022-11-18 20:09:15,938 INFO L226 Difference]: Without dead ends: 58 [2022-11-18 20:09:15,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=430, Unknown=1, NotChecked=42, Total=552 [2022-11-18 20:09:15,940 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 67 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:15,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 251 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 198 Invalid, 0 Unknown, 63 Unchecked, 0.2s Time] [2022-11-18 20:09:15,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-18 20:09:15,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2022-11-18 20:09:15,948 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-11-18 20:09:15,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-11-18 20:09:15,949 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 24 [2022-11-18 20:09:15,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:15,949 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-11-18 20:09:15,950 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-11-18 20:09:15,950 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-11-18 20:09:15,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-18 20:09:15,950 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:15,951 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-11-18 20:09:15,958 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 20:09:16,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:09:16,157 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-11-18 20:09:16,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:16,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1096811657, now seen corresponding path program 1 times [2022-11-18 20:09:16,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:16,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410007277] [2022-11-18 20:09:16,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:16,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:16,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:09:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:16,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:09:16,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:16,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:16,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:16,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410007277] [2022-11-18 20:09:16,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410007277] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:09:16,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088330306] [2022-11-18 20:09:16,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:16,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:09:16,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:09:16,371 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:09:16,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:09:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:16,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 91 conjunts are in the unsatisfiable core [2022-11-18 20:09:16,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:09:16,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:09:16,705 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-11-18 20:09:16,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:16,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:16,738 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-11-18 20:09:16,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 20:09:16,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:09:16,868 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:09:16,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088330306] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:16,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:09:16,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 18 [2022-11-18 20:09:16,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292751078] [2022-11-18 20:09:16,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:16,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-18 20:09:16,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:16,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-18 20:09:16,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=234, Unknown=1, NotChecked=30, Total=306 [2022-11-18 20:09:16,871 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-11-18 20:09:17,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:17,250 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2022-11-18 20:09:17,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 20:09:17,251 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-11-18 20:09:17,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:17,251 INFO L225 Difference]: With dead ends: 62 [2022-11-18 20:09:17,251 INFO L226 Difference]: Without dead ends: 61 [2022-11-18 20:09:17,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=471, Unknown=1, NotChecked=44, Total=600 [2022-11-18 20:09:17,253 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 56 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:17,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 323 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 235 Invalid, 0 Unknown, 66 Unchecked, 0.2s Time] [2022-11-18 20:09:17,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-18 20:09:17,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 49. [2022-11-18 20:09:17,260 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-11-18 20:09:17,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2022-11-18 20:09:17,261 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 25 [2022-11-18 20:09:17,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:17,261 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2022-11-18 20:09:17,261 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-11-18 20:09:17,261 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-11-18 20:09:17,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-18 20:09:17,262 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:17,262 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-11-18 20:09:17,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:09:17,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:09:17,475 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-11-18 20:09:17,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:17,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1913158811, now seen corresponding path program 1 times [2022-11-18 20:09:17,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:17,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045070051] [2022-11-18 20:09:17,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:17,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:17,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:09:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:17,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:09:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:17,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:09:17,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:17,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045070051] [2022-11-18 20:09:17,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045070051] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:17,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:17,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 20:09:17,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588685549] [2022-11-18 20:09:17,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:17,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:09:17,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:17,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:09:17,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:09:17,677 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-11-18 20:09:17,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:17,887 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-11-18 20:09:17,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:09:17,888 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-11-18 20:09:17,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:17,888 INFO L225 Difference]: With dead ends: 77 [2022-11-18 20:09:17,888 INFO L226 Difference]: Without dead ends: 55 [2022-11-18 20:09:17,889 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-11-18 20:09:17,889 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-11-18 20:09:17,890 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-11-18 20:09:17,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-18 20:09:17,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2022-11-18 20:09:17,897 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-11-18 20:09:17,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2022-11-18 20:09:17,898 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 30 [2022-11-18 20:09:17,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:17,898 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2022-11-18 20:09:17,898 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-11-18 20:09:17,899 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-11-18 20:09:17,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-18 20:09:17,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:17,899 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-11-18 20:09:17,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 20:09:17,900 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-11-18 20:09:17,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:17,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1920244181, now seen corresponding path program 1 times [2022-11-18 20:09:17,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:17,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392177912] [2022-11-18 20:09:17,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:17,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:18,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:09:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:18,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 20:09:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:18,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:18,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:18,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392177912] [2022-11-18 20:09:18,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392177912] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:09:18,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749366733] [2022-11-18 20:09:18,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:18,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:09:18,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:09:18,109 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:09:18,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:09:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:18,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 150 conjunts are in the unsatisfiable core [2022-11-18 20:09:18,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:09:18,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:09:18,669 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-11-18 20:09:18,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:18,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:18,707 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-11-18 20:09:18,932 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:09:18,935 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:09:18,936 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-11-18 20:09:19,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 20:09:19,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-11-18 20:09:19,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:09:21,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749366733] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:09:21,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:09:21,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 20] total 25 [2022-11-18 20:09:21,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753708986] [2022-11-18 20:09:21,806 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:09:21,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-18 20:09:21,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:21,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-18 20:09:21,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1029, Unknown=2, NotChecked=64, Total=1190 [2022-11-18 20:09:21,808 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 20 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-11-18 20:09:31,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:31,358 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2022-11-18 20:09:31,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-18 20:09:31,358 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 20 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-11-18 20:09:31,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:31,359 INFO L225 Difference]: With dead ends: 117 [2022-11-18 20:09:31,360 INFO L226 Difference]: Without dead ends: 63 [2022-11-18 20:09:31,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=244, Invalid=2404, Unknown=8, NotChecked=100, Total=2756 [2022-11-18 20:09:31,362 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 149 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:31,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 293 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 693 Invalid, 0 Unknown, 67 Unchecked, 0.7s Time] [2022-11-18 20:09:31,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-18 20:09:31,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 58. [2022-11-18 20:09:31,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 47 states have (on average 1.127659574468085) internal successors, (53), 49 states have internal predecessors, (53), 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-11-18 20:09:31,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2022-11-18 20:09:31,374 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 34 [2022-11-18 20:09:31,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:31,375 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2022-11-18 20:09:31,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 20 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-11-18 20:09:31,375 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-11-18 20:09:31,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-18 20:09:31,381 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:31,381 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-11-18 20:09:31,417 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 20:09:31,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:09:31,613 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-11-18 20:09:31,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:31,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1143461147, now seen corresponding path program 1 times [2022-11-18 20:09:31,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:31,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63609752] [2022-11-18 20:09:31,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:31,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:31,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:09:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:31,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 20:09:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:31,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:31,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:31,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63609752] [2022-11-18 20:09:31,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63609752] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:09:31,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097025701] [2022-11-18 20:09:31,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:31,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:09:31,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:09:31,946 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:09:31,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 20:09:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:32,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 157 conjunts are in the unsatisfiable core [2022-11-18 20:09:32,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:09:32,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:09:32,425 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-11-18 20:09:32,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:32,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:32,457 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-11-18 20:09:32,709 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:09:32,714 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:09:32,714 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-11-18 20:09:32,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 20:09:32,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:32,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:09:35,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097025701] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:09:35,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:09:35,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 20] total 26 [2022-11-18 20:09:35,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966107172] [2022-11-18 20:09:35,817 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:09:35,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-18 20:09:35,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:35,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-18 20:09:35,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1092, Unknown=2, NotChecked=66, Total=1260 [2022-11-18 20:09:35,819 INFO L87 Difference]: Start difference. First operand 58 states and 62 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-11-18 20:09:45,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:45,163 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2022-11-18 20:09:45,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-18 20:09:45,163 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-11-18 20:09:45,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:45,164 INFO L225 Difference]: With dead ends: 109 [2022-11-18 20:09:45,164 INFO L226 Difference]: Without dead ends: 59 [2022-11-18 20:09:45,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=234, Invalid=2115, Unknown=7, NotChecked=94, Total=2450 [2022-11-18 20:09:45,166 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 114 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:45,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 263 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 656 Invalid, 0 Unknown, 56 Unchecked, 0.6s Time] [2022-11-18 20:09:45,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-18 20:09:45,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2022-11-18 20:09:45,173 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-11-18 20:09:45,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-11-18 20:09:45,174 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 36 [2022-11-18 20:09:45,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:45,174 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-11-18 20:09:45,175 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-11-18 20:09:45,175 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-11-18 20:09:45,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-18 20:09:45,176 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:45,176 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-11-18 20:09:45,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:09:45,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-18 20:09:45,382 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-11-18 20:09:45,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:45,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1304169571, now seen corresponding path program 1 times [2022-11-18 20:09:45,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:45,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328420404] [2022-11-18 20:09:45,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:45,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:45,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:09:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:45,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 20:09:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:45,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 20:09:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:45,781 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:45,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:45,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328420404] [2022-11-18 20:09:45,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328420404] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:09:45,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556783096] [2022-11-18 20:09:45,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:45,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:09:45,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:09:45,784 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:09:45,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 20:09:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:46,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 109 conjunts are in the unsatisfiable core [2022-11-18 20:09:46,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:09:46,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:09:46,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 20:09:46,623 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:09:46,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:09:47,053 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-11-18 20:09:47,132 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-11-18 20:09:47,247 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-18 20:09:47,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556783096] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:09:47,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:09:47,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 9] total 30 [2022-11-18 20:09:47,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978911414] [2022-11-18 20:09:47,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:09:47,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-18 20:09:47,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:47,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-18 20:09:47,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2022-11-18 20:09:47,250 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 30 states, 28 states have (on average 3.8214285714285716) internal successors, (107), 25 states have internal predecessors, (107), 7 states have call successors, (11), 7 states have call predecessors, (11), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-18 20:09:48,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:48,677 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2022-11-18 20:09:48,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-18 20:09:48,678 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 3.8214285714285716) internal successors, (107), 25 states have internal predecessors, (107), 7 states have call successors, (11), 7 states have call predecessors, (11), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 48 [2022-11-18 20:09:48,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:48,679 INFO L225 Difference]: With dead ends: 101 [2022-11-18 20:09:48,679 INFO L226 Difference]: Without dead ends: 59 [2022-11-18 20:09:48,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=230, Invalid=2026, Unknown=0, NotChecked=0, Total=2256 [2022-11-18 20:09:48,680 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 115 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:48,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 417 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-18 20:09:48,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-18 20:09:48,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2022-11-18 20:09:48,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 47 states have (on average 1.0638297872340425) 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-11-18 20:09:48,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-11-18 20:09:48,692 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 48 [2022-11-18 20:09:48,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:48,692 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-11-18 20:09:48,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 3.8214285714285716) internal successors, (107), 25 states have internal predecessors, (107), 7 states have call successors, (11), 7 states have call predecessors, (11), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-18 20:09:48,693 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-11-18 20:09:48,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-18 20:09:48,693 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:48,694 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-11-18 20:09:48,707 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-18 20:09:48,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-18 20:09:48,901 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-11-18 20:09:48,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:48,902 INFO L85 PathProgramCache]: Analyzing trace with hash -710408717, now seen corresponding path program 1 times [2022-11-18 20:09:48,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:48,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118163362] [2022-11-18 20:09:48,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:48,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:49,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:09:49,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:49,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:09:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:49,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-18 20:09:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:49,293 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:49,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:49,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118163362] [2022-11-18 20:09:49,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118163362] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:09:49,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914816475] [2022-11-18 20:09:49,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:49,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:09:49,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:09:49,295 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:09:49,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 20:09:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:49,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 216 conjunts are in the unsatisfiable core [2022-11-18 20:09:49,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:09:49,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:09:49,831 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_650 Int) (LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_649 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_649) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_650)) |c_#memory_int|))) is different from true [2022-11-18 20:09:49,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:49,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:49,864 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-11-18 20:09:50,070 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:09:50,074 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:09:50,074 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 29 treesize of output 27 [2022-11-18 20:09:50,554 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-11-18 20:09:50,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 20:09:50,768 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:09:50,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:09:51,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914816475] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:09:51,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:09:51,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 25] total 34 [2022-11-18 20:09:51,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563869208] [2022-11-18 20:09:51,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:09:51,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-18 20:09:51,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:51,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-18 20:09:51,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1294, Unknown=1, NotChecked=72, Total=1482 [2022-11-18 20:09:51,370 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 34 states, 33 states have (on average 2.515151515151515) internal successors, (83), 28 states have internal predecessors, (83), 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-11-18 20:10:00,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:10:00,637 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2022-11-18 20:10:00,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-18 20:10:00,638 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.515151515151515) internal successors, (83), 28 states have internal predecessors, (83), 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 50 [2022-11-18 20:10:00,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:10:00,638 INFO L225 Difference]: With dead ends: 96 [2022-11-18 20:10:00,638 INFO L226 Difference]: Without dead ends: 0 [2022-11-18 20:10:00,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=250, Invalid=2718, Unknown=6, NotChecked=106, Total=3080 [2022-11-18 20:10:00,640 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 61 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:10:00,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 512 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 618 Invalid, 0 Unknown, 90 Unchecked, 0.5s Time] [2022-11-18 20:10:00,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-18 20:10:00,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-18 20:10:00,642 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-11-18 20:10:00,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-18 20:10:00,642 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2022-11-18 20:10:00,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:10:00,643 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-18 20:10:00,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.515151515151515) internal successors, (83), 28 states have internal predecessors, (83), 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-11-18 20:10:00,643 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-18 20:10:00,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-18 20:10:00,654 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-11-18 20:10:00,654 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-11-18 20:10:00,655 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-11-18 20:10:00,655 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-11-18 20:10:00,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-18 20:10:00,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-18 20:10:00,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-18 20:10:02,569 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 525 531) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2022-11-18 20:10:02,569 INFO L899 garLoopResultBuilder]: For program point L526(lines 526 530) no Hoare annotation was computed. [2022-11-18 20:10:02,569 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 525 531) no Hoare annotation was computed. [2022-11-18 20:10:02,569 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 525 531) no Hoare annotation was computed. [2022-11-18 20:10:02,569 INFO L899 garLoopResultBuilder]: For program point L659(line 659) no Hoare annotation was computed. [2022-11-18 20:10:02,569 INFO L899 garLoopResultBuilder]: For program point L659-1(line 659) no Hoare annotation was computed. [2022-11-18 20:10:02,569 INFO L899 garLoopResultBuilder]: For program point L717(lines 717 718) no Hoare annotation was computed. [2022-11-18 20:10:02,569 INFO L899 garLoopResultBuilder]: For program point L684(lines 684 687) no Hoare annotation was computed. [2022-11-18 20:10:02,570 INFO L899 garLoopResultBuilder]: For program point L717-2(lines 717 718) no Hoare annotation was computed. [2022-11-18 20:10:02,570 INFO L895 garLoopResultBuilder]: At program point L746(lines 738 747) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (.cse2 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) (.cse1 (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) (.cse3 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0))) (or (and .cse0 (not .cse1) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) 12) 1) .cse2 (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) 1) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not .cse3) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0))) (and .cse0 .cse2 .cse1 .cse3))) [2022-11-18 20:10:02,570 INFO L899 garLoopResultBuilder]: For program point L680(lines 680 683) no Hoare annotation was computed. [2022-11-18 20:10:02,570 INFO L899 garLoopResultBuilder]: For program point L742(lines 742 743) no Hoare annotation was computed. [2022-11-18 20:10:02,570 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-18 20:10:02,570 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 659) no Hoare annotation was computed. [2022-11-18 20:10:02,571 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-18 20:10:02,571 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-11-18 20:10:02,571 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-18 20:10:02,571 INFO L899 garLoopResultBuilder]: For program point L-1-3(line -1) no Hoare annotation was computed. [2022-11-18 20:10:02,571 INFO L899 garLoopResultBuilder]: For program point L730(lines 730 732) no Hoare annotation was computed. [2022-11-18 20:10:02,572 INFO L895 garLoopResultBuilder]: At program point L726(line 726) the Hoare annotation is: (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|) (= |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|) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|)) 1) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0))) [2022-11-18 20:10:02,572 INFO L895 garLoopResultBuilder]: At program point L726-1(lines 721 727) 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)) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) 1) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0))) [2022-11-18 20:10:02,572 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 659) no Hoare annotation was computed. [2022-11-18 20:10:02,572 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-18 20:10:02,573 INFO L895 garLoopResultBuilder]: At program point L768(line 768) the Hoare annotation is: (let ((.cse7 (select (select |#memory_int| |ULTIMATE.start_f_22_put_~kobj#1.base|) 12)) (.cse3 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0))) (let ((.cse4 (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) (.cse5 (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0))) (.cse0 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|)) (.cse6 (not (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.base| 0))) (.cse8 (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0))) (.cse9 (not .cse3)) (.cse14 (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|)) (.cse12 (+ |ULTIMATE.start_entry_point_~kobj~2#1.offset| 12)) (.cse1 (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0)) (.cse11 (<= .cse7 2)) (.cse13 (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0))) (.cse2 (= |ULTIMATE.start_f_22_put_~kobj#1.offset| 0))) (or (and (= |ULTIMATE.start_f_22_put_~kobj#1.base| 0) .cse0 (= |ULTIMATE.start_entry_point_~kobj~2#1.base| 0) .cse1 .cse2 .cse3) (let ((.cse10 (select .cse14 12))) (and (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.offset| |ULTIMATE.start_entry_point_~kobj~2#1.offset|) .cse4 .cse5 .cse0 (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|))) .cse6 (<= 2 .cse7) (<= 1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) 12)) .cse8 .cse9 (<= .cse10 2) .cse1 .cse11 (= .cse12 |ULTIMATE.start_ldv_atomic_add_return_~v#1.offset|) .cse13 .cse2 (<= (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 .cse10))) (and .cse4 .cse5 .cse0 .cse6 .cse8 .cse9 (<= 1 (select .cse14 .cse12)) .cse1 .cse11 .cse13 .cse2 (= |ULTIMATE.start_entry_point_~kobj~2#1.base| |ULTIMATE.start_f_22_put_~kobj#1.base|))))) [2022-11-18 20:10:02,573 INFO L899 garLoopResultBuilder]: For program point L768-1(lines 763 769) no Hoare annotation was computed. [2022-11-18 20:10:02,573 INFO L895 garLoopResultBuilder]: At program point L731(lines 728 737) 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)) (= (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)) 1) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0))) [2022-11-18 20:10:02,574 INFO L895 garLoopResultBuilder]: At program point L661(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|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|) (<= 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 (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 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|) (<= 2 .cse0))) [2022-11-18 20:10:02,574 INFO L899 garLoopResultBuilder]: For program point L723(lines 723 724) no Hoare annotation was computed. [2022-11-18 20:10:02,574 INFO L895 garLoopResultBuilder]: At program point L719(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|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) .cse0 (<= 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 (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 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-11-18 20:10:02,575 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|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) .cse0 (<= 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 (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 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-11-18 20:10:02,575 INFO L899 garLoopResultBuilder]: For program point L761-1(lines 760 762) no Hoare annotation was computed. [2022-11-18 20:10:02,575 INFO L899 garLoopResultBuilder]: For program point L757(lines 757 759) no Hoare annotation was computed. [2022-11-18 20:10:02,575 INFO L902 garLoopResultBuilder]: At program point L741(line 741) the Hoare annotation is: true [2022-11-18 20:10:02,575 INFO L899 garLoopResultBuilder]: For program point L741-1(line 741) no Hoare annotation was computed. [2022-11-18 20:10:02,575 INFO L899 garLoopResultBuilder]: For program point L770(lines 770 772) no Hoare annotation was computed. [2022-11-18 20:10:02,576 INFO L895 garLoopResultBuilder]: At program point LDV_INIT_LIST_HEADENTRY(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-11-18 20:10:02,576 INFO L899 garLoopResultBuilder]: For program point LDV_INIT_LIST_HEADFINAL(lines 538 542) no Hoare annotation was computed. [2022-11-18 20:10:02,576 INFO L899 garLoopResultBuilder]: For program point LDV_INIT_LIST_HEADEXIT(lines 538 542) no Hoare annotation was computed. [2022-11-18 20:10:02,577 INFO L895 garLoopResultBuilder]: At program point L669(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 ((.cse0 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (.cse1 (select .cse4 .cse3))) (and (or .cse0 (not (<= 1 .cse1)) (not (<= .cse1 2147483647)) (= |old(#valid)| |#valid|)) (or .cse0 (not (= |ldv_kobject_put_#in~kobj#1.base| 0))) (let ((.cse2 (select .cse4 12))) (or (not (<= .cse2 2)) .cse0 (not (<= 2 .cse2)) (and (<= .cse1 (+ |ldv_kobject_put_ldv_atomic_sub_return_#res#1| 1)) (= |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_~v#1.base| |ldv_kobject_put_#in~kobj#1.base|) (exists ((v_ArrVal_653 Int)) (and (<= |ldv_kobject_put_ldv_atomic_sub_return_#res#1| v_ArrVal_653) (= (store |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base| (store .cse4 .cse3 v_ArrVal_653)) |#memory_int|))) (= |ldv_kobject_put_~kobj#1.offset| 0) (<= (select (select |#memory_int| |ldv_kobject_put_~kobj#1.base|) 12) 2) (<= 1 |ldv_kobject_put_ldv_atomic_sub_return_~i#1|))))))) [2022-11-18 20:10:02,577 INFO L899 garLoopResultBuilder]: For program point L667(line 667) no Hoare annotation was computed. [2022-11-18 20:10:02,577 INFO L899 garLoopResultBuilder]: For program point L667-1(line 667) no Hoare annotation was computed. [2022-11-18 20:10:02,578 INFO L895 garLoopResultBuilder]: At program point L690(lines 688 691) the Hoare annotation is: (let ((.cse1 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0)))) (and (let ((.cse3 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|))) (let ((.cse0 (select .cse3 12))) (or (not (<= .cse0 2)) .cse1 (let ((.cse2 (+ |ldv_kobject_put_#in~kobj#1.offset| 12))) (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|) (exists ((v_ArrVal_653 Int)) (and (<= (select .cse3 .cse2) (+ v_ArrVal_653 1)) (= (store |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base| (store .cse3 .cse2 v_ArrVal_653)) |#memory_int|))) (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 2) (= |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 (select |#memory_int| |ldv_kobject_put_~kobj#1.base|) 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-11-18 20:10:02,578 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-11-18 20:10:02,578 INFO L895 garLoopResultBuilder]: At program point ldv_kobject_putENTRY(lines 709 714) the Hoare annotation is: (let ((.cse0 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (.cse1 (= |old(#valid)| |#valid|))) (and (let ((.cse2 (select (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|) (+ |ldv_kobject_put_#in~kobj#1.offset| 12)))) (or .cse0 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) .cse1) (not (<= 1 .cse2)) (not (<= .cse2 2147483647)))) (or .cse0 (not (= |ldv_kobject_put_#in~kobj#1.base| 0)) .cse1))) [2022-11-18 20:10:02,578 INFO L899 garLoopResultBuilder]: For program point L711(lines 711 713) no Hoare annotation was computed. [2022-11-18 20:10:02,579 INFO L895 garLoopResultBuilder]: At program point L678(lines 671 679) the Hoare annotation is: (let ((.cse1 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0)))) (and (let ((.cse3 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|))) (let ((.cse0 (select .cse3 12))) (or (not (<= .cse0 2)) .cse1 (let ((.cse2 (+ |ldv_kobject_put_#in~kobj#1.offset| 12))) (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|) (exists ((v_ArrVal_653 Int)) (and (<= (select .cse3 .cse2) (+ v_ArrVal_653 1)) (= (store |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base| (store .cse3 .cse2 v_ArrVal_653)) |#memory_int|))) (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 2) (= |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 (select |#memory_int| |ldv_kobject_put_~kobj#1.base|) 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-11-18 20:10:02,579 INFO L899 garLoopResultBuilder]: For program point L711-2(lines 709 714) no Hoare annotation was computed. [2022-11-18 20:10:02,579 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putEXIT(lines 709 714) no Hoare annotation was computed. [2022-11-18 20:10:02,579 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 677) no Hoare annotation was computed. [2022-11-18 20:10:02,580 INFO L899 garLoopResultBuilder]: For program point L705(lines 705 708) no Hoare annotation was computed. [2022-11-18 20:10:02,580 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse1 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0)))) (and (let ((.cse3 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|))) (let ((.cse0 (select .cse3 12))) (or (not (<= .cse0 2)) .cse1 (let ((.cse2 (+ |ldv_kobject_put_#in~kobj#1.offset| 12))) (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|) (exists ((v_ArrVal_653 Int)) (and (<= (select .cse3 .cse2) (+ v_ArrVal_653 1)) (= (store |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base| (store .cse3 .cse2 v_ArrVal_653)) |#memory_int|))) (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 2) (= |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 (select |#memory_int| |ldv_kobject_put_~kobj#1.base|) 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-11-18 20:10:02,580 INFO L899 garLoopResultBuilder]: For program point L701(lines 701 703) no Hoare annotation was computed. [2022-11-18 20:10:02,580 INFO L899 garLoopResultBuilder]: For program point L697(lines 697 704) no Hoare annotation was computed. [2022-11-18 20:10:02,581 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-11-18 20:10:02,584 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:10:02,587 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:10:02,604 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] [2022-11-18 20:10:02,605 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] [2022-11-18 20:10:02,607 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] [2022-11-18 20:10:02,608 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] [2022-11-18 20:10:02,612 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] [2022-11-18 20:10:02,612 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] [2022-11-18 20:10:02,614 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] [2022-11-18 20:10:02,614 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] [2022-11-18 20:10:02,618 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] [2022-11-18 20:10:02,619 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] [2022-11-18 20:10:02,620 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] [2022-11-18 20:10:02,620 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] [2022-11-18 20:10:02,622 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] [2022-11-18 20:10:02,623 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] [2022-11-18 20:10:02,624 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] [2022-11-18 20:10:02,625 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] [2022-11-18 20:10:02,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:10:02 BoogieIcfgContainer [2022-11-18 20:10:02,626 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:10:02,627 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:10:02,627 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:10:02,627 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:10:02,628 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:09:11" (3/4) ... [2022-11-18 20:10:02,631 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-18 20:10:02,639 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-18 20:10:02,639 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2022-11-18 20:10:02,640 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2022-11-18 20:10:02,645 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2022-11-18 20:10:02,646 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-11-18 20:10:02,646 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-18 20:10:02,673 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((0 == kobj && !(kobj == 0)) && unknown-#memory_int-unknown[\result][12] == 1) && 0 == \result) && unknown-#memory_int-unknown[kobj][12 + kobj] == 1) && !(kobj == 0)) && !(\result == 0)) && !(kobj == 0)) || (((0 == kobj && 0 == \result) && kobj == 0) && \result == 0) [2022-11-18 20:10:02,674 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((0 == kobj && !(kobj == 0)) && 0 == \result) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[\result][12]) && kobj == 0) && !(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-11-18 20:10:02,674 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((0 == kobj && !(kobj == 0)) && 0 == \result) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[\result][12]) && kobj == 0) && !(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] [2022-11-18 20:10:02,675 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(kobj == 0) || !(1 <= \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])) || ((((((((\old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= \result + 1 && v == kobj + 12) && kobj == kobj) && temp <= 2) && v == kobj) && (\exists v_ArrVal_653 : int :: \result <= v_ArrVal_653 && \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_653]] == unknown-#memory_int-unknown)) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) [2022-11-18 20:10:02,675 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) && (\exists v_ArrVal_653 : int :: \old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= v_ArrVal_653 + 1 && \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_653]] == unknown-#memory_int-unknown)) && temp <= 2) && 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-11-18 20:10:02,676 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) && (\exists v_ArrVal_653 : int :: \old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= v_ArrVal_653 + 1 && \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_653]] == unknown-#memory_int-unknown)) && temp <= 2) && 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-11-18 20:10:02,676 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) && (\exists v_ArrVal_653 : int :: \old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= v_ArrVal_653 + 1 && \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_653]] == unknown-#memory_int-unknown)) && temp <= 2) && 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-11-18 20:10:02,709 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 20:10:02,710 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:10:02,711 INFO L158 Benchmark]: Toolchain (without parser) took 53422.84ms. Allocated memory was 107.0MB in the beginning and 201.3MB in the end (delta: 94.4MB). Free memory was 73.5MB in the beginning and 79.6MB in the end (delta: -6.1MB). Peak memory consumption was 87.3MB. Max. memory is 16.1GB. [2022-11-18 20:10:02,711 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 107.0MB. Free memory was 60.1MB in the beginning and 60.1MB in the end (delta: 41.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:10:02,712 INFO L158 Benchmark]: CACSL2BoogieTranslator took 896.16ms. Allocated memory is still 107.0MB. Free memory was 73.3MB in the beginning and 72.1MB in the end (delta: 1.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 20:10:02,713 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.45ms. Allocated memory is still 107.0MB. Free memory was 72.1MB in the beginning and 69.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:10:02,716 INFO L158 Benchmark]: Boogie Preprocessor took 77.39ms. Allocated memory is still 107.0MB. Free memory was 69.6MB in the beginning and 67.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:10:02,716 INFO L158 Benchmark]: RCFGBuilder took 652.10ms. Allocated memory is still 107.0MB. Free memory was 67.5MB in the beginning and 49.0MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-18 20:10:02,717 INFO L158 Benchmark]: TraceAbstraction took 51616.29ms. Allocated memory was 107.0MB in the beginning and 201.3MB in the end (delta: 94.4MB). Free memory was 48.2MB in the beginning and 83.8MB in the end (delta: -35.6MB). Peak memory consumption was 85.6MB. Max. memory is 16.1GB. [2022-11-18 20:10:02,717 INFO L158 Benchmark]: Witness Printer took 83.39ms. Allocated memory is still 201.3MB. Free memory was 83.8MB in the beginning and 79.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 20:10:02,720 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.36ms. Allocated memory is still 107.0MB. Free memory was 60.1MB in the beginning and 60.1MB in the end (delta: 41.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 896.16ms. Allocated memory is still 107.0MB. Free memory was 73.3MB in the beginning and 72.1MB in the end (delta: 1.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.45ms. Allocated memory is still 107.0MB. Free memory was 72.1MB in the beginning and 69.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.39ms. Allocated memory is still 107.0MB. Free memory was 69.6MB in the beginning and 67.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 652.10ms. Allocated memory is still 107.0MB. Free memory was 67.5MB in the beginning and 49.0MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 51616.29ms. Allocated memory was 107.0MB in the beginning and 201.3MB in the end (delta: 94.4MB). Free memory was 48.2MB in the beginning and 83.8MB in the end (delta: -35.6MB). Peak memory consumption was 85.6MB. Max. memory is 16.1GB. * Witness Printer took 83.39ms. Allocated memory is still 201.3MB. Free memory was 83.8MB in the beginning and 79.6MB 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_653,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,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: 51.5s, OverallIterations: 14, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 32.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 918 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 907 mSDsluCounter, 3603 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 342 IncrementalHoareTripleChecker+Unchecked, 3091 mSDsCounter, 200 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4103 IncrementalHoareTripleChecker+Invalid, 4645 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 200 mSolverCounterUnsat, 512 mSDtfsCounter, 4103 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 522 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 297 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1799 ImplicationChecksByTransitivity, 36.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=3, InterpolantAutomatonStates: 187, 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, 14 MinimizatonAttempts, 130 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 163 PreInvPairs, 268 NumberOfFragments, 1045 HoareAnnotationTreeSize, 163 FomulaSimplifications, 95 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 17 FomulaSimplificationsInter, 2120 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 14.2s InterpolantComputationTime, 579 NumberOfCodeBlocks, 579 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 606 ConstructedInterpolants, 16 QuantifiedInterpolants, 3131 SizeOfPredicates, 340 NumberOfNonLiveVariables, 1977 ConjunctsInSsa, 814 ConjunctsInUnsatCore, 21 InterpolantComputations, 10 PerfectInterpolantSequences, 24/68 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 == 0)) && 0 == \result) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[\result][12]) && kobj == 0) && !(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] - InvariantResult [Line: 663]: Loop Invariant [2022-11-18 20:10:02,734 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] [2022-11-18 20:10:02,735 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] [2022-11-18 20:10:02,736 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] [2022-11-18 20:10:02,736 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] Derived loop invariant: ((((!(kobj == 0) || !(1 <= \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])) || ((((((((\old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= \result + 1 && v == kobj + 12) && kobj == kobj) && temp <= 2) && v == kobj) && (\exists v_ArrVal_653 : int :: \result <= v_ArrVal_653 && \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_653]] == unknown-#memory_int-unknown)) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) - InvariantResult [Line: 738]: Loop Invariant Derived loop invariant: (((((((0 == kobj && !(kobj == 0)) && unknown-#memory_int-unknown[\result][12] == 1) && 0 == \result) && unknown-#memory_int-unknown[kobj][12 + kobj] == 1) && !(kobj == 0)) && !(\result == 0)) && !(kobj == 0)) || (((0 == kobj && 0 == \result) && kobj == 0) && \result == 0) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 == kobj && !(kobj == 0) - InvariantResult [Line: 671]: Loop Invariant [2022-11-18 20:10:02,739 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] [2022-11-18 20:10:02,739 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] [2022-11-18 20:10:02,740 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] [2022-11-18 20:10:02,741 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] Derived loop invariant: (((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || !(kobj == 0)) || (((((((v == kobj + 12 && kobj == kobj) && (\exists v_ArrVal_653 : int :: \old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= v_ArrVal_653 + 1 && \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_653]] == unknown-#memory_int-unknown)) && temp <= 2) && 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: 715]: Loop Invariant Derived loop invariant: (((((((((((((((((0 == kobj && !(kobj == 0)) && 0 == \result) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[\result][12]) && kobj == 0) && !(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: 728]: Loop Invariant Derived loop invariant: (((0 == kobj && !(kobj == 0)) && unknown-#memory_int-unknown[kobj][12 + kobj] == 1) && !(kobj == 0)) && !(kobj == 0) - InvariantResult [Line: -1]: Loop Invariant [2022-11-18 20:10:02,744 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] [2022-11-18 20:10:02,744 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] [2022-11-18 20:10:02,745 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] [2022-11-18 20:10:02,746 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] Derived loop invariant: (((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || !(kobj == 0)) || (((((((v == kobj + 12 && kobj == kobj) && (\exists v_ArrVal_653 : int :: \old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= v_ArrVal_653 + 1 && \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_653]] == unknown-#memory_int-unknown)) && temp <= 2) && 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: 721]: Loop Invariant Derived loop invariant: (((0 == kobj && !(kobj == 0)) && unknown-#memory_int-unknown[kobj][12 + kobj] == 1) && !(kobj == 0)) && !(kobj == 0) - InvariantResult [Line: 688]: Loop Invariant [2022-11-18 20:10:02,747 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] [2022-11-18 20:10:02,748 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] [2022-11-18 20:10:02,749 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] [2022-11-18 20:10:02,749 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_653,QUANTIFIED] Derived loop invariant: (((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || !(kobj == 0)) || (((((((v == kobj + 12 && kobj == kobj) && (\exists v_ArrVal_653 : int :: \old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= v_ArrVal_653 + 1 && \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_653]] == unknown-#memory_int-unknown)) && temp <= 2) && 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)) RESULT: Ultimate proved your program to be correct! [2022-11-18 20:10:02,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_635a7d1d-d411-4fc7-be75-a85a58964950/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE