./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/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_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/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_900b71e6-b28c-4dda-b5db-dcaf051a2085/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 beb004be26a355c223f1a45515f5377c37b18fc46f09e77727f89b964ae9789d --- 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 19:45:05,753 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:45:05,755 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:45:05,786 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:45:05,788 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:45:05,793 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:45:05,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:45:05,800 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:45:05,803 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:45:05,811 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:45:05,813 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:45:05,815 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:45:05,818 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:45:05,826 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:45:05,827 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:45:05,829 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:45:05,830 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:45:05,831 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:45:05,833 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:45:05,838 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:45:05,845 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:45:05,847 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:45:05,848 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:45:05,849 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:45:05,853 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:45:05,861 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:45:05,861 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:45:05,862 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:45:05,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:45:05,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:45:05,866 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:45:05,867 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:45:05,869 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:45:05,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:45:05,873 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:45:05,874 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:45:05,875 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:45:05,875 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:45:05,875 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:45:05,876 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:45:05,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:45:05,879 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-18 19:45:05,928 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:45:05,928 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:45:05,929 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:45:05,930 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:45:05,931 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:45:05,931 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:45:05,932 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:45:05,932 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:45:05,932 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:45:05,933 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:45:05,934 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:45:05,934 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 19:45:05,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:45:05,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:45:05,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:45:05,935 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 19:45:05,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:45:05,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 19:45:05,936 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-18 19:45:05,936 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:45:05,937 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 19:45:05,937 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:45:05,937 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 19:45:05,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:45:05,938 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:45:05,938 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:45:05,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:45:05,939 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:45:05,939 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:45:05,939 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 19:45:05,940 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 19:45:05,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 19:45:05,940 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 19:45:05,941 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 19:45:05,941 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 19:45:05,941 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_900b71e6-b28c-4dda-b5db-dcaf051a2085/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_900b71e6-b28c-4dda-b5db-dcaf051a2085/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 -> beb004be26a355c223f1a45515f5377c37b18fc46f09e77727f89b964ae9789d [2022-11-18 19:45:06,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:45:06,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:45:06,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:45:06,350 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:45:06,351 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:45:06,353 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i [2022-11-18 19:45:06,443 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/data/9a3ca14a3/4f33794503504e118de643c3cf268ca8/FLAG23242ec84 [2022-11-18 19:45:07,193 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:45:07,194 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i [2022-11-18 19:45:07,208 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/data/9a3ca14a3/4f33794503504e118de643c3cf268ca8/FLAG23242ec84 [2022-11-18 19:45:07,410 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/data/9a3ca14a3/4f33794503504e118de643c3cf268ca8 [2022-11-18 19:45:07,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:45:07,415 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:45:07,418 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:45:07,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:45:07,422 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:45:07,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:45:07" (1/1) ... [2022-11-18 19:45:07,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@593d5dcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:45:07, skipping insertion in model container [2022-11-18 19:45:07,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:45:07" (1/1) ... [2022-11-18 19:45:07,434 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:45:07,504 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:45:07,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:45:07,935 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:45:07,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:45:08,021 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:45:08,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:45:08 WrapperNode [2022-11-18 19:45:08,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:45:08,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:45:08,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:45:08,023 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:45:08,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:45:08" (1/1) ... [2022-11-18 19:45:08,049 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:45:08" (1/1) ... [2022-11-18 19:45:08,080 INFO L138 Inliner]: procedures = 164, calls = 71, calls flagged for inlining = 23, calls inlined = 17, statements flattened = 121 [2022-11-18 19:45:08,081 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:45:08,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:45:08,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:45:08,082 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:45:08,093 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:45:08" (1/1) ... [2022-11-18 19:45:08,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:45:08" (1/1) ... [2022-11-18 19:45:08,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:45:08" (1/1) ... [2022-11-18 19:45:08,098 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:45:08" (1/1) ... [2022-11-18 19:45:08,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:45:08" (1/1) ... [2022-11-18 19:45:08,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:45:08" (1/1) ... [2022-11-18 19:45:08,114 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:45:08" (1/1) ... [2022-11-18 19:45:08,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:45:08" (1/1) ... [2022-11-18 19:45:08,119 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:45:08,120 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:45:08,120 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:45:08,121 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:45:08,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:45:08" (1/1) ... [2022-11-18 19:45:08,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:45:08,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:45:08,158 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:45:08,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:45:08,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 19:45:08,199 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-11-18 19:45:08,200 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-11-18 19:45:08,200 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-18 19:45:08,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-18 19:45:08,200 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2022-11-18 19:45:08,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2022-11-18 19:45:08,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 19:45:08,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 19:45:08,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:45:08,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 19:45:08,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 19:45:08,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 19:45:08,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-18 19:45:08,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:45:08,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:45:08,406 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:45:08,408 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:45:08,795 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:45:08,802 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:45:08,802 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 19:45:08,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:45:08 BoogieIcfgContainer [2022-11-18 19:45:08,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:45:08,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:45:08,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:45:08,815 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:45:08,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:45:07" (1/3) ... [2022-11-18 19:45:08,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15157580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:45:08, skipping insertion in model container [2022-11-18 19:45:08,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:45:08" (2/3) ... [2022-11-18 19:45:08,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15157580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:45:08, skipping insertion in model container [2022-11-18 19:45:08,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:45:08" (3/3) ... [2022-11-18 19:45:08,818 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2-2.i [2022-11-18 19:45:08,842 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:45:08,842 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-18 19:45:08,916 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:45:08,928 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;@4b102a5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:45:08,929 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-18 19:45:08,933 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 40 states have (on average 1.325) internal successors, (53), 45 states have internal predecessors, (53), 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 19:45:08,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 19:45:08,944 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:45:08,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:45:08,946 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 19:45:08,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:45:08,952 INFO L85 PathProgramCache]: Analyzing trace with hash -175410051, now seen corresponding path program 1 times [2022-11-18 19:45:08,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:45:08,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361261232] [2022-11-18 19:45:08,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:45:08,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:45:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:09,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:45:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:09,487 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 19:45:09,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:45:09,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361261232] [2022-11-18 19:45:09,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361261232] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:45:09,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:45:09,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:45:09,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704218269] [2022-11-18 19:45:09,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:45:09,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:45:09,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:45:09,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:45:09,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:45:09,536 INFO L87 Difference]: Start difference. First operand has 52 states, 40 states have (on average 1.325) internal successors, (53), 45 states have internal predecessors, (53), 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 19:45:09,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:45:09,756 INFO L93 Difference]: Finished difference Result 116 states and 139 transitions. [2022-11-18 19:45:09,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 19:45:09,760 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 19:45:09,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:45:09,770 INFO L225 Difference]: With dead ends: 116 [2022-11-18 19:45:09,771 INFO L226 Difference]: Without dead ends: 76 [2022-11-18 19:45:09,775 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 19:45:09,782 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 42 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 249 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 19:45:09,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 249 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 19:45:09,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-18 19:45:09,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 52. [2022-11-18 19:45:09,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.325) internal successors, (53), 45 states have internal predecessors, (53), 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 19:45:09,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2022-11-18 19:45:09,849 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 12 [2022-11-18 19:45:09,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:45:09,850 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2022-11-18 19:45:09,850 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 19:45:09,851 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-11-18 19:45:09,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 19:45:09,853 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:45:09,853 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:45:09,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 19:45:09,854 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 19:45:09,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:45:09,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1567400284, now seen corresponding path program 1 times [2022-11-18 19:45:09,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:45:09,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813220323] [2022-11-18 19:45:09,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:45:09,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:45:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:10,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:45:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:10,034 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 19:45:10,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:45:10,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813220323] [2022-11-18 19:45:10,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813220323] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:45:10,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:45:10,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:45:10,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320144627] [2022-11-18 19:45:10,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:45:10,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:45:10,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:45:10,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:45:10,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:45:10,040 INFO L87 Difference]: Start difference. First operand 52 states and 61 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 19:45:10,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:45:10,196 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2022-11-18 19:45:10,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 19:45:10,197 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 19:45:10,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:45:10,199 INFO L225 Difference]: With dead ends: 92 [2022-11-18 19:45:10,199 INFO L226 Difference]: Without dead ends: 66 [2022-11-18 19:45:10,200 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 19:45:10,202 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 26 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 139 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 19:45:10,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 139 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:45:10,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-18 19:45:10,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2022-11-18 19:45:10,212 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 19:45:10,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-11-18 19:45:10,214 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 12 [2022-11-18 19:45:10,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:45:10,214 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-11-18 19:45:10,215 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 19:45:10,215 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-11-18 19:45:10,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 19:45:10,216 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:45:10,216 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:45:10,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 19:45:10,217 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 19:45:10,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:45:10,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1120397654, now seen corresponding path program 1 times [2022-11-18 19:45:10,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:45:10,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104831865] [2022-11-18 19:45:10,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:45:10,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:45:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:10,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:45:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:10,380 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 19:45:10,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:45:10,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104831865] [2022-11-18 19:45:10,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104831865] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:45:10,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:45:10,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:45:10,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048244612] [2022-11-18 19:45:10,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:45:10,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:45:10,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:45:10,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:45:10,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:45:10,384 INFO L87 Difference]: Start difference. First operand 54 states and 63 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 19:45:10,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:45:10,568 INFO L93 Difference]: Finished difference Result 107 states and 127 transitions. [2022-11-18 19:45:10,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:45:10,569 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 19:45:10,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:45:10,571 INFO L225 Difference]: With dead ends: 107 [2022-11-18 19:45:10,571 INFO L226 Difference]: Without dead ends: 78 [2022-11-18 19:45:10,572 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 19:45:10,573 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 53 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 258 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 19:45:10,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 258 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 19:45:10,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-18 19:45:10,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 57. [2022-11-18 19:45:10,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 50 states have internal predecessors, (59), 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 19:45:10,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2022-11-18 19:45:10,584 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 16 [2022-11-18 19:45:10,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:45:10,584 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2022-11-18 19:45:10,585 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 19:45:10,585 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-11-18 19:45:10,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 19:45:10,586 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:45:10,586 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:45:10,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 19:45:10,587 INFO L420 AbstractCegarLoop]: === Iteration 4 === 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 19:45:10,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:45:10,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1500438086, now seen corresponding path program 1 times [2022-11-18 19:45:10,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:45:10,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962098920] [2022-11-18 19:45:10,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:45:10,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:45:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:10,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:45:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:10,847 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 19:45:10,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:45:10,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962098920] [2022-11-18 19:45:10,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962098920] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:45:10,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:45:10,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:45:10,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408605345] [2022-11-18 19:45:10,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:45:10,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:45:10,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:45:10,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:45:10,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:45:10,851 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 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 19:45:11,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:45:11,046 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2022-11-18 19:45:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:45:11,046 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), 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 17 [2022-11-18 19:45:11,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:45:11,048 INFO L225 Difference]: With dead ends: 88 [2022-11-18 19:45:11,048 INFO L226 Difference]: Without dead ends: 61 [2022-11-18 19:45:11,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:45:11,050 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 31 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:45:11,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 216 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:45:11,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-18 19:45:11,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2022-11-18 19:45:11,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.302325581395349) internal successors, (56), 48 states have internal predecessors, (56), 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 19:45:11,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2022-11-18 19:45:11,058 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 17 [2022-11-18 19:45:11,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:45:11,058 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2022-11-18 19:45:11,059 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), 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 19:45:11,059 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2022-11-18 19:45:11,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 19:45:11,060 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:45:11,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:45:11,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 19:45:11,060 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-18 19:45:11,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:45:11,061 INFO L85 PathProgramCache]: Analyzing trace with hash -991314935, now seen corresponding path program 1 times [2022-11-18 19:45:11,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:45:11,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502376261] [2022-11-18 19:45:11,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:45:11,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:45:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:11,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:45:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:11,176 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 19:45:11,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:45:11,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502376261] [2022-11-18 19:45:11,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502376261] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:45:11,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:45:11,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:45:11,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335294640] [2022-11-18 19:45:11,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:45:11,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:45:11,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:45:11,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:45:11,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:45:11,180 INFO L87 Difference]: Start difference. First operand 55 states and 64 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 19:45:11,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:45:11,301 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2022-11-18 19:45:11,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 19:45:11,302 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 19:45:11,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:45:11,303 INFO L225 Difference]: With dead ends: 95 [2022-11-18 19:45:11,303 INFO L226 Difference]: Without dead ends: 52 [2022-11-18 19:45:11,304 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 19:45:11,305 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 17 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:45:11,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 172 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:45:11,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-18 19:45:11,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-11-18 19:45:11,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 37 states have (on average 1.2702702702702702) 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 19:45:11,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2022-11-18 19:45:11,311 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 16 [2022-11-18 19:45:11,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:45:11,312 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2022-11-18 19:45:11,312 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 19:45:11,312 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-11-18 19:45:11,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-18 19:45:11,313 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:45:11,313 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 19:45:11,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 19:45:11,314 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 19:45:11,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:45:11,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1476374573, now seen corresponding path program 1 times [2022-11-18 19:45:11,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:45:11,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928489315] [2022-11-18 19:45:11,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:45:11,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:45:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:11,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:45:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:11,496 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 19:45:11,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:45:11,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928489315] [2022-11-18 19:45:11,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928489315] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:45:11,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:45:11,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 19:45:11,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78678441] [2022-11-18 19:45:11,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:45:11,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 19:45:11,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:45:11,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 19:45:11,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-18 19:45:11,502 INFO L87 Difference]: Start difference. First operand 48 states and 54 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 19:45:11,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:45:11,706 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2022-11-18 19:45:11,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:45:11,707 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 19:45:11,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:45:11,708 INFO L225 Difference]: With dead ends: 82 [2022-11-18 19:45:11,708 INFO L226 Difference]: Without dead ends: 52 [2022-11-18 19:45:11,709 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 19:45:11,710 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 64 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 143 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.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:45:11,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 143 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 19:45:11,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-18 19:45:11,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-11-18 19:45:11,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 41 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 19:45:11,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-11-18 19:45:11,717 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 18 [2022-11-18 19:45:11,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:45:11,718 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-11-18 19:45:11,718 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 19:45:11,718 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-11-18 19:45:11,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-18 19:45:11,719 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:45:11,719 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 19:45:11,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 19:45:11,720 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 19:45:11,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:45:11,720 INFO L85 PathProgramCache]: Analyzing trace with hash -814801186, now seen corresponding path program 1 times [2022-11-18 19:45:11,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:45:11,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287868522] [2022-11-18 19:45:11,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:45:11,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:45:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:11,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:45:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:11,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-18 19:45:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:11,888 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 19:45:11,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:45:11,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287868522] [2022-11-18 19:45:11,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287868522] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:45:11,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:45:11,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 19:45:11,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594448842] [2022-11-18 19:45:11,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:45:11,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:45:11,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:45:11,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:45:11,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:45:11,892 INFO L87 Difference]: Start difference. First operand 48 states and 53 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 19:45:12,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:45:12,013 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2022-11-18 19:45:12,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 19:45:12,014 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 19:45:12,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:45:12,015 INFO L225 Difference]: With dead ends: 93 [2022-11-18 19:45:12,015 INFO L226 Difference]: Without dead ends: 55 [2022-11-18 19:45:12,018 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 19:45:12,019 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 26 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 107 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 19:45:12,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 107 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:45:12,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-18 19:45:12,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2022-11-18 19:45:12,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 38 states have (on average 1.236842105263158) 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 19:45:12,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2022-11-18 19:45:12,036 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 23 [2022-11-18 19:45:12,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:45:12,036 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2022-11-18 19:45:12,037 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 19:45:12,037 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-11-18 19:45:12,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-18 19:45:12,040 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:45:12,040 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 19:45:12,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 19:45:12,041 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 19:45:12,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:45:12,042 INFO L85 PathProgramCache]: Analyzing trace with hash 595648175, now seen corresponding path program 1 times [2022-11-18 19:45:12,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:45:12,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917006992] [2022-11-18 19:45:12,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:45:12,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:45:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:12,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:45:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:12,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 19:45:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:12,244 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 19:45:12,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:45:12,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917006992] [2022-11-18 19:45:12,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917006992] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:45:12,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643145279] [2022-11-18 19:45:12,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:45:12,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:45:12,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:45:12,249 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:45:12,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 19:45:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:12,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 83 conjunts are in the unsatisfiable core [2022-11-18 19:45:12,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:45:12,633 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 19:45:12,722 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 19:45:12,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:12,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:12,771 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 19:45:12,883 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 19:45:12,908 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 19:45:12,908 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:45:12,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643145279] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:45:12,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 19:45:12,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 18 [2022-11-18 19:45:12,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418452017] [2022-11-18 19:45:12,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:45:12,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-18 19:45:12,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:45:12,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-18 19:45:12,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=234, Unknown=1, NotChecked=30, Total=306 [2022-11-18 19:45:12,911 INFO L87 Difference]: Start difference. First operand 49 states and 54 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 19:45:13,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:45:13,302 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2022-11-18 19:45:13,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 19:45:13,303 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 19:45:13,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:45:13,304 INFO L225 Difference]: With dead ends: 55 [2022-11-18 19:45:13,304 INFO L226 Difference]: Without dead ends: 54 [2022-11-18 19:45:13,304 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 19:45:13,305 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 46 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:45:13,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 282 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 213 Invalid, 0 Unknown, 68 Unchecked, 0.2s Time] [2022-11-18 19:45:13,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-18 19:45:13,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2022-11-18 19:45:13,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 41 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 19:45:13,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-11-18 19:45:13,316 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 24 [2022-11-18 19:45:13,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:45:13,316 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-11-18 19:45:13,316 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 19:45:13,317 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-11-18 19:45:13,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-18 19:45:13,317 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:45:13,318 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 19:45:13,326 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-18 19:45:13,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:45:13,525 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 19:45:13,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:45:13,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1285224321, now seen corresponding path program 1 times [2022-11-18 19:45:13,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:45:13,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580191785] [2022-11-18 19:45:13,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:45:13,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:45:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:13,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:45:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:13,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 19:45:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:13,837 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 19:45:13,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:45:13,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580191785] [2022-11-18 19:45:13,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580191785] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:45:13,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328719632] [2022-11-18 19:45:13,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:45:13,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:45:13,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:45:13,846 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:45:13,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 19:45:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:14,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 83 conjunts are in the unsatisfiable core [2022-11-18 19:45:14,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:45:14,154 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 19:45:14,235 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 19:45:14,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:14,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:14,272 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 19:45:14,384 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 19:45:14,414 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 19:45:14,414 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:45:14,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328719632] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:45:14,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 19:45:14,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 18 [2022-11-18 19:45:14,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811170662] [2022-11-18 19:45:14,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:45:14,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-18 19:45:14,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:45:14,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-18 19:45:14,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=234, Unknown=1, NotChecked=30, Total=306 [2022-11-18 19:45:14,418 INFO L87 Difference]: Start difference. First operand 48 states and 53 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 19:45:14,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:45:14,848 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2022-11-18 19:45:14,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 19:45:14,848 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 19:45:14,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:45:14,849 INFO L225 Difference]: With dead ends: 56 [2022-11-18 19:45:14,850 INFO L226 Difference]: Without dead ends: 55 [2022-11-18 19:45:14,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=471, Unknown=1, NotChecked=44, Total=600 [2022-11-18 19:45:14,851 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 46 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:45:14,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 285 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 216 Invalid, 0 Unknown, 68 Unchecked, 0.2s Time] [2022-11-18 19:45:14,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-18 19:45:14,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2022-11-18 19:45:14,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 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 19:45:14,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-11-18 19:45:14,862 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 25 [2022-11-18 19:45:14,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:45:14,862 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-11-18 19:45:14,863 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 19:45:14,863 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-11-18 19:45:14,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 19:45:14,864 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:45:14,864 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] [2022-11-18 19:45:14,877 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 19:45:15,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-18 19:45:15,079 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 19:45:15,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:45:15,079 INFO L85 PathProgramCache]: Analyzing trace with hash 842874951, now seen corresponding path program 1 times [2022-11-18 19:45:15,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:45:15,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298657151] [2022-11-18 19:45:15,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:45:15,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:45:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:15,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:45:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:15,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 19:45:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:15,260 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 19:45:15,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:45:15,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298657151] [2022-11-18 19:45:15,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298657151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:45:15,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:45:15,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 19:45:15,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174428399] [2022-11-18 19:45:15,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:45:15,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 19:45:15,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:45:15,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 19:45:15,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-18 19:45:15,263 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 6 states have internal predecessors, (24), 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 19:45:15,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:45:15,588 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2022-11-18 19:45:15,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 19:45:15,589 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 6 states have internal predecessors, (24), 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 29 [2022-11-18 19:45:15,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:45:15,590 INFO L225 Difference]: With dead ends: 73 [2022-11-18 19:45:15,590 INFO L226 Difference]: Without dead ends: 53 [2022-11-18 19:45:15,590 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 19:45:15,591 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 50 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 137 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.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:45:15,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 137 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 19:45:15,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-18 19:45:15,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2022-11-18 19:45:15,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 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 19:45:15,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-11-18 19:45:15,599 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 29 [2022-11-18 19:45:15,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:45:15,599 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-11-18 19:45:15,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 6 states have internal predecessors, (24), 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 19:45:15,599 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-11-18 19:45:15,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-18 19:45:15,600 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:45:15,600 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] [2022-11-18 19:45:15,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 19:45:15,601 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 19:45:15,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:45:15,601 INFO L85 PathProgramCache]: Analyzing trace with hash 221950145, now seen corresponding path program 1 times [2022-11-18 19:45:15,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:45:15,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194777744] [2022-11-18 19:45:15,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:45:15,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:45:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:15,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:45:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:15,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-18 19:45:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:15,859 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 19:45:15,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:45:15,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194777744] [2022-11-18 19:45:15,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194777744] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:45:15,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474357690] [2022-11-18 19:45:15,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:45:15,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:45:15,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:45:15,861 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:45:15,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 19:45:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:16,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 134 conjunts are in the unsatisfiable core [2022-11-18 19:45:16,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:45:16,256 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 19:45:16,339 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 19:45:16,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:16,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:16,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-11-18 19:45:16,596 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:45:16,600 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:45:16,600 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 19:45:16,796 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 19:45:16,829 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 19:45:16,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:45:19,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474357690] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:45:19,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:45:19,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 19] total 24 [2022-11-18 19:45:19,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112791870] [2022-11-18 19:45:19,573 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:45:19,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-18 19:45:19,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:45:19,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-18 19:45:19,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=904, Unknown=2, NotChecked=60, Total=1056 [2022-11-18 19:45:19,575 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 24 states, 24 states have (on average 2.25) internal successors, (54), 19 states have internal predecessors, (54), 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 19:45:28,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:45:28,884 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-11-18 19:45:28,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-18 19:45:28,885 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.25) internal successors, (54), 19 states have internal predecessors, (54), 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 33 [2022-11-18 19:45:28,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:45:28,886 INFO L225 Difference]: With dead ends: 89 [2022-11-18 19:45:28,886 INFO L226 Difference]: Without dead ends: 53 [2022-11-18 19:45:28,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=224, Invalid=2028, Unknown=8, NotChecked=92, Total=2352 [2022-11-18 19:45:28,889 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 114 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:45:28,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 226 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 533 Invalid, 0 Unknown, 51 Unchecked, 0.6s Time] [2022-11-18 19:45:28,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-18 19:45:28,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2022-11-18 19:45:28,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 40 states have internal predecessors, (44), 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 19:45:28,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-11-18 19:45:28,900 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 33 [2022-11-18 19:45:28,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:45:28,900 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-11-18 19:45:28,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.25) internal successors, (54), 19 states have internal predecessors, (54), 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 19:45:28,901 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-11-18 19:45:28,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-18 19:45:28,901 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:45:28,902 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] [2022-11-18 19:45:28,910 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 19:45:29,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:45:29,109 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 19:45:29,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:45:29,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1814803623, now seen corresponding path program 1 times [2022-11-18 19:45:29,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:45:29,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642657871] [2022-11-18 19:45:29,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:45:29,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:45:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:29,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:45:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:29,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-18 19:45:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:29,446 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 19:45:29,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:45:29,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642657871] [2022-11-18 19:45:29,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642657871] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:45:29,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671959150] [2022-11-18 19:45:29,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:45:29,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:45:29,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:45:29,449 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:45:29,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 19:45:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:29,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 141 conjunts are in the unsatisfiable core [2022-11-18 19:45:29,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:45:29,823 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 19:45:29,904 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 19:45:29,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:29,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:29,932 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 19:45:30,142 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:45:30,145 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:45:30,146 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 19:45:30,299 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 19:45:30,333 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 19:45:30,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:45:32,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671959150] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:45:32,929 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:45:32,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 19] total 25 [2022-11-18 19:45:32,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773856835] [2022-11-18 19:45:32,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:45:32,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-18 19:45:32,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:45:32,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-18 19:45:32,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=963, Unknown=2, NotChecked=62, Total=1122 [2022-11-18 19:45:32,932 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 25 states, 25 states have (on average 2.32) internal successors, (58), 20 states have internal predecessors, (58), 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 19:45:42,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:45:42,126 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2022-11-18 19:45:42,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-18 19:45:42,127 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.32) internal successors, (58), 20 states have internal predecessors, (58), 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 35 [2022-11-18 19:45:42,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:45:42,128 INFO L225 Difference]: With dead ends: 96 [2022-11-18 19:45:42,128 INFO L226 Difference]: Without dead ends: 56 [2022-11-18 19:45:42,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=210, Invalid=1857, Unknown=7, NotChecked=88, Total=2162 [2022-11-18 19:45:42,130 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 93 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:45:42,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 211 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 557 Invalid, 0 Unknown, 58 Unchecked, 0.6s Time] [2022-11-18 19:45:42,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-18 19:45:42,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2022-11-18 19:45:42,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 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 19:45:42,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-11-18 19:45:42,141 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 35 [2022-11-18 19:45:42,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:45:42,142 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-11-18 19:45:42,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.32) internal successors, (58), 20 states have internal predecessors, (58), 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 19:45:42,142 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-11-18 19:45:42,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-18 19:45:42,143 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:45:42,144 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-11-18 19:45:42,155 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-18 19:45:42,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-18 19:45:42,351 INFO L420 AbstractCegarLoop]: === Iteration 13 === 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 19:45:42,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:45:42,352 INFO L85 PathProgramCache]: Analyzing trace with hash -874011441, now seen corresponding path program 1 times [2022-11-18 19:45:42,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:45:42,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228386250] [2022-11-18 19:45:42,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:45:42,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:45:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:42,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:45:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:42,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 19:45:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:42,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-18 19:45:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:42,802 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:45:42,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:45:42,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228386250] [2022-11-18 19:45:42,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228386250] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:45:42,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433063883] [2022-11-18 19:45:42,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:45:42,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:45:42,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:45:42,804 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:45:42,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 19:45:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:45:43,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 182 conjunts are in the unsatisfiable core [2022-11-18 19:45:43,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:45:43,202 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 19:45:43,288 WARN L859 $PredicateComparison]: unable to prove that (exists ((LDV_INIT_LIST_HEAD_~list.offset Int) (v_ArrVal_518 Int) (v_ArrVal_516 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) LDV_INIT_LIST_HEAD_~list.offset v_ArrVal_518) (+ LDV_INIT_LIST_HEAD_~list.offset 4) v_ArrVal_516))) (<= LDV_INIT_LIST_HEAD_~list.offset |c_LDV_INIT_LIST_HEAD_#in~list.offset|))) is different from true [2022-11-18 19:45:43,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:43,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:45:43,324 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 19:45:43,568 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:45:43,573 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:45:43,573 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 19:45:43,831 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_521 Int)) (let ((.cse0 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|)) (.cse1 (+ |c_ldv_kobject_put_#in~kobj#1.offset| 12))) (and (<= (select .cse0 .cse1) (+ v_ArrVal_521 1)) (= (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (store .cse0 .cse1 v_ArrVal_521)) |c_#memory_int|)))) is different from true [2022-11-18 19:45:43,890 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 19:45:44,087 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 19:45:44,136 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 19:45:44,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:45:47,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433063883] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:45:47,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 19:45:47,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 23] total 31 [2022-11-18 19:45:47,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221435401] [2022-11-18 19:45:47,783 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 19:45:47,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-18 19:45:47,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:45:47,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-18 19:45:47,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1655, Unknown=3, NotChecked=166, Total=1980 [2022-11-18 19:45:47,786 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 31 states, 30 states have (on average 2.6) internal successors, (78), 24 states have internal predecessors, (78), 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 19:46:01,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:46:01,415 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2022-11-18 19:46:01,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-18 19:46:01,415 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.6) internal successors, (78), 24 states have internal predecessors, (78), 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 47 [2022-11-18 19:46:01,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:46:01,416 INFO L225 Difference]: With dead ends: 101 [2022-11-18 19:46:01,417 INFO L226 Difference]: Without dead ends: 53 [2022-11-18 19:46:01,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=344, Invalid=3194, Unknown=10, NotChecked=234, Total=3782 [2022-11-18 19:46:01,419 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 81 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 187 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:46:01,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 285 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 470 Invalid, 0 Unknown, 187 Unchecked, 0.6s Time] [2022-11-18 19:46:01,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-18 19:46:01,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-18 19:46:01,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 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 19:46:01,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2022-11-18 19:46:01,433 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 47 [2022-11-18 19:46:01,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:46:01,433 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2022-11-18 19:46:01,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.6) internal successors, (78), 24 states have internal predecessors, (78), 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 19:46:01,434 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-11-18 19:46:01,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-18 19:46:01,435 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:46:01,435 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, 1, 1] [2022-11-18 19:46:01,451 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-18 19:46:01,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-18 19:46:01,648 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 19:46:01,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:46:01,648 INFO L85 PathProgramCache]: Analyzing trace with hash -494783673, now seen corresponding path program 1 times [2022-11-18 19:46:01,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:46:01,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797550787] [2022-11-18 19:46:01,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:46:01,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:46:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:46:02,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 19:46:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:46:02,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 19:46:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:46:02,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-18 19:46:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:46:02,153 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 19:46:02,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:46:02,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797550787] [2022-11-18 19:46:02,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797550787] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:46:02,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614300477] [2022-11-18 19:46:02,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:46:02,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:46:02,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:46:02,159 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:46:02,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 19:46:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:46:02,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 97 conjunts are in the unsatisfiable core [2022-11-18 19:46:02,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:46:02,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 19:46:02,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-18 19:46:02,758 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 19:46:02,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:46:03,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-11-18 19:46:03,371 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 19:46:03,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614300477] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:46:03,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:46:03,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 25 [2022-11-18 19:46:03,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565497912] [2022-11-18 19:46:03,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:46:03,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-18 19:46:03,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:46:03,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-18 19:46:03,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2022-11-18 19:46:03,374 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 25 states, 23 states have (on average 4.217391304347826) internal successors, (97), 20 states have internal predecessors, (97), 4 states have call successors, (9), 7 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-18 19:46:04,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:46:04,638 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2022-11-18 19:46:04,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-18 19:46:04,639 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 4.217391304347826) internal successors, (97), 20 states have internal predecessors, (97), 4 states have call successors, (9), 7 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 52 [2022-11-18 19:46:04,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:46:04,639 INFO L225 Difference]: With dead ends: 102 [2022-11-18 19:46:04,639 INFO L226 Difference]: Without dead ends: 0 [2022-11-18 19:46:04,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=198, Invalid=1134, Unknown=0, NotChecked=0, Total=1332 [2022-11-18 19:46:04,641 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 89 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:46:04,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 588 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 19:46:04,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-18 19:46:04,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-18 19:46:04,643 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 19:46:04,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-18 19:46:04,643 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2022-11-18 19:46:04,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:46:04,643 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-18 19:46:04,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 4.217391304347826) internal successors, (97), 20 states have internal predecessors, (97), 4 states have call successors, (9), 7 states have call predecessors, (9), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-18 19:46:04,644 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-18 19:46:04,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-18 19:46:04,647 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-11-18 19:46:04,648 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-11-18 19:46:04,648 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-11-18 19:46:04,649 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-11-18 19:46:04,661 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-18 19:46:04,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-18 19:46:04,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-18 19:46:06,693 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 19:46:06,693 INFO L899 garLoopResultBuilder]: For program point L526(lines 526 530) no Hoare annotation was computed. [2022-11-18 19:46:06,694 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 525 531) no Hoare annotation was computed. [2022-11-18 19:46:06,694 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 525 531) no Hoare annotation was computed. [2022-11-18 19:46:06,694 INFO L899 garLoopResultBuilder]: For program point L762(lines 757 763) no Hoare annotation was computed. [2022-11-18 19:46:06,694 INFO L899 garLoopResultBuilder]: For program point L659(line 659) no Hoare annotation was computed. [2022-11-18 19:46:06,694 INFO L899 garLoopResultBuilder]: For program point L659-1(line 659) no Hoare annotation was computed. [2022-11-18 19:46:06,694 INFO L899 garLoopResultBuilder]: For program point L717(lines 717 718) no Hoare annotation was computed. [2022-11-18 19:46:06,694 INFO L899 garLoopResultBuilder]: For program point L684(lines 684 687) no Hoare annotation was computed. [2022-11-18 19:46:06,694 INFO L899 garLoopResultBuilder]: For program point L717-2(lines 717 718) no Hoare annotation was computed. [2022-11-18 19:46:06,695 INFO L895 garLoopResultBuilder]: At program point L746(lines 738 747) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|))) (or (and .cse0 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0)) (let ((.cse1 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|))) (.cse2 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_#res#1.base|) 12))) (and (<= .cse1 1) (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) .cse0 (<= .cse2 1) (<= 1 .cse1) (<= 1 .cse2) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)))))) [2022-11-18 19:46:06,695 INFO L899 garLoopResultBuilder]: For program point L680(lines 680 683) no Hoare annotation was computed. [2022-11-18 19:46:06,695 INFO L899 garLoopResultBuilder]: For program point L742(lines 742 743) no Hoare annotation was computed. [2022-11-18 19:46:06,695 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-18 19:46:06,696 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 659) no Hoare annotation was computed. [2022-11-18 19:46:06,696 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-18 19:46:06,696 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 19:46:06,696 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-18 19:46:06,696 INFO L899 garLoopResultBuilder]: For program point L-1-3(line -1) no Hoare annotation was computed. [2022-11-18 19:46:06,696 INFO L899 garLoopResultBuilder]: For program point L730(lines 730 732) no Hoare annotation was computed. [2022-11-18 19:46:06,696 INFO L895 garLoopResultBuilder]: At program point L726(line 726) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset|)))) (and (<= .cse0 1) (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.offset| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base|) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (<= 1 .cse0))) [2022-11-18 19:46:06,697 INFO L895 garLoopResultBuilder]: At program point L726-1(lines 721 727) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)))) (and (<= .cse0 1) (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) (<= 1 .cse0) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)))) [2022-11-18 19:46:06,697 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 659) no Hoare annotation was computed. [2022-11-18 19:46:06,697 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-18 19:46:06,698 INFO L899 garLoopResultBuilder]: For program point L764(lines 764 766) no Hoare annotation was computed. [2022-11-18 19:46:06,698 INFO L895 garLoopResultBuilder]: At program point L731(lines 728 737) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base|) (+ 12 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|)))) (and (<= .cse0 1) (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) (<= 1 .cse0) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)))) [2022-11-18 19:46:06,698 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 19:46:06,698 INFO L899 garLoopResultBuilder]: For program point L723(lines 723 724) no Hoare annotation was computed. [2022-11-18 19:46:06,699 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 19:46:06,699 INFO L895 garLoopResultBuilder]: At program point L761(line 761) 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 19:46:06,699 INFO L895 garLoopResultBuilder]: At program point L761-1(line 761) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_entry_point_~kobj~2#1.offset| 0)) (.cse0 (= |ULTIMATE.start_ldv_kobject_create_#res#1.base| 0))) (or (let ((.cse1 (select |#memory_int| |ULTIMATE.start_entry_point_~kobj~2#1.base|))) (and (= 0 |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.offset|) (not (= |ULTIMATE.start_ldv_kobject_create_~kobj~1#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_get_~kobj#1.base| 0)) (not (= |ULTIMATE.start_ldv_kobject_init_internal_~kobj#1.base| 0)) (not .cse0) (<= (select .cse1 12) 2) .cse2 (not (= |ULTIMATE.start_ldv_kobject_init_~kobj#1.base| 0)) (<= 0 (select .cse1 (+ |ULTIMATE.start_entry_point_~kobj~2#1.offset| 12))))) (and (= 0 |ULTIMATE.start_ldv_kobject_create_#res#1.offset|) (= |ULTIMATE.start_entry_point_~kobj~2#1.base| 0) .cse2 .cse0))) [2022-11-18 19:46:06,700 INFO L902 garLoopResultBuilder]: At program point L741(line 741) the Hoare annotation is: true [2022-11-18 19:46:06,700 INFO L899 garLoopResultBuilder]: For program point L741-1(line 741) no Hoare annotation was computed. [2022-11-18 19:46:06,700 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 19:46:06,700 INFO L899 garLoopResultBuilder]: For program point LDV_INIT_LIST_HEADFINAL(lines 538 542) no Hoare annotation was computed. [2022-11-18 19:46:06,700 INFO L899 garLoopResultBuilder]: For program point LDV_INIT_LIST_HEADEXIT(lines 538 542) no Hoare annotation was computed. [2022-11-18 19:46:06,701 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|))) (let ((.cse3 (+ |ldv_kobject_put_#in~kobj#1.offset| 12)) (.cse2 (select .cse4 12))) (let ((.cse1 (not (<= .cse2 2))) (.cse0 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (.cse5 (select .cse4 .cse3))) (and (or .cse0 (not (= |ldv_kobject_put_#in~kobj#1.base| 0))) (or .cse1 .cse0 (not (<= 2 .cse2)) (and (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| .cse3) (= |ldv_kobject_put_~kobj#1.base| |ldv_kobject_put_#in~kobj#1.base|) (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 2) (<= |ldv_kobject_put_ldv_atomic_sub_return_#res#1| (select (select |#memory_int| |ldv_kobject_put_#in~kobj#1.base|) .cse3)) (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| |ldv_kobject_put_#in~kobj#1.base|) (= |ldv_kobject_put_~kobj#1.offset| 0) (exists ((v_ArrVal_521 Int)) (and (= |#memory_int| (store |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base| (store .cse4 .cse3 v_ArrVal_521))) (<= .cse5 (+ v_ArrVal_521 1)))) (<= (select (select |#memory_int| |ldv_kobject_put_~kobj#1.base|) 12) 2) (<= 1 |ldv_kobject_put_ldv_atomic_sub_return_~i#1|))) (or .cse1 .cse0 (not (<= 0 .cse5)) (= |old(#valid)| |#valid|)))))) [2022-11-18 19:46:06,702 INFO L899 garLoopResultBuilder]: For program point L667(line 667) no Hoare annotation was computed. [2022-11-18 19:46:06,702 INFO L899 garLoopResultBuilder]: For program point L667-1(line 667) no Hoare annotation was computed. [2022-11-18 19:46:06,702 INFO L895 garLoopResultBuilder]: At program point L690(lines 688 691) the Hoare annotation is: (let ((.cse6 (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (let ((.cse10 (not .cse6))) (and (let ((.cse2 (select |#memory_int| |ldv_kobject_put_~kobj#1.base|)) (.cse4 (select |#memory_int| |ldv_kobject_put_#in~kobj#1.base|)) (.cse11 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|))) (let ((.cse0 (select .cse11 12)) (.cse3 (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 2)) (.cse5 (= |ldv_kobject_put_~kobj#1.offset| 0)) (.cse1 (+ |ldv_kobject_put_#in~kobj#1.offset| 12)) (.cse7 (<= (select .cse4 12) 2)) (.cse8 (<= (select .cse2 12) 2)) (.cse9 (<= 1 |ldv_kobject_put_ldv_atomic_sub_return_~i#1|))) (or (not (<= .cse0 2)) (and (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| .cse1) (= |ldv_kobject_put_~kobj#1.base| |ldv_kobject_put_#in~kobj#1.base|) (<= 0 (select .cse2 (+ 12 |ldv_kobject_put_~kobj#1.offset|))) .cse3 (<= |ldv_kobject_put_ldv_atomic_sub_return_#res#1| (select .cse4 .cse1)) (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| |ldv_kobject_put_#in~kobj#1.base|) .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 (not (<= 2 .cse0)) (and .cse3 .cse5 (exists ((v_ArrVal_521 Int)) (and (= |#memory_int| (store |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base| (store .cse11 .cse1 v_ArrVal_521))) (<= (select .cse11 .cse1) (+ v_ArrVal_521 1)))) .cse6 .cse7 .cse8 .cse9)))) (or .cse10 (not (= |ldv_kobject_put_#in~kobj#1.base| 0)))))) [2022-11-18 19:46:06,703 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-11-18 19:46:06,703 INFO L895 garLoopResultBuilder]: At program point ldv_kobject_putENTRY(lines 709 714) the Hoare annotation is: (let ((.cse1 (not (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (.cse2 (= |old(#valid)| |#valid|))) (and (let ((.cse0 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|))) (or (not (<= (select .cse0 12) 2)) .cse1 (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) .cse2) (not (<= 0 (select .cse0 (+ |ldv_kobject_put_#in~kobj#1.offset| 12)))))) (or .cse1 (not (= |ldv_kobject_put_#in~kobj#1.base| 0)) .cse2))) [2022-11-18 19:46:06,703 INFO L899 garLoopResultBuilder]: For program point L711(lines 711 713) no Hoare annotation was computed. [2022-11-18 19:46:06,704 INFO L895 garLoopResultBuilder]: At program point L678(lines 671 679) the Hoare annotation is: (let ((.cse6 (= |ldv_kobject_put_#in~kobj#1.offset| 0))) (let ((.cse10 (not .cse6))) (and (let ((.cse2 (select |#memory_int| |ldv_kobject_put_~kobj#1.base|)) (.cse4 (select |#memory_int| |ldv_kobject_put_#in~kobj#1.base|)) (.cse11 (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|))) (let ((.cse0 (select .cse11 12)) (.cse3 (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 2)) (.cse5 (= |ldv_kobject_put_~kobj#1.offset| 0)) (.cse1 (+ |ldv_kobject_put_#in~kobj#1.offset| 12)) (.cse7 (<= (select .cse4 12) 2)) (.cse8 (<= (select .cse2 12) 2)) (.cse9 (<= 1 |ldv_kobject_put_ldv_atomic_sub_return_~i#1|))) (or (not (<= .cse0 2)) (and (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| .cse1) (= |ldv_kobject_put_~kobj#1.base| |ldv_kobject_put_#in~kobj#1.base|) (<= 0 (select .cse2 (+ 12 |ldv_kobject_put_~kobj#1.offset|))) .cse3 (<= |ldv_kobject_put_ldv_atomic_sub_return_#res#1| (select .cse4 .cse1)) (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| |ldv_kobject_put_#in~kobj#1.base|) .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 (not (<= 2 .cse0)) (and .cse3 .cse5 (exists ((v_ArrVal_521 Int)) (and (= |#memory_int| (store |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base| (store .cse11 .cse1 v_ArrVal_521))) (<= (select .cse11 .cse1) (+ v_ArrVal_521 1)))) .cse6 .cse7 .cse8 .cse9)))) (or .cse10 (not (= |ldv_kobject_put_#in~kobj#1.base| 0)))))) [2022-11-18 19:46:06,704 INFO L899 garLoopResultBuilder]: For program point L711-2(lines 709 714) no Hoare annotation was computed. [2022-11-18 19:46:06,704 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putEXIT(lines 709 714) no Hoare annotation was computed. [2022-11-18 19:46:06,705 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 677) no Hoare annotation was computed. [2022-11-18 19:46:06,705 INFO L899 garLoopResultBuilder]: For program point L705(lines 705 708) no Hoare annotation was computed. [2022-11-18 19:46:06,705 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 ((.cse0 (select (select |old(#memory_int)| |ldv_kobject_put_#in~kobj#1.base|) 12))) (or (not (<= .cse0 2)) .cse1 (let ((.cse2 (+ |ldv_kobject_put_#in~kobj#1.offset| 12)) (.cse3 (select |#memory_int| |ldv_kobject_put_~kobj#1.base|))) (and (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| .cse2) (= |ldv_kobject_put_~kobj#1.base| |ldv_kobject_put_#in~kobj#1.base|) (<= 0 (select .cse3 (+ 12 |ldv_kobject_put_~kobj#1.offset|))) (<= |ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1| 2) (<= |ldv_kobject_put_ldv_atomic_sub_return_#res#1| (select (select |#memory_int| |ldv_kobject_put_#in~kobj#1.base|) .cse2)) (= |ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| |ldv_kobject_put_#in~kobj#1.base|) (= |ldv_kobject_put_~kobj#1.offset| 0) (<= (select .cse3 12) 2) (<= 1 |ldv_kobject_put_ldv_atomic_sub_return_~i#1|))) (not (<= 2 .cse0)))) (or .cse1 (not (= |ldv_kobject_put_#in~kobj#1.base| 0))))) [2022-11-18 19:46:06,706 INFO L899 garLoopResultBuilder]: For program point L701(lines 701 703) no Hoare annotation was computed. [2022-11-18 19:46:06,706 INFO L899 garLoopResultBuilder]: For program point L697(lines 697 704) no Hoare annotation was computed. [2022-11-18 19:46:06,706 INFO L899 garLoopResultBuilder]: For program point ldv_kobject_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 667) no Hoare annotation was computed. [2022-11-18 19:46:06,710 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:46:06,713 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 19:46:06,738 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-18 19:46:06,742 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-18 19:46:06,744 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-18 19:46:06,749 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-18 19:46:06,754 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-18 19:46:06,770 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-18 19:46:06,773 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-18 19:46:06,773 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-18 19:46:06,780 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-18 19:46:06,781 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-18 19:46:06,782 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-18 19:46:06,783 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-18 19:46:06,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 07:46:06 BoogieIcfgContainer [2022-11-18 19:46:06,796 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 19:46:06,797 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 19:46:06,797 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 19:46:06,797 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 19:46:06,798 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:45:08" (3/4) ... [2022-11-18 19:46:06,801 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-18 19:46:06,808 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-18 19:46:06,810 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2022-11-18 19:46:06,810 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2022-11-18 19:46:06,816 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2022-11-18 19:46:06,819 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-11-18 19:46:06,820 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-18 19:46:06,853 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 == \result && \result == 0) || ((((((((unknown-#memory_int-unknown[kobj][12 + kobj] <= 1 && 0 == kobj) && !(kobj == 0)) && 0 == \result) && unknown-#memory_int-unknown[\result][12] <= 1) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && 1 <= unknown-#memory_int-unknown[\result][12]) && !(kobj == 0)) && !(kobj == 0)) [2022-11-18 19:46:06,854 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 19:46:06,857 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 19:46:06,858 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(kobj == 0) || !(kobj == 0)) && (((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || !(kobj == 0)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) || ((((((((v == kobj + 12 && kobj == kobj) && temp <= 2) && \result <= unknown-#memory_int-unknown[kobj][kobj + 12]) && v == kobj) && kobj == 0) && (\exists v_ArrVal_521 : int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_521]] && \old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= v_ArrVal_521 + 1)) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i))) && (((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || !(kobj == 0)) || !(0 <= \old(unknown-#memory_int-unknown)[kobj][kobj + 12])) || \old(\valid) == \valid) [2022-11-18 19:46:06,859 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || ((((((((((v == kobj + 12 && kobj == kobj) && 0 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && temp <= 2) && \result <= unknown-#memory_int-unknown[kobj][kobj + 12]) && v == kobj) && kobj == 0) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) || !(kobj == 0)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) || ((((((temp <= 2 && kobj == 0) && (\exists v_ArrVal_521 : int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_521]] && \old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= v_ArrVal_521 + 1)) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) && (!(kobj == 0) || !(kobj == 0)) [2022-11-18 19:46:06,860 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || ((((((((((v == kobj + 12 && kobj == kobj) && 0 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && temp <= 2) && \result <= unknown-#memory_int-unknown[kobj][kobj + 12]) && v == kobj) && kobj == 0) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) || !(kobj == 0)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) || ((((((temp <= 2 && kobj == 0) && (\exists v_ArrVal_521 : int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_521]] && \old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= v_ArrVal_521 + 1)) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) && (!(kobj == 0) || !(kobj == 0)) [2022-11-18 19:46:06,860 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || !(kobj == 0)) || ((((((((v == kobj + 12 && kobj == kobj) && 0 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && temp <= 2) && \result <= unknown-#memory_int-unknown[kobj][kobj + 12]) && v == kobj) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) && (!(kobj == 0) || !(kobj == 0)) [2022-11-18 19:46:06,897 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 19:46:06,898 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 19:46:06,903 INFO L158 Benchmark]: Toolchain (without parser) took 59483.53ms. Allocated memory was 130.0MB in the beginning and 220.2MB in the end (delta: 90.2MB). Free memory was 94.5MB in the beginning and 164.3MB in the end (delta: -69.8MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2022-11-18 19:46:06,904 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 92.3MB. Free memory was 45.5MB in the beginning and 45.4MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 19:46:06,905 INFO L158 Benchmark]: CACSL2BoogieTranslator took 604.15ms. Allocated memory is still 130.0MB. Free memory was 94.1MB in the beginning and 94.2MB in the end (delta: -29.0kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 19:46:06,906 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.87ms. Allocated memory is still 130.0MB. Free memory was 94.1MB in the beginning and 91.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 19:46:06,906 INFO L158 Benchmark]: Boogie Preprocessor took 38.30ms. Allocated memory is still 130.0MB. Free memory was 91.2MB in the beginning and 89.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 19:46:06,907 INFO L158 Benchmark]: RCFGBuilder took 684.50ms. Allocated memory is still 130.0MB. Free memory was 89.1MB in the beginning and 71.1MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-18 19:46:06,907 INFO L158 Benchmark]: TraceAbstraction took 57984.73ms. Allocated memory was 130.0MB in the beginning and 220.2MB in the end (delta: 90.2MB). Free memory was 70.6MB in the beginning and 168.5MB in the end (delta: -97.9MB). Peak memory consumption was 95.6MB. Max. memory is 16.1GB. [2022-11-18 19:46:06,908 INFO L158 Benchmark]: Witness Printer took 101.25ms. Allocated memory is still 220.2MB. Free memory was 168.5MB in the beginning and 164.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 19:46:06,911 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.30ms. Allocated memory is still 92.3MB. Free memory was 45.5MB in the beginning and 45.4MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 604.15ms. Allocated memory is still 130.0MB. Free memory was 94.1MB in the beginning and 94.2MB in the end (delta: -29.0kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.87ms. Allocated memory is still 130.0MB. Free memory was 94.1MB in the beginning and 91.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.30ms. Allocated memory is still 130.0MB. Free memory was 91.2MB in the beginning and 89.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 684.50ms. Allocated memory is still 130.0MB. Free memory was 89.1MB in the beginning and 71.1MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 57984.73ms. Allocated memory was 130.0MB in the beginning and 220.2MB in the end (delta: 90.2MB). Free memory was 70.6MB in the beginning and 168.5MB in the end (delta: -97.9MB). Peak memory consumption was 95.6MB. Max. memory is 16.1GB. * Witness Printer took 101.25ms. Allocated memory is still 220.2MB. Free memory was 168.5MB in the beginning and 164.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 659]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 659]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 667]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 667]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 52 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 57.8s, OverallIterations: 14, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 35.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 787 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 778 mSDsluCounter, 3298 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 432 IncrementalHoareTripleChecker+Unchecked, 2800 mSDsCounter, 193 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3458 IncrementalHoareTripleChecker+Invalid, 4083 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 193 mSolverCounterUnsat, 498 mSDtfsCounter, 3458 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 533 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 283 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1668 ImplicationChecksByTransitivity, 42.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=3, InterpolantAutomatonStates: 181, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 107 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 163 PreInvPairs, 340 NumberOfFragments, 1054 HoareAnnotationTreeSize, 163 FomulaSimplifications, 12 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 17 FomulaSimplificationsInter, 2682 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 16.6s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 606 ConstructedInterpolants, 16 QuantifiedInterpolants, 3034 SizeOfPredicates, 298 NumberOfNonLiveVariables, 1946 ConjunctsInSsa, 720 ConjunctsInUnsatCore, 21 InterpolantComputations, 10 PerfectInterpolantSequences, 27/75 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 19:46:06,941 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-18 19:46:06,951 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-18 19:46:06,952 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-18 19:46:06,953 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] Derived loop invariant: ((!(kobj == 0) || !(kobj == 0)) && (((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || !(kobj == 0)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) || ((((((((v == kobj + 12 && kobj == kobj) && temp <= 2) && \result <= unknown-#memory_int-unknown[kobj][kobj + 12]) && v == kobj) && kobj == 0) && (\exists v_ArrVal_521 : int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_521]] && \old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= v_ArrVal_521 + 1)) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i))) && (((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || !(kobj == 0)) || !(0 <= \old(unknown-#memory_int-unknown)[kobj][kobj + 12])) || \old(\valid) == \valid) - InvariantResult [Line: 738]: Loop Invariant Derived loop invariant: (0 == \result && \result == 0) || ((((((((unknown-#memory_int-unknown[kobj][12 + kobj] <= 1 && 0 == kobj) && !(kobj == 0)) && 0 == \result) && unknown-#memory_int-unknown[\result][12] <= 1) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && 1 <= unknown-#memory_int-unknown[\result][12]) && !(kobj == 0)) && !(kobj == 0)) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 == kobj && !(kobj == 0) - InvariantResult [Line: 671]: Loop Invariant [2022-11-18 19:46:06,956 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-18 19:46:06,956 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-18 19:46:06,957 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-18 19:46:06,958 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] Derived loop invariant: ((((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || ((((((((((v == kobj + 12 && kobj == kobj) && 0 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && temp <= 2) && \result <= unknown-#memory_int-unknown[kobj][kobj + 12]) && v == kobj) && kobj == 0) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) || !(kobj == 0)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) || ((((((temp <= 2 && kobj == 0) && (\exists v_ArrVal_521 : int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_521]] && \old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= v_ArrVal_521 + 1)) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) && (!(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: ((((unknown-#memory_int-unknown[kobj][12 + kobj] <= 1 && 0 == kobj) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && !(kobj == 0)) && !(kobj == 0) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || !(kobj == 0)) || ((((((((v == kobj + 12 && kobj == kobj) && 0 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && temp <= 2) && \result <= unknown-#memory_int-unknown[kobj][kobj + 12]) && v == kobj) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) && (!(kobj == 0) || !(kobj == 0)) - InvariantResult [Line: 721]: Loop Invariant Derived loop invariant: ((((unknown-#memory_int-unknown[kobj][12 + kobj] <= 1 && 0 == kobj) && !(kobj == 0)) && 1 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && !(kobj == 0)) && !(kobj == 0) - InvariantResult [Line: 688]: Loop Invariant [2022-11-18 19:46:06,977 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-18 19:46:06,977 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-18 19:46:06,978 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] [2022-11-18 19:46:06,979 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_521,QUANTIFIED] Derived loop invariant: ((((!(\old(unknown-#memory_int-unknown)[kobj][12] <= 2) || ((((((((((v == kobj + 12 && kobj == kobj) && 0 <= unknown-#memory_int-unknown[kobj][12 + kobj]) && temp <= 2) && \result <= unknown-#memory_int-unknown[kobj][kobj + 12]) && v == kobj) && kobj == 0) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) || !(kobj == 0)) || !(2 <= \old(unknown-#memory_int-unknown)[kobj][12])) || ((((((temp <= 2 && kobj == 0) && (\exists v_ArrVal_521 : int :: unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)[kobj := \old(unknown-#memory_int-unknown)[kobj][kobj + 12 := v_ArrVal_521]] && \old(unknown-#memory_int-unknown)[kobj][kobj + 12] <= v_ArrVal_521 + 1)) && kobj == 0) && unknown-#memory_int-unknown[kobj][12] <= 2) && unknown-#memory_int-unknown[kobj][12] <= 2) && 1 <= i)) && (!(kobj == 0) || !(kobj == 0)) RESULT: Ultimate proved your program to be correct! [2022-11-18 19:46:06,996 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_900b71e6-b28c-4dda-b5db-dcaf051a2085/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