/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/verifythis/elimination_max.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 17:08:52,552 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 17:08:52,554 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 17:08:52,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 17:08:52,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 17:08:52,606 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 17:08:52,608 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 17:08:52,610 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 17:08:52,612 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 17:08:52,616 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 17:08:52,617 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 17:08:52,618 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 17:08:52,618 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 17:08:52,622 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 17:08:52,622 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 17:08:52,625 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 17:08:52,625 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 17:08:52,626 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 17:08:52,628 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 17:08:52,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 17:08:52,635 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 17:08:52,636 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 17:08:52,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 17:08:52,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 17:08:52,639 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 17:08:52,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 17:08:52,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 17:08:52,645 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 17:08:52,646 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 17:08:52,646 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 17:08:52,647 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 17:08:52,647 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 17:08:52,648 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 17:08:52,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 17:08:52,649 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 17:08:52,650 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 17:08:52,650 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 17:08:52,650 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 17:08:52,650 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 17:08:52,651 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 17:08:52,651 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 17:08:52,652 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 17:08:52,653 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 17:08:52,661 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 17:08:52,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 17:08:52,662 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 17:08:52,662 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 17:08:52,662 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 17:08:52,662 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 17:08:52,663 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 17:08:52,663 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 17:08:52,666 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 17:08:52,667 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 17:08:52,667 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 17:08:52,667 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 17:08:52,667 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 17:08:52,668 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 17:08:52,668 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 17:08:52,668 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 17:08:52,668 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 17:08:52,668 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 17:08:52,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 17:08:52,668 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 17:08:52,668 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 17:08:52,670 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 17:08:52,670 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 17:08:52,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 17:08:52,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 17:08:52,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 17:08:52,936 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 17:08:52,937 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 17:08:52,938 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/elimination_max.c [2022-04-27 17:08:52,994 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0850ffa7/11183ede9e044763b2413a2ebeea32a7/FLAGf2d587053 [2022-04-27 17:08:53,397 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 17:08:53,398 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max.c [2022-04-27 17:08:53,405 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0850ffa7/11183ede9e044763b2413a2ebeea32a7/FLAGf2d587053 [2022-04-27 17:08:53,416 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0850ffa7/11183ede9e044763b2413a2ebeea32a7 [2022-04-27 17:08:53,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 17:08:53,419 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 17:08:53,425 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 17:08:53,425 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 17:08:53,438 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 17:08:53,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 05:08:53" (1/1) ... [2022-04-27 17:08:53,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fa2bf25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:08:53, skipping insertion in model container [2022-04-27 17:08:53,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 05:08:53" (1/1) ... [2022-04-27 17:08:53,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 17:08:53,462 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 17:08:53,612 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max.c[485,498] [2022-04-27 17:08:53,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 17:08:53,661 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 17:08:53,674 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max.c[485,498] [2022-04-27 17:08:53,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 17:08:53,709 INFO L208 MainTranslator]: Completed translation [2022-04-27 17:08:53,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:08:53 WrapperNode [2022-04-27 17:08:53,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 17:08:53,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 17:08:53,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 17:08:53,712 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 17:08:53,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:08:53" (1/1) ... [2022-04-27 17:08:53,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:08:53" (1/1) ... [2022-04-27 17:08:53,734 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:08:53" (1/1) ... [2022-04-27 17:08:53,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:08:53" (1/1) ... [2022-04-27 17:08:53,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:08:53" (1/1) ... [2022-04-27 17:08:53,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:08:53" (1/1) ... [2022-04-27 17:08:53,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:08:53" (1/1) ... [2022-04-27 17:08:53,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 17:08:53,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 17:08:53,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 17:08:53,757 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 17:08:53,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:08:53" (1/1) ... [2022-04-27 17:08:53,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 17:08:53,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 17:08:53,784 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 17:08:53,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 17:08:53,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 17:08:53,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 17:08:53,823 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 17:08:53,823 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 17:08:53,823 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 17:08:53,823 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 17:08:53,823 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-27 17:08:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-27 17:08:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-04-27 17:08:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 17:08:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 17:08:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 17:08:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 17:08:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 17:08:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 17:08:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 17:08:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 17:08:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-27 17:08:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-27 17:08:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 17:08:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 17:08:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 17:08:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 17:08:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 17:08:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 17:08:53,908 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 17:08:53,910 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 17:08:54,091 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 17:08:54,104 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 17:08:54,104 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 17:08:54,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:08:54 BoogieIcfgContainer [2022-04-27 17:08:54,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 17:08:54,106 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 17:08:54,106 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 17:08:54,117 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 17:08:54,124 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:08:54" (1/1) ... [2022-04-27 17:08:54,126 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 17:08:54,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 05:08:54 BasicIcfg [2022-04-27 17:08:54,160 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 17:08:54,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 17:08:54,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 17:08:54,164 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 17:08:54,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 05:08:53" (1/4) ... [2022-04-27 17:08:54,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f66691e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 05:08:54, skipping insertion in model container [2022-04-27 17:08:54,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 05:08:53" (2/4) ... [2022-04-27 17:08:54,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f66691e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 05:08:54, skipping insertion in model container [2022-04-27 17:08:54,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 05:08:54" (3/4) ... [2022-04-27 17:08:54,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f66691e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 05:08:54, skipping insertion in model container [2022-04-27 17:08:54,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 05:08:54" (4/4) ... [2022-04-27 17:08:54,166 INFO L111 eAbstractionObserver]: Analyzing ICFG elimination_max.cJordan [2022-04-27 17:08:54,178 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 17:08:54,178 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 17:08:54,214 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 17:08:54,222 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@44c437b8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@673ad55d [2022-04-27 17:08:54,222 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 17:08:54,229 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 17:08:54,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 17:08:54,235 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:08:54,236 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:08:54,237 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:08:54,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:08:54,245 INFO L85 PathProgramCache]: Analyzing trace with hash 64952803, now seen corresponding path program 1 times [2022-04-27 17:08:54,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:08:54,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534899790] [2022-04-27 17:08:54,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:08:54,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:08:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:08:54,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:08:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:08:54,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#length_3| 2) 18) (= (select .cse0 0) 48) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {42#true} is VALID [2022-04-27 17:08:54,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 17:08:54,500 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} [126] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 17:08:54,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 17:08:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:08:54,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} [94] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID [2022-04-27 17:08:54,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [96] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 17:08:54,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} [100] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 17:08:54,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} [127] assume_abort_if_notEXIT-->L19-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~n~0_9) (< v_main_~n~0_9 1073741824)) 1 0)) InVars {main_~n~0=v_main_~n~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {43#false} is VALID [2022-04-27 17:08:54,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 17:08:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:08:54,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {59#(= |#memory_int| |old(#memory_int)|)} [99] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {42#true} is VALID [2022-04-27 17:08:54,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [104] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 17:08:54,540 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {43#false} [129] #Ultimate.meminitEXIT-->L20-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_10 4)) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc6.base_4|) (= v_main_~n~0_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc6.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|)) InVars {main_#t~malloc6.base=|v_main_#t~malloc6.base_4|, main_~n~0=v_main_~n~0_10, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[#Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_#t~malloc6.base, main_~n~0, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, main_#t~malloc6.offset] {43#false} is VALID [2022-04-27 17:08:54,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-27 17:08:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:08:54,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} [94] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID [2022-04-27 17:08:54,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [96] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 17:08:54,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} [100] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 17:08:54,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} [128] assume_abort_if_notEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (< v_main_~i~0_11 v_main_~n~0_11) (<= 0 v_main_~i~0_11)) 1 0)) InVars {main_~i~0=v_main_~i~0_11, main_~n~0=v_main_~n~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~i~0, main_~n~0, assume_abort_if_not_#in~cond] {43#false} is VALID [2022-04-27 17:08:54,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 17:08:54,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#length_3| 2) 18) (= (select .cse0 0) 48) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {42#true} is VALID [2022-04-27 17:08:54,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 17:08:54,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} [126] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 17:08:54,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 17:08:54,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} [90] mainENTRY-->L19: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~n~0] {42#true} is VALID [2022-04-27 17:08:54,559 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} [92] L19-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~n~0_9) (< v_main_~n~0_9 1073741824)) 1 0)) InVars {main_~n~0=v_main_~n~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-27 17:08:54,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} [94] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID [2022-04-27 17:08:54,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} [96] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 17:08:54,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} [100] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 17:08:54,561 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} [127] assume_abort_if_notEXIT-->L19-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~n~0_9) (< v_main_~n~0_9 1073741824)) 1 0)) InVars {main_~n~0=v_main_~n~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {43#false} is VALID [2022-04-27 17:08:54,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {43#false} [93] L19-1-->L20: Formula: (and (= (store |v_#length_2| |v_main_#t~malloc6.base_1| (* v_main_~n~0_5 4)) |v_#length_1|) (= (store |v_#valid_2| |v_main_#t~malloc6.base_1| 1) |v_#valid_1|) (= (select |v_#valid_2| |v_main_#t~malloc6.base_1|) 0) (not (= 0 |v_main_#t~malloc6.base_1|)) (< |v_main_#t~malloc6.base_1| |v_#StackHeapBarrier_1|) (= |v_main_#t~malloc6.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, main_~n~0=v_main_~n~0_5, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #length=|v_#length_1|, main_#t~malloc6.base=|v_main_#t~malloc6.base_1|, main_~n~0=v_main_~n~0_5, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_1|} AuxVars[] AssignedVars[#valid, #length, main_#t~malloc6.base, main_#t~malloc6.offset] {43#false} is VALID [2022-04-27 17:08:54,562 INFO L272 TraceCheckUtils]: 12: Hoare triple {43#false} [95] L20-->#Ultimate.meminitENTRY: Formula: (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_10 4)) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc6.base_4|) (= v_main_~n~0_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc6.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|)) InVars {main_#t~malloc6.base=|v_main_#t~malloc6.base_4|, main_~n~0=v_main_~n~0_10, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[#Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_#t~malloc6.base, main_~n~0, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, main_#t~malloc6.offset] {59#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 17:08:54,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {59#(= |#memory_int| |old(#memory_int)|)} [99] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {42#true} is VALID [2022-04-27 17:08:54,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#true} [104] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-27 17:08:54,563 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {42#true} {43#false} [129] #Ultimate.meminitEXIT-->L20-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_10 4)) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc6.base_4|) (= v_main_~n~0_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc6.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|)) InVars {main_#t~malloc6.base=|v_main_#t~malloc6.base_4|, main_~n~0=v_main_~n~0_10, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[#Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_#t~malloc6.base, main_~n~0, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, main_#t~malloc6.offset] {43#false} is VALID [2022-04-27 17:08:54,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} [98] L20-1-->L35-2: Formula: (and (= |v_main_#t~malloc6.offset_3| v_main_~a~0.offset_3) (= v_main_~a~0.base_3 |v_main_#t~malloc6.base_3|) (= (+ (- 1) v_main_~n~0_8) v_main_~y~0_1) (= v_main_~x~0_3 0)) InVars {main_~n~0=v_main_~n~0_8, main_#t~malloc6.base=|v_main_#t~malloc6.base_3|, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_3|} OutVars{main_~x~0=v_main_~x~0_3, main_~a~0.base=v_main_~a~0.base_3, main_~y~0=v_main_~y~0_1, main_~n~0=v_main_~n~0_8, main_#t~malloc6.base=|v_main_#t~malloc6.base_3|, main_~a~0.offset=v_main_~a~0.offset_3, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_3|} AuxVars[] AssignedVars[main_~x~0, main_~a~0.base, main_~y~0, main_~a~0.offset] {43#false} is VALID [2022-04-27 17:08:54,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#false} [101] L35-2-->L25-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 17:08:54,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {43#false} [105] L25-2-->L42: Formula: (and (= v_main_~i~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0, main_#t~nondet11] {43#false} is VALID [2022-04-27 17:08:54,565 INFO L272 TraceCheckUtils]: 19: Hoare triple {43#false} [109] L42-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (< v_main_~i~0_11 v_main_~n~0_11) (<= 0 v_main_~i~0_11)) 1 0)) InVars {main_~i~0=v_main_~i~0_11, main_~n~0=v_main_~n~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~i~0, main_~n~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-27 17:08:54,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {42#true} [94] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID [2022-04-27 17:08:54,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {42#true} [96] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 17:08:54,567 INFO L290 TraceCheckUtils]: 22: Hoare triple {43#false} [100] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 17:08:54,567 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {43#false} {43#false} [128] assume_abort_if_notEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (< v_main_~i~0_11 v_main_~n~0_11) (<= 0 v_main_~i~0_11)) 1 0)) InVars {main_~i~0=v_main_~i~0_11, main_~n~0=v_main_~n~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~i~0, main_~n~0, assume_abort_if_not_#in~cond] {43#false} is VALID [2022-04-27 17:08:54,567 INFO L290 TraceCheckUtils]: 24: Hoare triple {43#false} [108] L42-1-->L43: Formula: (let ((.cse0 (select |v_#memory_int_1| v_main_~a~0.base_1))) (and (= |v_main_#t~mem13_1| (select .cse0 (+ (* v_main_~x~0_1 4) v_main_~a~0.offset_1))) (= |v_main_#t~mem12_1| (select .cse0 (+ v_main_~a~0.offset_1 (* v_main_~i~0_5 4)))))) InVars {main_~a~0.base=v_main_~a~0.base_1, #memory_int=|v_#memory_int_1|, main_~i~0=v_main_~i~0_5, main_~x~0=v_main_~x~0_1, main_~a~0.offset=v_main_~a~0.offset_1} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_#t~mem13=|v_main_#t~mem13_1|, main_~x~0=v_main_~x~0_1, main_~a~0.base=v_main_~a~0.base_1, #memory_int=|v_#memory_int_1|, main_~i~0=v_main_~i~0_5, main_~a~0.offset=v_main_~a~0.offset_1} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13] {43#false} is VALID [2022-04-27 17:08:54,568 INFO L272 TraceCheckUtils]: 25: Hoare triple {43#false} [110] L43-->__VERIFIER_assertENTRY: Formula: (= (ite (<= |v_main_#t~mem12_4| |v_main_#t~mem13_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond] {43#false} is VALID [2022-04-27 17:08:54,569 INFO L290 TraceCheckUtils]: 26: Hoare triple {43#false} [112] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {43#false} is VALID [2022-04-27 17:08:54,569 INFO L290 TraceCheckUtils]: 27: Hoare triple {43#false} [116] L11-->L11-1: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 17:08:54,569 INFO L290 TraceCheckUtils]: 28: Hoare triple {43#false} [120] L11-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-27 17:08:54,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 17:08:54,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:08:54,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534899790] [2022-04-27 17:08:54,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534899790] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:08:54,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:08:54,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 17:08:54,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674422284] [2022-04-27 17:08:54,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:08:54,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-27 17:08:54,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:08:54,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 17:08:54,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:08:54,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 17:08:54,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:08:54,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 17:08:54,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 17:08:54,654 INFO L87 Difference]: Start difference. First operand has 39 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 17:08:54,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:08:54,892 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-27 17:08:54,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 17:08:54,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-27 17:08:54,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:08:54,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 17:08:54,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-27 17:08:54,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 17:08:54,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-27 17:08:54,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-27 17:08:54,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:08:54,984 INFO L225 Difference]: With dead ends: 39 [2022-04-27 17:08:54,984 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 17:08:54,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 17:08:54,989 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 36 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 17:08:54,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 38 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 17:08:55,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 17:08:55,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-27 17:08:55,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:08:55,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 17:08:55,020 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 17:08:55,020 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 17:08:55,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:08:55,025 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 17:08:55,025 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 17:08:55,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:08:55,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:08:55,028 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-27 17:08:55,029 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-27 17:08:55,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:08:55,042 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 17:08:55,042 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 17:08:55,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:08:55,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:08:55,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:08:55,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:08:55,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 17:08:55,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-27 17:08:55,049 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 29 [2022-04-27 17:08:55,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:08:55,049 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-27 17:08:55,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 17:08:55,050 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 17:08:55,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 17:08:55,054 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:08:55,055 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 17:08:55,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 17:08:55,056 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:08:55,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:08:55,056 INFO L85 PathProgramCache]: Analyzing trace with hash -2146770526, now seen corresponding path program 1 times [2022-04-27 17:08:55,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:08:55,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667395695] [2022-04-27 17:08:55,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:08:55,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:08:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:08:55,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:08:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:08:55,210 INFO L290 TraceCheckUtils]: 0: Hoare triple {228#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#length_3| 2) 18) (= (select .cse0 0) 48) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {206#true} is VALID [2022-04-27 17:08:55,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {206#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-27 17:08:55,210 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {206#true} {206#true} [126] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-27 17:08:55,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 17:08:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:08:55,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {206#true} [94] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {206#true} is VALID [2022-04-27 17:08:55,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {206#true} [97] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-27 17:08:55,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {206#true} [100] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-27 17:08:55,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {206#true} {206#true} [127] assume_abort_if_notEXIT-->L19-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~n~0_9) (< v_main_~n~0_9 1073741824)) 1 0)) InVars {main_~n~0=v_main_~n~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {206#true} is VALID [2022-04-27 17:08:55,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 17:08:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:08:55,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {229#(= |#memory_int| |old(#memory_int)|)} [99] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {230#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 17:08:55,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {230#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} [104] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {230#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 17:08:55,245 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {230#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {206#true} [129] #Ultimate.meminitEXIT-->L20-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_10 4)) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc6.base_4|) (= v_main_~n~0_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc6.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|)) InVars {main_#t~malloc6.base=|v_main_#t~malloc6.base_4|, main_~n~0=v_main_~n~0_10, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[#Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_#t~malloc6.base, main_~n~0, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, main_#t~malloc6.offset] {218#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc6.base|))} is VALID [2022-04-27 17:08:55,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-27 17:08:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:08:55,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {206#true} [94] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {206#true} is VALID [2022-04-27 17:08:55,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {206#true} [97] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-27 17:08:55,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {206#true} [100] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-27 17:08:55,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {206#true} {220#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~x~0 4))) 0) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~i~0 4))) 0))} [128] assume_abort_if_notEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (< v_main_~i~0_11 v_main_~n~0_11) (<= 0 v_main_~i~0_11)) 1 0)) InVars {main_~i~0=v_main_~i~0_11, main_~n~0=v_main_~n~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~i~0, main_~n~0, assume_abort_if_not_#in~cond] {220#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~x~0 4))) 0) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~i~0 4))) 0))} is VALID [2022-04-27 17:08:55,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {206#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {228#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 17:08:55,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#length_3| 2) 18) (= (select .cse0 0) 48) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {206#true} is VALID [2022-04-27 17:08:55,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {206#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-27 17:08:55,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {206#true} {206#true} [126] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-27 17:08:55,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {206#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-27 17:08:55,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {206#true} [90] mainENTRY-->L19: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~n~0] {206#true} is VALID [2022-04-27 17:08:55,257 INFO L272 TraceCheckUtils]: 6: Hoare triple {206#true} [92] L19-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~n~0_9) (< v_main_~n~0_9 1073741824)) 1 0)) InVars {main_~n~0=v_main_~n~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {206#true} is VALID [2022-04-27 17:08:55,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {206#true} [94] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {206#true} is VALID [2022-04-27 17:08:55,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {206#true} [97] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-27 17:08:55,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {206#true} [100] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-27 17:08:55,258 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {206#true} {206#true} [127] assume_abort_if_notEXIT-->L19-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~n~0_9) (< v_main_~n~0_9 1073741824)) 1 0)) InVars {main_~n~0=v_main_~n~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {206#true} is VALID [2022-04-27 17:08:55,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {206#true} [93] L19-1-->L20: Formula: (and (= (store |v_#length_2| |v_main_#t~malloc6.base_1| (* v_main_~n~0_5 4)) |v_#length_1|) (= (store |v_#valid_2| |v_main_#t~malloc6.base_1| 1) |v_#valid_1|) (= (select |v_#valid_2| |v_main_#t~malloc6.base_1|) 0) (not (= 0 |v_main_#t~malloc6.base_1|)) (< |v_main_#t~malloc6.base_1| |v_#StackHeapBarrier_1|) (= |v_main_#t~malloc6.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, main_~n~0=v_main_~n~0_5, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #length=|v_#length_1|, main_#t~malloc6.base=|v_main_#t~malloc6.base_1|, main_~n~0=v_main_~n~0_5, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_1|} AuxVars[] AssignedVars[#valid, #length, main_#t~malloc6.base, main_#t~malloc6.offset] {206#true} is VALID [2022-04-27 17:08:55,259 INFO L272 TraceCheckUtils]: 12: Hoare triple {206#true} [95] L20-->#Ultimate.meminitENTRY: Formula: (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_10 4)) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc6.base_4|) (= v_main_~n~0_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc6.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|)) InVars {main_#t~malloc6.base=|v_main_#t~malloc6.base_4|, main_~n~0=v_main_~n~0_10, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[#Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_#t~malloc6.base, main_~n~0, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, main_#t~malloc6.offset] {229#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 17:08:55,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {229#(= |#memory_int| |old(#memory_int)|)} [99] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {230#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 17:08:55,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {230#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} [104] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {230#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 17:08:55,262 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {230#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {206#true} [129] #Ultimate.meminitEXIT-->L20-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_10 4)) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc6.base_4|) (= v_main_~n~0_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc6.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|)) InVars {main_#t~malloc6.base=|v_main_#t~malloc6.base_4|, main_~n~0=v_main_~n~0_10, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[#Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_#t~malloc6.base, main_~n~0, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, main_#t~malloc6.offset] {218#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc6.base|))} is VALID [2022-04-27 17:08:55,263 INFO L290 TraceCheckUtils]: 16: Hoare triple {218#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc6.base|))} [98] L20-1-->L35-2: Formula: (and (= |v_main_#t~malloc6.offset_3| v_main_~a~0.offset_3) (= v_main_~a~0.base_3 |v_main_#t~malloc6.base_3|) (= (+ (- 1) v_main_~n~0_8) v_main_~y~0_1) (= v_main_~x~0_3 0)) InVars {main_~n~0=v_main_~n~0_8, main_#t~malloc6.base=|v_main_#t~malloc6.base_3|, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_3|} OutVars{main_~x~0=v_main_~x~0_3, main_~a~0.base=v_main_~a~0.base_3, main_~y~0=v_main_~y~0_1, main_~n~0=v_main_~n~0_8, main_#t~malloc6.base=|v_main_#t~malloc6.base_3|, main_~a~0.offset=v_main_~a~0.offset_3, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_3|} AuxVars[] AssignedVars[main_~x~0, main_~a~0.base, main_~y~0, main_~a~0.offset] {219#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-27 17:08:55,263 INFO L290 TraceCheckUtils]: 17: Hoare triple {219#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} [102] L35-2-->L25-2: Formula: (not (< v_main_~x~0_4 v_main_~y~0_2)) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_2} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[] {219#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-27 17:08:55,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {219#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} [105] L25-2-->L42: Formula: (and (= v_main_~i~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0, main_#t~nondet11] {220#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~x~0 4))) 0) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~i~0 4))) 0))} is VALID [2022-04-27 17:08:55,264 INFO L272 TraceCheckUtils]: 19: Hoare triple {220#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~x~0 4))) 0) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~i~0 4))) 0))} [109] L42-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (< v_main_~i~0_11 v_main_~n~0_11) (<= 0 v_main_~i~0_11)) 1 0)) InVars {main_~i~0=v_main_~i~0_11, main_~n~0=v_main_~n~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~i~0, main_~n~0, assume_abort_if_not_#in~cond] {206#true} is VALID [2022-04-27 17:08:55,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {206#true} [94] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {206#true} is VALID [2022-04-27 17:08:55,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {206#true} [97] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-27 17:08:55,265 INFO L290 TraceCheckUtils]: 22: Hoare triple {206#true} [100] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-27 17:08:55,266 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {206#true} {220#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~x~0 4))) 0) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~i~0 4))) 0))} [128] assume_abort_if_notEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (< v_main_~i~0_11 v_main_~n~0_11) (<= 0 v_main_~i~0_11)) 1 0)) InVars {main_~i~0=v_main_~i~0_11, main_~n~0=v_main_~n~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~i~0, main_~n~0, assume_abort_if_not_#in~cond] {220#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~x~0 4))) 0) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~i~0 4))) 0))} is VALID [2022-04-27 17:08:55,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {220#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~x~0 4))) 0) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~i~0 4))) 0))} [108] L42-1-->L43: Formula: (let ((.cse0 (select |v_#memory_int_1| v_main_~a~0.base_1))) (and (= |v_main_#t~mem13_1| (select .cse0 (+ (* v_main_~x~0_1 4) v_main_~a~0.offset_1))) (= |v_main_#t~mem12_1| (select .cse0 (+ v_main_~a~0.offset_1 (* v_main_~i~0_5 4)))))) InVars {main_~a~0.base=v_main_~a~0.base_1, #memory_int=|v_#memory_int_1|, main_~i~0=v_main_~i~0_5, main_~x~0=v_main_~x~0_1, main_~a~0.offset=v_main_~a~0.offset_1} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_#t~mem13=|v_main_#t~mem13_1|, main_~x~0=v_main_~x~0_1, main_~a~0.base=v_main_~a~0.base_1, #memory_int=|v_#memory_int_1|, main_~i~0=v_main_~i~0_5, main_~a~0.offset=v_main_~a~0.offset_1} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13] {225#(and (= |main_#t~mem12| 0) (= |main_#t~mem13| 0))} is VALID [2022-04-27 17:08:55,267 INFO L272 TraceCheckUtils]: 25: Hoare triple {225#(and (= |main_#t~mem12| 0) (= |main_#t~mem13| 0))} [110] L43-->__VERIFIER_assertENTRY: Formula: (= (ite (<= |v_main_#t~mem12_4| |v_main_#t~mem13_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond] {226#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 17:08:55,268 INFO L290 TraceCheckUtils]: 26: Hoare triple {226#(not (= |__VERIFIER_assert_#in~cond| 0))} [112] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {227#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 17:08:55,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {227#(not (= __VERIFIER_assert_~cond 0))} [116] L11-->L11-1: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {207#false} is VALID [2022-04-27 17:08:55,269 INFO L290 TraceCheckUtils]: 28: Hoare triple {207#false} [120] L11-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {207#false} is VALID [2022-04-27 17:08:55,269 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 17:08:55,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:08:55,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667395695] [2022-04-27 17:08:55,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667395695] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:08:55,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:08:55,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-27 17:08:55,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125468467] [2022-04-27 17:08:55,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:08:55,271 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-27 17:08:55,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:08:55,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 17:08:55,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:08:55,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 17:08:55,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:08:55,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 17:08:55,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-04-27 17:08:55,297 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 17:08:56,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:08:56,019 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-27 17:08:56,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 17:08:56,020 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-27 17:08:56,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:08:56,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 17:08:56,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2022-04-27 17:08:56,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 17:08:56,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2022-04-27 17:08:56,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 42 transitions. [2022-04-27 17:08:56,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:08:56,075 INFO L225 Difference]: With dead ends: 38 [2022-04-27 17:08:56,075 INFO L226 Difference]: Without dead ends: 38 [2022-04-27 17:08:56,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2022-04-27 17:08:56,077 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 73 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 17:08:56,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 37 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 17:08:56,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-27 17:08:56,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-27 17:08:56,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:08:56,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 17:08:56,082 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 17:08:56,082 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 17:08:56,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:08:56,084 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-27 17:08:56,084 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-27 17:08:56,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:08:56,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:08:56,085 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 38 states. [2022-04-27 17:08:56,085 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 38 states. [2022-04-27 17:08:56,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:08:56,088 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-27 17:08:56,088 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-27 17:08:56,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:08:56,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:08:56,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:08:56,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:08:56,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 17:08:56,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-27 17:08:56,090 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 29 [2022-04-27 17:08:56,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:08:56,091 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-27 17:08:56,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 17:08:56,091 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-27 17:08:56,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 17:08:56,092 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 17:08:56,092 INFO L195 NwaCegarLoop]: trace histogram [2, 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] [2022-04-27 17:08:56,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 17:08:56,092 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 17:08:56,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 17:08:56,093 INFO L85 PathProgramCache]: Analyzing trace with hash -359953696, now seen corresponding path program 1 times [2022-04-27 17:08:56,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 17:08:56,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758356091] [2022-04-27 17:08:56,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 17:08:56,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 17:08:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:08:56,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 17:08:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:08:56,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {429#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#length_3| 2) 18) (= (select .cse0 0) 48) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {402#true} is VALID [2022-04-27 17:08:56,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {402#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {402#true} is VALID [2022-04-27 17:08:56,255 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {402#true} {402#true} [126] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {402#true} is VALID [2022-04-27 17:08:56,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 17:08:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:08:56,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {402#true} [94] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {402#true} is VALID [2022-04-27 17:08:56,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {402#true} [97] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {402#true} is VALID [2022-04-27 17:08:56,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {402#true} [100] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {402#true} is VALID [2022-04-27 17:08:56,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {402#true} {402#true} [127] assume_abort_if_notEXIT-->L19-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~n~0_9) (< v_main_~n~0_9 1073741824)) 1 0)) InVars {main_~n~0=v_main_~n~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {402#true} is VALID [2022-04-27 17:08:56,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 17:08:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:08:56,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {430#(= |#memory_int| |old(#memory_int)|)} [99] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {431#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 17:08:56,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {431#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} [104] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {431#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 17:08:56,306 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {431#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {402#true} [129] #Ultimate.meminitEXIT-->L20-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_10 4)) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc6.base_4|) (= v_main_~n~0_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc6.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|)) InVars {main_#t~malloc6.base=|v_main_#t~malloc6.base_4|, main_~n~0=v_main_~n~0_10, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[#Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_#t~malloc6.base, main_~n~0, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, main_#t~malloc6.offset] {414#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc6.base|))} is VALID [2022-04-27 17:08:56,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-27 17:08:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:08:56,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {402#true} [94] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {402#true} is VALID [2022-04-27 17:08:56,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {402#true} [97] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {402#true} is VALID [2022-04-27 17:08:56,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {402#true} [100] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {402#true} is VALID [2022-04-27 17:08:56,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {402#true} {415#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} [128] assume_abort_if_notEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (< v_main_~i~0_11 v_main_~n~0_11) (<= 0 v_main_~i~0_11)) 1 0)) InVars {main_~i~0=v_main_~i~0_11, main_~n~0=v_main_~n~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~i~0, main_~n~0, assume_abort_if_not_#in~cond] {415#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-27 17:08:56,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-27 17:08:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 17:08:56,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {402#true} [112] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {402#true} is VALID [2022-04-27 17:08:56,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {402#true} [117] L11-->L11-3: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {402#true} is VALID [2022-04-27 17:08:56,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {402#true} [122] L11-3-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {402#true} is VALID [2022-04-27 17:08:56,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {402#true} {420#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= |main_#t~mem13| 0))} [130] __VERIFIER_assertEXIT-->L43-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= |v_main_#t~mem12_4| |v_main_#t~mem13_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond] {415#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-27 17:08:56,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {402#true} [86] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {429#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 17:08:56,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {429#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [88] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#length_3| 2) 18) (= (select .cse0 0) 48) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= 1 (select |v_#valid_5| 3)) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {402#true} is VALID [2022-04-27 17:08:56,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {402#true} [91] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {402#true} is VALID [2022-04-27 17:08:56,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {402#true} {402#true} [126] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {402#true} is VALID [2022-04-27 17:08:56,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {402#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {402#true} is VALID [2022-04-27 17:08:56,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {402#true} [90] mainENTRY-->L19: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~n~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~n~0] {402#true} is VALID [2022-04-27 17:08:56,324 INFO L272 TraceCheckUtils]: 6: Hoare triple {402#true} [92] L19-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~n~0_9) (< v_main_~n~0_9 1073741824)) 1 0)) InVars {main_~n~0=v_main_~n~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {402#true} is VALID [2022-04-27 17:08:56,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {402#true} [94] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {402#true} is VALID [2022-04-27 17:08:56,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {402#true} [97] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {402#true} is VALID [2022-04-27 17:08:56,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {402#true} [100] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {402#true} is VALID [2022-04-27 17:08:56,325 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {402#true} {402#true} [127] assume_abort_if_notEXIT-->L19-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~n~0_9) (< v_main_~n~0_9 1073741824)) 1 0)) InVars {main_~n~0=v_main_~n~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~n~0, assume_abort_if_not_#in~cond] {402#true} is VALID [2022-04-27 17:08:56,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {402#true} [93] L19-1-->L20: Formula: (and (= (store |v_#length_2| |v_main_#t~malloc6.base_1| (* v_main_~n~0_5 4)) |v_#length_1|) (= (store |v_#valid_2| |v_main_#t~malloc6.base_1| 1) |v_#valid_1|) (= (select |v_#valid_2| |v_main_#t~malloc6.base_1|) 0) (not (= 0 |v_main_#t~malloc6.base_1|)) (< |v_main_#t~malloc6.base_1| |v_#StackHeapBarrier_1|) (= |v_main_#t~malloc6.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, main_~n~0=v_main_~n~0_5, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #length=|v_#length_1|, main_#t~malloc6.base=|v_main_#t~malloc6.base_1|, main_~n~0=v_main_~n~0_5, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_1|} AuxVars[] AssignedVars[#valid, #length, main_#t~malloc6.base, main_#t~malloc6.offset] {402#true} is VALID [2022-04-27 17:08:56,326 INFO L272 TraceCheckUtils]: 12: Hoare triple {402#true} [95] L20-->#Ultimate.meminitENTRY: Formula: (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_10 4)) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc6.base_4|) (= v_main_~n~0_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc6.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|)) InVars {main_#t~malloc6.base=|v_main_#t~malloc6.base_4|, main_~n~0=v_main_~n~0_10, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[#Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_#t~malloc6.base, main_~n~0, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, main_#t~malloc6.offset] {430#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 17:08:56,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {430#(= |#memory_int| |old(#memory_int)|)} [99] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {431#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 17:08:56,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {431#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} [104] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {431#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 17:08:56,328 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {431#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {402#true} [129] #Ultimate.meminitEXIT-->L20-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_#Ultimate.meminit_#productInParam_1| (* v_main_~n~0_10 4)) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc6.base_4|) (= v_main_~n~0_10 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc6.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|)) InVars {main_#t~malloc6.base=|v_main_#t~malloc6.base_4|, main_~n~0=v_main_~n~0_10, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_4|} OutVars{#Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|} AuxVars[] AssignedVars[#Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, main_#t~malloc6.base, main_~n~0, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset, main_#t~malloc6.offset] {414#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc6.base|))} is VALID [2022-04-27 17:08:56,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {414#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc6.base|))} [98] L20-1-->L35-2: Formula: (and (= |v_main_#t~malloc6.offset_3| v_main_~a~0.offset_3) (= v_main_~a~0.base_3 |v_main_#t~malloc6.base_3|) (= (+ (- 1) v_main_~n~0_8) v_main_~y~0_1) (= v_main_~x~0_3 0)) InVars {main_~n~0=v_main_~n~0_8, main_#t~malloc6.base=|v_main_#t~malloc6.base_3|, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_3|} OutVars{main_~x~0=v_main_~x~0_3, main_~a~0.base=v_main_~a~0.base_3, main_~y~0=v_main_~y~0_1, main_~n~0=v_main_~n~0_8, main_#t~malloc6.base=|v_main_#t~malloc6.base_3|, main_~a~0.offset=v_main_~a~0.offset_3, main_#t~malloc6.offset=|v_main_#t~malloc6.offset_3|} AuxVars[] AssignedVars[main_~x~0, main_~a~0.base, main_~y~0, main_~a~0.offset] {415#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-27 17:08:56,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {415#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} [102] L35-2-->L25-2: Formula: (not (< v_main_~x~0_4 v_main_~y~0_2)) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_2} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[] {415#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-27 17:08:56,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {415#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} [105] L25-2-->L42: Formula: (and (= v_main_~i~0_1 |v_main_#t~nondet11_2|) (<= 0 (+ |v_main_#t~nondet11_2| 2147483648)) (<= |v_main_#t~nondet11_2| 2147483647)) InVars {main_#t~nondet11=|v_main_#t~nondet11_2|} OutVars{main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_~i~0, main_#t~nondet11] {415#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-27 17:08:56,330 INFO L272 TraceCheckUtils]: 19: Hoare triple {415#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} [109] L42-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (< v_main_~i~0_11 v_main_~n~0_11) (<= 0 v_main_~i~0_11)) 1 0)) InVars {main_~i~0=v_main_~i~0_11, main_~n~0=v_main_~n~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~i~0, main_~n~0, assume_abort_if_not_#in~cond] {402#true} is VALID [2022-04-27 17:08:56,330 INFO L290 TraceCheckUtils]: 20: Hoare triple {402#true} [94] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {402#true} is VALID [2022-04-27 17:08:56,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {402#true} [97] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {402#true} is VALID [2022-04-27 17:08:56,331 INFO L290 TraceCheckUtils]: 22: Hoare triple {402#true} [100] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {402#true} is VALID [2022-04-27 17:08:56,331 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {402#true} {415#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} [128] assume_abort_if_notEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (< v_main_~i~0_11 v_main_~n~0_11) (<= 0 v_main_~i~0_11)) 1 0)) InVars {main_~i~0=v_main_~i~0_11, main_~n~0=v_main_~n~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~i~0, main_~n~0, assume_abort_if_not_#in~cond] {415#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-27 17:08:56,332 INFO L290 TraceCheckUtils]: 24: Hoare triple {415#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} [108] L42-1-->L43: Formula: (let ((.cse0 (select |v_#memory_int_1| v_main_~a~0.base_1))) (and (= |v_main_#t~mem13_1| (select .cse0 (+ (* v_main_~x~0_1 4) v_main_~a~0.offset_1))) (= |v_main_#t~mem12_1| (select .cse0 (+ v_main_~a~0.offset_1 (* v_main_~i~0_5 4)))))) InVars {main_~a~0.base=v_main_~a~0.base_1, #memory_int=|v_#memory_int_1|, main_~i~0=v_main_~i~0_5, main_~x~0=v_main_~x~0_1, main_~a~0.offset=v_main_~a~0.offset_1} OutVars{main_#t~mem12=|v_main_#t~mem12_1|, main_#t~mem13=|v_main_#t~mem13_1|, main_~x~0=v_main_~x~0_1, main_~a~0.base=v_main_~a~0.base_1, #memory_int=|v_#memory_int_1|, main_~i~0=v_main_~i~0_5, main_~a~0.offset=v_main_~a~0.offset_1} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13] {420#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= |main_#t~mem13| 0))} is VALID [2022-04-27 17:08:56,332 INFO L272 TraceCheckUtils]: 25: Hoare triple {420#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= |main_#t~mem13| 0))} [110] L43-->__VERIFIER_assertENTRY: Formula: (= (ite (<= |v_main_#t~mem12_4| |v_main_#t~mem13_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond] {402#true} is VALID [2022-04-27 17:08:56,332 INFO L290 TraceCheckUtils]: 26: Hoare triple {402#true} [112] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {402#true} is VALID [2022-04-27 17:08:56,333 INFO L290 TraceCheckUtils]: 27: Hoare triple {402#true} [117] L11-->L11-3: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {402#true} is VALID [2022-04-27 17:08:56,333 INFO L290 TraceCheckUtils]: 28: Hoare triple {402#true} [122] L11-3-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {402#true} is VALID [2022-04-27 17:08:56,334 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {402#true} {420#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= |main_#t~mem13| 0))} [130] __VERIFIER_assertEXIT-->L43-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= |v_main_#t~mem12_4| |v_main_#t~mem13_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~mem12=|v_main_#t~mem12_4|, main_#t~mem13=|v_main_#t~mem13_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, __VERIFIER_assert_#in~cond] {415#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-27 17:08:56,334 INFO L290 TraceCheckUtils]: 30: Hoare triple {415#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} [111] L43-1-->L45-3: Formula: (= v_main_~i~0_6 0) InVars {} OutVars{main_#t~mem12=|v_main_#t~mem12_3|, main_~i~0=v_main_~i~0_6, main_#t~mem13=|v_main_#t~mem13_3|} AuxVars[] AssignedVars[main_#t~mem12, main_#t~mem13, main_~i~0] {425#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~i~0 4))) 0) (<= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~x~0 4)))))} is VALID [2022-04-27 17:08:56,335 INFO L290 TraceCheckUtils]: 31: Hoare triple {425#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~i~0 4))) 0) (<= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~x~0 4)))))} [115] L45-3-->L46: Formula: (let ((.cse0 (select |v_#memory_int_4| v_main_~a~0.base_2))) (and (= (select .cse0 (+ v_main_~a~0.offset_2 (* v_main_~i~0_8 4))) |v_main_#t~mem15_1|) (< v_main_~i~0_8 v_main_~n~0_7) (= |v_main_#t~mem16_1| (select .cse0 (+ v_main_~a~0.offset_2 (* v_main_~x~0_2 4)))))) InVars {main_~x~0=v_main_~x~0_2, main_~a~0.base=v_main_~a~0.base_2, #memory_int=|v_#memory_int_4|, main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_7, main_~a~0.offset=v_main_~a~0.offset_2} OutVars{main_#t~mem15=|v_main_#t~mem15_1|, main_~x~0=v_main_~x~0_2, main_~a~0.base=v_main_~a~0.base_2, #memory_int=|v_#memory_int_4|, main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_7, main_#t~mem16=|v_main_#t~mem16_1|, main_~a~0.offset=v_main_~a~0.offset_2} AuxVars[] AssignedVars[main_#t~mem15, main_#t~mem16] {426#(and (= |main_#t~mem15| 0) (<= 0 |main_#t~mem16|))} is VALID [2022-04-27 17:08:56,336 INFO L272 TraceCheckUtils]: 32: Hoare triple {426#(and (= |main_#t~mem15| 0) (<= 0 |main_#t~mem16|))} [119] L46-->__VERIFIER_assertENTRY: Formula: (= (ite (<= |v_main_#t~mem15_4| |v_main_#t~mem16_4|) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_#t~mem16=|v_main_#t~mem16_4|, main_#t~mem15=|v_main_#t~mem15_4|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~mem15, main_#t~mem16] {427#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 17:08:56,337 INFO L290 TraceCheckUtils]: 33: Hoare triple {427#(not (= |__VERIFIER_assert_#in~cond| 0))} [112] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {428#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 17:08:56,339 INFO L290 TraceCheckUtils]: 34: Hoare triple {428#(not (= __VERIFIER_assert_~cond 0))} [116] L11-->L11-1: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {403#false} is VALID [2022-04-27 17:08:56,339 INFO L290 TraceCheckUtils]: 35: Hoare triple {403#false} [120] L11-1-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {403#false} is VALID [2022-04-27 17:08:56,339 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 17:08:56,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 17:08:56,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758356091] [2022-04-27 17:08:56,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758356091] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 17:08:56,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 17:08:56,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-27 17:08:56,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151308397] [2022-04-27 17:08:56,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 17:08:56,341 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-27 17:08:56,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 17:08:56,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 17:08:56,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:08:56,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 17:08:56,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 17:08:56,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 17:08:56,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-04-27 17:08:56,372 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 17:08:57,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:08:57,123 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-27 17:08:57,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 17:08:57,127 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-27 17:08:57,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 17:08:57,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 17:08:57,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 40 transitions. [2022-04-27 17:08:57,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 17:08:57,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 40 transitions. [2022-04-27 17:08:57,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 40 transitions. [2022-04-27 17:08:57,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 17:08:57,177 INFO L225 Difference]: With dead ends: 36 [2022-04-27 17:08:57,177 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 17:08:57,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-04-27 17:08:57,179 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 61 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 17:08:57,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 40 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 17:08:57,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 17:08:57,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 17:08:57,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 17:08:57,180 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second 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-04-27 17:08:57,180 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second 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-04-27 17:08:57,181 INFO L87 Difference]: Start difference. First operand 0 states. Second 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-04-27 17:08:57,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:08:57,181 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 17:08:57,181 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 17:08:57,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:08:57,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:08:57,181 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 0 states. [2022-04-27 17:08:57,181 INFO L87 Difference]: Start difference. First 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) Second operand 0 states. [2022-04-27 17:08:57,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 17:08:57,181 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 17:08:57,182 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 17:08:57,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:08:57,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 17:08:57,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 17:08:57,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 17:08:57,182 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-04-27 17:08:57,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 17:08:57,182 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2022-04-27 17:08:57,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 17:08:57,182 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 17:08:57,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 17:08:57,183 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 17:08:57,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 17:08:57,185 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 17:08:57,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 17:08:57,188 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 17:08:57,189 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 17:08:57,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 05:08:57 BasicIcfg [2022-04-27 17:08:57,192 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 17:08:57,193 INFO L158 Benchmark]: Toolchain (without parser) took 3773.71ms. Allocated memory was 184.5MB in the beginning and 254.8MB in the end (delta: 70.3MB). Free memory was 126.3MB in the beginning and 89.8MB in the end (delta: 36.5MB). Peak memory consumption was 107.4MB. Max. memory is 8.0GB. [2022-04-27 17:08:57,193 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 184.5MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 17:08:57,194 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.74ms. Allocated memory was 184.5MB in the beginning and 254.8MB in the end (delta: 70.3MB). Free memory was 126.1MB in the beginning and 227.0MB in the end (delta: -100.9MB). Peak memory consumption was 17.0MB. Max. memory is 8.0GB. [2022-04-27 17:08:57,194 INFO L158 Benchmark]: Boogie Preprocessor took 44.96ms. Allocated memory is still 254.8MB. Free memory was 227.0MB in the beginning and 225.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 17:08:57,195 INFO L158 Benchmark]: RCFGBuilder took 349.38ms. Allocated memory is still 254.8MB. Free memory was 224.9MB in the beginning and 210.7MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-27 17:08:57,195 INFO L158 Benchmark]: IcfgTransformer took 53.37ms. Allocated memory is still 254.8MB. Free memory was 210.7MB in the beginning and 208.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 17:08:57,195 INFO L158 Benchmark]: TraceAbstraction took 3030.95ms. Allocated memory is still 254.8MB. Free memory was 208.2MB in the beginning and 89.8MB in the end (delta: 118.4MB). Peak memory consumption was 119.3MB. Max. memory is 8.0GB. [2022-04-27 17:08:57,197 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 184.5MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 285.74ms. Allocated memory was 184.5MB in the beginning and 254.8MB in the end (delta: 70.3MB). Free memory was 126.1MB in the beginning and 227.0MB in the end (delta: -100.9MB). Peak memory consumption was 17.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.96ms. Allocated memory is still 254.8MB. Free memory was 227.0MB in the beginning and 225.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 349.38ms. Allocated memory is still 254.8MB. Free memory was 224.9MB in the beginning and 210.7MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * IcfgTransformer took 53.37ms. Allocated memory is still 254.8MB. Free memory was 210.7MB in the beginning and 208.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 3030.95ms. Allocated memory is still 254.8MB. Free memory was 208.2MB in the beginning and 89.8MB in the end (delta: 118.4MB). Peak memory consumption was 119.3MB. Max. memory is 8.0GB. * 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: 11]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 173 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 170 mSDsluCounter, 115 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 496 IncrementalHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 87 mSDtfsCounter, 496 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 279 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 14/14 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 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-27 17:08:57,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...