/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-e106359-m [2022-04-14 20:08:15,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 20:08:15,826 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 20:08:15,870 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 20:08:15,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 20:08:15,872 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 20:08:15,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 20:08:15,877 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 20:08:15,879 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 20:08:15,883 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 20:08:15,884 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 20:08:15,885 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 20:08:15,885 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 20:08:15,888 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 20:08:15,888 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 20:08:15,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 20:08:15,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 20:08:15,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 20:08:15,896 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 20:08:15,901 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 20:08:15,903 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 20:08:15,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 20:08:15,905 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 20:08:15,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 20:08:15,907 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 20:08:15,913 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 20:08:15,913 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 20:08:15,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 20:08:15,914 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 20:08:15,914 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 20:08:15,916 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 20:08:15,916 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 20:08:15,917 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 20:08:15,918 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 20:08:15,918 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 20:08:15,919 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 20:08:15,919 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 20:08:15,920 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 20:08:15,920 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 20:08:15,920 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 20:08:15,921 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 20:08:15,923 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 20:08:15,923 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 20:08:15,934 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 20:08:15,934 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 20:08:15,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 20:08:15,935 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 20:08:15,936 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 20:08:15,936 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 20:08:15,936 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 20:08:15,936 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 20:08:15,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 20:08:15,937 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 20:08:15,937 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 20:08:15,937 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 20:08:15,937 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 20:08:15,938 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 20:08:15,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 20:08:15,938 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 20:08:15,938 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 20:08:15,938 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 20:08:15,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 20:08:15,939 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 20:08:15,939 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 20:08:15,939 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 20:08:15,940 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-14 20:08:16,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 20:08:16,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 20:08:16,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 20:08:16,230 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 20:08:16,231 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 20:08:16,232 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-14 20:08:16,285 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28ccedcb1/46957f9df0d4469cb829814162aa59e2/FLAGda97b09e0 [2022-04-14 20:08:16,655 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 20:08:16,656 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max.c [2022-04-14 20:08:16,663 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28ccedcb1/46957f9df0d4469cb829814162aa59e2/FLAGda97b09e0 [2022-04-14 20:08:17,067 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28ccedcb1/46957f9df0d4469cb829814162aa59e2 [2022-04-14 20:08:17,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 20:08:17,079 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 20:08:17,088 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 20:08:17,088 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 20:08:17,091 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 20:08:17,092 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 08:08:17" (1/1) ... [2022-04-14 20:08:17,094 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@537a37c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:17, skipping insertion in model container [2022-04-14 20:08:17,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 08:08:17" (1/1) ... [2022-04-14 20:08:17,100 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 20:08:17,115 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 20:08:17,247 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-14 20:08:17,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 20:08:17,272 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 20:08:17,282 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-14 20:08:17,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 20:08:17,304 INFO L208 MainTranslator]: Completed translation [2022-04-14 20:08:17,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:17 WrapperNode [2022-04-14 20:08:17,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 20:08:17,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 20:08:17,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 20:08:17,307 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 20:08:17,316 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:17" (1/1) ... [2022-04-14 20:08:17,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:17" (1/1) ... [2022-04-14 20:08:17,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:17" (1/1) ... [2022-04-14 20:08:17,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:17" (1/1) ... [2022-04-14 20:08:17,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:17" (1/1) ... [2022-04-14 20:08:17,349 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:17" (1/1) ... [2022-04-14 20:08:17,350 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:17" (1/1) ... [2022-04-14 20:08:17,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 20:08:17,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 20:08:17,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 20:08:17,353 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 20:08:17,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:17" (1/1) ... [2022-04-14 20:08:17,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 20:08:17,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:08:17,384 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-14 20:08:17,397 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-14 20:08:17,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 20:08:17,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 20:08:17,431 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 20:08:17,431 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 20:08:17,431 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 20:08:17,432 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 20:08:17,432 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-14 20:08:17,432 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-14 20:08:17,432 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-04-14 20:08:17,432 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 20:08:17,432 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 20:08:17,432 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 20:08:17,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 20:08:17,433 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 20:08:17,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 20:08:17,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 20:08:17,435 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 20:08:17,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-14 20:08:17,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-14 20:08:17,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 20:08:17,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 20:08:17,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 20:08:17,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 20:08:17,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 20:08:17,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 20:08:17,521 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 20:08:17,522 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 20:08:17,761 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 20:08:17,767 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 20:08:17,767 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-14 20:08:17,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 08:08:17 BoogieIcfgContainer [2022-04-14 20:08:17,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 20:08:17,770 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 20:08:17,770 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 20:08:17,770 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 20:08:17,773 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 08:08:17" (1/1) ... [2022-04-14 20:08:17,775 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 20:08:17,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 08:08:17 BasicIcfg [2022-04-14 20:08:17,800 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 20:08:17,802 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 20:08:17,802 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 20:08:17,804 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 20:08:17,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 08:08:17" (1/4) ... [2022-04-14 20:08:17,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1024e32d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 08:08:17, skipping insertion in model container [2022-04-14 20:08:17,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:08:17" (2/4) ... [2022-04-14 20:08:17,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1024e32d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 08:08:17, skipping insertion in model container [2022-04-14 20:08:17,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 08:08:17" (3/4) ... [2022-04-14 20:08:17,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1024e32d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 08:08:17, skipping insertion in model container [2022-04-14 20:08:17,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 08:08:17" (4/4) ... [2022-04-14 20:08:17,807 INFO L111 eAbstractionObserver]: Analyzing ICFG elimination_max.cJordan [2022-04-14 20:08:17,811 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 20:08:17,812 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 20:08:17,848 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 20:08:17,854 INFO L340 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 [2022-04-14 20:08:17,854 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 20:08:17,876 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-14 20:08:17,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-14 20:08:17,882 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:08:17,883 INFO L499 BasicCegarLoop]: 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-14 20:08:17,884 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:08:17,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:08:17,893 INFO L85 PathProgramCache]: Analyzing trace with hash 64952803, now seen corresponding path program 1 times [2022-04-14 20:08:17,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:08:17,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020767964] [2022-04-14 20:08:17,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:08:17,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:08:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:18,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:08:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:18,054 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-14 20:08:18,054 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-14 20:08:18,054 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-14 20:08:18,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 20:08:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:18,062 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-14 20:08:18,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [96] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-14 20:08:18,063 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-14 20:08:18,064 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-14 20:08:18,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-14 20:08:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:18,077 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-14 20:08:18,077 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-14 20:08:18,077 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-14 20:08:18,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-14 20:08:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:18,085 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-14 20:08:18,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [96] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-14 20:08:18,086 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-14 20:08:18,086 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-14 20:08:18,087 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-14 20:08:18,088 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-14 20:08:18,088 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-14 20:08:18,088 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-14 20:08:18,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-14 20:08:18,089 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-14 20:08:18,089 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-14 20:08:18,090 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-14 20:08:18,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} [96] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-14 20:08:18,090 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-14 20:08:18,091 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-14 20:08:18,091 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-14 20:08:18,091 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-14 20:08:18,092 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-14 20:08:18,092 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-14 20:08:18,092 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-14 20:08:18,093 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-14 20:08:18,093 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-14 20:08:18,093 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-14 20:08:18,093 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-14 20:08:18,094 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-14 20:08:18,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {42#true} [96] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-14 20:08:18,094 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-14 20:08:18,095 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-14 20:08:18,095 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-14 20:08:18,095 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-14 20:08:18,096 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-14 20:08:18,096 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-14 20:08:18,096 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-14 20:08:18,097 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-14 20:08:18,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:08:18,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020767964] [2022-04-14 20:08:18,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020767964] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 20:08:18,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 20:08:18,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 20:08:18,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280980583] [2022-04-14 20:08:18,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:08:18,105 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-14 20:08:18,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:08:18,109 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-14 20:08:18,140 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-14 20:08:18,140 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 20:08:18,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:08:18,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 20:08:18,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 20:08:18,161 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-14 20:08:18,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:18,432 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-14 20:08:18,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 20:08:18,434 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-14 20:08:18,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:08:18,436 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-14 20:08:18,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-14 20:08:18,452 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-14 20:08:18,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-14 20:08:18,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-14 20:08:18,523 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-14 20:08:18,534 INFO L225 Difference]: With dead ends: 39 [2022-04-14 20:08:18,535 INFO L226 Difference]: Without dead ends: 34 [2022-04-14 20:08:18,536 INFO L912 BasicCegarLoop]: 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-14 20:08:18,539 INFO L913 BasicCegarLoop]: 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-14 20:08:18,540 INFO L914 BasicCegarLoop]: 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-14 20:08:18,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-14 20:08:18,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-14 20:08:18,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:08:18,565 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-14 20:08:18,566 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-14 20:08:18,566 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-14 20:08:18,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:18,571 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-14 20:08:18,571 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-14 20:08:18,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:08:18,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:08:18,572 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-14 20:08:18,573 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-14 20:08:18,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:18,577 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-14 20:08:18,577 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-14 20:08:18,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:08:18,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:08:18,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:08:18,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:08:18,579 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-14 20:08:18,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-14 20:08:18,582 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 29 [2022-04-14 20:08:18,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:08:18,583 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-14 20:08:18,583 INFO L479 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-14 20:08:18,583 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-14 20:08:18,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-14 20:08:18,584 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:08:18,584 INFO L499 BasicCegarLoop]: 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-14 20:08:18,584 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 20:08:18,585 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:08:18,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:08:18,586 INFO L85 PathProgramCache]: Analyzing trace with hash -2146770526, now seen corresponding path program 1 times [2022-04-14 20:08:18,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:08:18,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630496084] [2022-04-14 20:08:18,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:08:18,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:08:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:18,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:08:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:18,766 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-14 20:08:18,766 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-14 20:08:18,766 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-14 20:08:18,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 20:08:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:18,772 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-14 20:08:18,773 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-14 20:08:18,773 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-14 20:08:18,773 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-14 20:08:18,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-14 20:08:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:18,802 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-14 20:08:18,802 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-14 20:08:18,803 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-14 20:08:18,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-14 20:08:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:18,812 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-14 20:08:18,813 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-14 20:08:18,813 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-14 20:08:18,814 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-14 20:08:18,815 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-14 20:08:18,815 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-14 20:08:18,815 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-14 20:08:18,815 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-14 20:08:18,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {206#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#true} is VALID [2022-04-14 20:08:18,816 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-14 20:08:18,816 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-14 20:08:18,816 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-14 20:08:18,816 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-14 20:08:18,817 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-14 20:08:18,817 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-14 20:08:18,817 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-14 20:08:18,818 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-14 20:08:18,819 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-14 20:08:18,820 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-14 20:08:18,821 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-14 20:08:18,821 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-14 20:08:18,822 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-14 20:08:18,823 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-14 20:08:18,823 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-14 20:08:18,823 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-14 20:08:18,824 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-14 20:08:18,824 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-14 20:08:18,825 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-14 20:08:18,826 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-14 20:08:18,826 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-14 20:08:18,827 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-14 20:08:18,828 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-14 20:08:18,828 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-14 20:08:18,828 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-14 20:08:18,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:08:18,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630496084] [2022-04-14 20:08:18,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630496084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 20:08:18,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 20:08:18,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-14 20:08:18,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221236893] [2022-04-14 20:08:18,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:08:18,831 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-14 20:08:18,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:08:18,831 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-14 20:08:18,857 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-14 20:08:18,858 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-14 20:08:18,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:08:18,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-14 20:08:18,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-04-14 20:08:18,859 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-14 20:08:19,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:19,563 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-14 20:08:19,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-14 20:08:19,565 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-14 20:08:19,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:08:19,566 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-14 20:08:19,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2022-04-14 20:08:19,573 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-14 20:08:19,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2022-04-14 20:08:19,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 42 transitions. [2022-04-14 20:08:19,625 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-14 20:08:19,626 INFO L225 Difference]: With dead ends: 38 [2022-04-14 20:08:19,626 INFO L226 Difference]: Without dead ends: 38 [2022-04-14 20:08:19,627 INFO L912 BasicCegarLoop]: 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-14 20:08:19,629 INFO L913 BasicCegarLoop]: 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-14 20:08:19,630 INFO L914 BasicCegarLoop]: 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-14 20:08:19,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-14 20:08:19,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-14 20:08:19,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:08:19,634 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-14 20:08:19,634 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-14 20:08:19,634 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-14 20:08:19,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:19,637 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-14 20:08:19,637 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-14 20:08:19,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:08:19,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:08:19,638 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-14 20:08:19,638 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-14 20:08:19,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:19,641 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-14 20:08:19,641 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-14 20:08:19,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:08:19,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:08:19,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:08:19,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:08:19,642 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-14 20:08:19,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-14 20:08:19,648 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 29 [2022-04-14 20:08:19,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:08:19,648 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-14 20:08:19,649 INFO L479 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-14 20:08:19,649 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-14 20:08:19,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-14 20:08:19,657 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:08:19,657 INFO L499 BasicCegarLoop]: 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-14 20:08:19,657 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 20:08:19,657 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:08:19,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:08:19,658 INFO L85 PathProgramCache]: Analyzing trace with hash -359953696, now seen corresponding path program 1 times [2022-04-14 20:08:19,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:08:19,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147403998] [2022-04-14 20:08:19,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:08:19,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:08:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:19,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:08:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:19,820 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-14 20:08:19,820 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-14 20:08:19,821 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-14 20:08:19,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 20:08:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:19,825 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-14 20:08:19,826 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-14 20:08:19,826 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-14 20:08:19,826 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-14 20:08:19,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-14 20:08:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:19,850 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-14 20:08:19,850 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-14 20:08:19,851 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-14 20:08:19,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-14 20:08:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:19,862 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-14 20:08:19,862 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-14 20:08:19,863 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-14 20:08:19,863 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-14 20:08:19,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-14 20:08:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:08:19,874 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-14 20:08:19,874 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-14 20:08:19,874 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-14 20:08:19,878 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-14 20:08:19,879 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-14 20:08:19,879 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-14 20:08:19,879 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-14 20:08:19,879 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-14 20:08:19,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {402#true} [87] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {402#true} is VALID [2022-04-14 20:08:19,880 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-14 20:08:19,880 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-14 20:08:19,880 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-14 20:08:19,880 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-14 20:08:19,880 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-14 20:08:19,880 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-14 20:08:19,881 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-14 20:08:19,883 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-14 20:08:19,884 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-14 20:08:19,886 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-14 20:08:19,895 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-14 20:08:19,896 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-14 20:08:19,896 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-14 20:08:19,897 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-14 20:08:19,897 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-14 20:08:19,897 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-14 20:08:19,898 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-14 20:08:19,898 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-14 20:08:19,899 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-14 20:08:19,899 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-14 20:08:19,899 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-14 20:08:19,900 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-14 20:08:19,900 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-14 20:08:19,900 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-14 20:08:19,901 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-14 20:08:19,901 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-14 20:08:19,902 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-14 20:08:19,903 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-14 20:08:19,904 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-14 20:08:19,907 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-14 20:08:19,907 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-14 20:08:19,907 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-14 20:08:19,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:08:19,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147403998] [2022-04-14 20:08:19,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147403998] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 20:08:19,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 20:08:19,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-14 20:08:19,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038744285] [2022-04-14 20:08:19,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:08:19,909 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-14 20:08:19,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:08:19,909 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-14 20:08:19,935 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-14 20:08:19,936 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-14 20:08:19,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:08:19,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-14 20:08:19,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-04-14 20:08:19,937 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-14 20:08:20,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:20,669 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-14 20:08:20,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-14 20:08:20,669 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-14 20:08:20,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:08:20,670 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-14 20:08:20,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 40 transitions. [2022-04-14 20:08:20,672 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-14 20:08:20,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 40 transitions. [2022-04-14 20:08:20,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 40 transitions. [2022-04-14 20:08:20,717 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-14 20:08:20,718 INFO L225 Difference]: With dead ends: 36 [2022-04-14 20:08:20,718 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 20:08:20,718 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2022-04-14 20:08:20,719 INFO L913 BasicCegarLoop]: 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-14 20:08:20,719 INFO L914 BasicCegarLoop]: 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-14 20:08:20,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 20:08:20,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 20:08:20,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:08:20,720 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-14 20:08:20,720 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-14 20:08:20,721 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-14 20:08:20,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:20,721 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 20:08:20,721 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 20:08:20,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:08:20,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:08:20,721 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-14 20:08:20,721 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-14 20:08:20,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:08:20,721 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 20:08:20,721 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 20:08:20,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:08:20,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:08:20,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:08:20,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:08:20,722 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-14 20:08:20,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 20:08:20,722 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2022-04-14 20:08:20,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:08:20,722 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 20:08:20,722 INFO L479 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-14 20:08:20,723 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 20:08:20,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:08:20,725 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 20:08:20,725 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-14 20:08:20,728 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-14 20:08:20,729 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 20:08:20,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 08:08:20 BasicIcfg [2022-04-14 20:08:20,732 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 20:08:20,733 INFO L158 Benchmark]: Toolchain (without parser) took 3653.54ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 162.5MB in the beginning and 134.4MB in the end (delta: 28.1MB). Peak memory consumption was 65.6MB. Max. memory is 8.0GB. [2022-04-14 20:08:20,733 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 186.6MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 20:08:20,733 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.68ms. Allocated memory is still 186.6MB. Free memory was 162.3MB in the beginning and 157.7MB in the end (delta: 4.6MB). Peak memory consumption was 8.9MB. Max. memory is 8.0GB. [2022-04-14 20:08:20,734 INFO L158 Benchmark]: Boogie Preprocessor took 46.40ms. Allocated memory is still 186.6MB. Free memory was 157.7MB in the beginning and 155.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 20:08:20,734 INFO L158 Benchmark]: RCFGBuilder took 415.84ms. Allocated memory is still 186.6MB. Free memory was 155.9MB in the beginning and 142.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-14 20:08:20,734 INFO L158 Benchmark]: IcfgTransformer took 30.86ms. Allocated memory is still 186.6MB. Free memory was 142.3MB in the beginning and 140.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 20:08:20,734 INFO L158 Benchmark]: TraceAbstraction took 2930.14ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 139.8MB in the beginning and 134.4MB in the end (delta: 5.4MB). Peak memory consumption was 43.1MB. Max. memory is 8.0GB. [2022-04-14 20:08:20,736 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.16ms. Allocated memory is still 186.6MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 217.68ms. Allocated memory is still 186.6MB. Free memory was 162.3MB in the beginning and 157.7MB in the end (delta: 4.6MB). Peak memory consumption was 8.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.40ms. Allocated memory is still 186.6MB. Free memory was 157.7MB in the beginning and 155.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 415.84ms. Allocated memory is still 186.6MB. Free memory was 155.9MB in the beginning and 142.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 30.86ms. Allocated memory is still 186.6MB. Free memory was 142.3MB in the beginning and 140.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 2930.14ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 139.8MB in the beginning and 134.4MB in the end (delta: 5.4MB). Peak memory consumption was 43.1MB. 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: 2.9s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 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.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s 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-14 20:08:20,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...