/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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/verifythis/elimination_max.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:45:08,271 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:45:08,273 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:45:08,326 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:45:08,326 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:45:08,327 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:45:08,331 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:45:08,333 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:45:08,335 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:45:08,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:45:08,338 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:45:08,339 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:45:08,339 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:45:08,341 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:45:08,342 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:45:08,342 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:45:08,343 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:45:08,343 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:45:08,346 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:45:08,354 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:45:08,355 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:45:08,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:45:08,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:45:08,361 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:45:08,362 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:45:08,363 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:45:08,363 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:45:08,364 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:45:08,364 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:45:08,364 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:45:08,367 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:45:08,368 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:45:08,369 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:45:08,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:45:08,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:45:08,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:45:08,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:45:08,370 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:45:08,370 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:45:08,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:45:08,371 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:45:08,372 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:45:08,373 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 11:45:08,397 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:45:08,397 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:45:08,398 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:45:08,398 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:45:08,398 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:45:08,398 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:45:08,399 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:45:08,399 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:45:08,399 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:45:08,399 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:45:08,399 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:45:08,400 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:45:08,400 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:45:08,400 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:45:08,400 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:45:08,400 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:45:08,400 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:45:08,401 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:45:08,401 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:45:08,401 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:45:08,401 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:45:08,401 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:45:08,401 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:45:08,401 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:45:08,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:45:08,401 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:45:08,402 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:45:08,402 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:45:08,402 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:45:08,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:45:08,402 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:45:08,402 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:45:08,402 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:45:08,402 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 11:45:08,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:45:08,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:45:08,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:45:08,612 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:45:08,613 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:45:08,614 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/elimination_max.c [2022-04-27 11:45:08,667 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e8e5c8f3/71e04d99b1f74b2e83cf0b29933c8c06/FLAG090822ff4 [2022-04-27 11:45:09,044 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:45:09,044 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max.c [2022-04-27 11:45:09,048 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e8e5c8f3/71e04d99b1f74b2e83cf0b29933c8c06/FLAG090822ff4 [2022-04-27 11:45:09,057 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e8e5c8f3/71e04d99b1f74b2e83cf0b29933c8c06 [2022-04-27 11:45:09,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:45:09,060 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:45:09,062 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:45:09,062 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:45:09,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:45:09,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:45:09" (1/1) ... [2022-04-27 11:45:09,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6957b8b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:09, skipping insertion in model container [2022-04-27 11:45:09,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:45:09" (1/1) ... [2022-04-27 11:45:09,072 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:45:09,082 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:45:09,191 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max.c[485,498] [2022-04-27 11:45:09,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:45:09,217 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:45:09,225 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max.c[485,498] [2022-04-27 11:45:09,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:45:09,240 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:45:09,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:09 WrapperNode [2022-04-27 11:45:09,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:45:09,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:45:09,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:45:09,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:45:09,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:09" (1/1) ... [2022-04-27 11:45:09,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:09" (1/1) ... [2022-04-27 11:45:09,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:09" (1/1) ... [2022-04-27 11:45:09,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:09" (1/1) ... [2022-04-27 11:45:09,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:09" (1/1) ... [2022-04-27 11:45:09,263 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:09" (1/1) ... [2022-04-27 11:45:09,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:09" (1/1) ... [2022-04-27 11:45:09,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:45:09,266 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:45:09,266 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:45:09,266 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:45:09,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:09" (1/1) ... [2022-04-27 11:45:09,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:45:09,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:45:09,291 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 11:45:09,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 11:45:09,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:45:09,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:45:09,320 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:45:09,320 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 11:45:09,321 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:45:09,321 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:45:09,321 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-27 11:45:09,321 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-27 11:45:09,321 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-04-27 11:45:09,321 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:45:09,321 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:45:09,321 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:45:09,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:45:09,321 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 11:45:09,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:45:09,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 11:45:09,321 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:45:09,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-27 11:45:09,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-27 11:45:09,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:45:09,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:45:09,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:45:09,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:45:09,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:45:09,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:45:09,390 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:45:09,392 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:45:09,604 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:45:09,609 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:45:09,609 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 11:45:09,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:45:09 BoogieIcfgContainer [2022-04-27 11:45:09,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:45:09,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:45:09,612 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:45:09,621 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:45:09,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:45:09" (1/3) ... [2022-04-27 11:45:09,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d0b990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:45:09, skipping insertion in model container [2022-04-27 11:45:09,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:09" (2/3) ... [2022-04-27 11:45:09,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d0b990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:45:09, skipping insertion in model container [2022-04-27 11:45:09,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:45:09" (3/3) ... [2022-04-27 11:45:09,623 INFO L111 eAbstractionObserver]: Analyzing ICFG elimination_max.c [2022-04-27 11:45:09,631 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:45:09,632 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:45:09,690 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:45:09,695 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6f721970, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4c0db444 [2022-04-27 11:45:09,695 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:45:09,701 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 11:45:09,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 11:45:09,706 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:45:09,706 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:45:09,707 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:45:09,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:45:09,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1951153279, now seen corresponding path program 1 times [2022-04-27 11:45:09,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:45:09,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397153847] [2022-04-27 11:45:09,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:09,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:45:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:09,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:45:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:09,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {42#true} is VALID [2022-04-27 11:45:09,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-27 11:45:09,890 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #83#return; {42#true} is VALID [2022-04-27 11:45:09,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:45:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:09,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 11:45:09,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 11:45:09,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 11:45:09,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #73#return; {43#false} is VALID [2022-04-27 11:45:09,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 11:45:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:09,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {59#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {42#true} is VALID [2022-04-27 11:45:09,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-27 11:45:09,924 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {43#false} #75#return; {43#false} is VALID [2022-04-27 11:45:09,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-27 11:45:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:09,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 11:45:09,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 11:45:09,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 11:45:09,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #77#return; {43#false} is VALID [2022-04-27 11:45:09,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:45:09,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {42#true} is VALID [2022-04-27 11:45:09,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-27 11:45:09,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #83#return; {42#true} is VALID [2022-04-27 11:45:09,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret17 := main(); {42#true} is VALID [2022-04-27 11:45:09,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~n~0 := #t~nondet5;havoc #t~nondet5; {42#true} is VALID [2022-04-27 11:45:09,934 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {42#true} is VALID [2022-04-27 11:45:09,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 11:45:09,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 11:45:09,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 11:45:09,935 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #73#return; {43#false} is VALID [2022-04-27 11:45:09,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {43#false} call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4 * ~n~0); {43#false} is VALID [2022-04-27 11:45:09,935 INFO L272 TraceCheckUtils]: 12: Hoare triple {43#false} call #Ultimate.meminit(#t~malloc6.base, #t~malloc6.offset, ~n~0, 4, 4 * ~n~0); {59#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:09,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {59#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {42#true} is VALID [2022-04-27 11:45:09,936 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-27 11:45:09,936 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {42#true} {43#false} #75#return; {43#false} is VALID [2022-04-27 11:45:09,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} ~a~0.base, ~a~0.offset := #t~malloc6.base, #t~malloc6.offset;~x~0 := 0;~y~0 := ~n~0 - 1; {43#false} is VALID [2022-04-27 11:45:09,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#false} assume !(~x~0 < ~y~0); {43#false} is VALID [2022-04-27 11:45:09,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {43#false} havoc ~i~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~i~0 := #t~nondet11;havoc #t~nondet11; {43#false} is VALID [2022-04-27 11:45:09,936 INFO L272 TraceCheckUtils]: 19: Hoare triple {43#false} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n~0 then 1 else 0)); {42#true} is VALID [2022-04-27 11:45:09,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 11:45:09,937 INFO L290 TraceCheckUtils]: 21: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 11:45:09,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 11:45:09,937 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {43#false} {43#false} #77#return; {43#false} is VALID [2022-04-27 11:45:09,937 INFO L290 TraceCheckUtils]: 24: Hoare triple {43#false} call #t~mem12 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call #t~mem13 := read~int(~a~0.base, ~a~0.offset + 4 * ~x~0, 4); {43#false} is VALID [2022-04-27 11:45:09,937 INFO L272 TraceCheckUtils]: 25: Hoare triple {43#false} call __VERIFIER_assert((if #t~mem12 <= #t~mem13 then 1 else 0)); {43#false} is VALID [2022-04-27 11:45:09,937 INFO L290 TraceCheckUtils]: 26: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-27 11:45:09,938 INFO L290 TraceCheckUtils]: 27: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-27 11:45:09,938 INFO L290 TraceCheckUtils]: 28: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-27 11:45:09,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:45:09,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:45:09,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397153847] [2022-04-27 11:45:09,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397153847] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:45:09,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:45:09,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 11:45:09,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873498672] [2022-04-27 11:45:09,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:45:09,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-27 11:45:09,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:45:09,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 11:45:09,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:09,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:45:09,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:45:10,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:45:10,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 11:45:10,008 INFO L87 Difference]: Start difference. First operand has 39 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 11:45:10,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:10,249 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2022-04-27 11:45:10,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:45:10,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-27 11:45:10,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:45:10,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 11:45:10,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-04-27 11:45:10,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 11:45:10,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-04-27 11:45:10,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 90 transitions. [2022-04-27 11:45:10,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:10,364 INFO L225 Difference]: With dead ends: 71 [2022-04-27 11:45:10,364 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 11:45:10,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:45:10,371 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 36 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:45:10,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 38 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:45:10,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 11:45:10,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-27 11:45:10,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:45:10,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 11:45:10,395 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 11:45:10,396 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 11:45:10,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:10,400 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 11:45:10,400 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 11:45:10,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:10,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:10,402 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-27 11:45:10,402 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-27 11:45:10,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:10,407 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 11:45:10,407 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 11:45:10,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:10,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:10,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:45:10,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:45:10,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 11:45:10,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-27 11:45:10,411 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 29 [2022-04-27 11:45:10,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:45:10,411 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-27 11:45:10,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 11:45:10,412 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 11:45:10,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 11:45:10,412 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:45:10,413 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:45:10,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:45:10,413 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:45:10,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:45:10,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1957169217, now seen corresponding path program 1 times [2022-04-27 11:45:10,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:45:10,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029542544] [2022-04-27 11:45:10,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:10,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:45:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:10,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:45:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:10,551 INFO L290 TraceCheckUtils]: 0: Hoare triple {297#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {275#true} is VALID [2022-04-27 11:45:10,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 11:45:10,552 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {275#true} {275#true} #83#return; {275#true} is VALID [2022-04-27 11:45:10,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:45:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:10,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {275#true} ~cond := #in~cond; {275#true} is VALID [2022-04-27 11:45:10,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#true} assume !(0 == ~cond); {275#true} is VALID [2022-04-27 11:45:10,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 11:45:10,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {275#true} {275#true} #73#return; {275#true} is VALID [2022-04-27 11:45:10,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 11:45:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:10,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {298#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {299#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 11:45:10,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {299#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {299#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 11:45:10,596 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {299#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {275#true} #75#return; {287#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc6.base|))} is VALID [2022-04-27 11:45:10,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-27 11:45:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:10,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {275#true} ~cond := #in~cond; {275#true} is VALID [2022-04-27 11:45:10,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#true} assume !(0 == ~cond); {275#true} is VALID [2022-04-27 11:45:10,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 11:45:10,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {275#true} {289#(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))} #77#return; {289#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~x~0 4))) 0) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~i~0 4))) 0))} is VALID [2022-04-27 11:45:10,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {275#true} call ULTIMATE.init(); {297#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:45:10,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {297#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {275#true} is VALID [2022-04-27 11:45:10,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 11:45:10,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {275#true} {275#true} #83#return; {275#true} is VALID [2022-04-27 11:45:10,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {275#true} call #t~ret17 := main(); {275#true} is VALID [2022-04-27 11:45:10,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {275#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~n~0 := #t~nondet5;havoc #t~nondet5; {275#true} is VALID [2022-04-27 11:45:10,616 INFO L272 TraceCheckUtils]: 6: Hoare triple {275#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {275#true} is VALID [2022-04-27 11:45:10,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {275#true} ~cond := #in~cond; {275#true} is VALID [2022-04-27 11:45:10,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {275#true} assume !(0 == ~cond); {275#true} is VALID [2022-04-27 11:45:10,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 11:45:10,616 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {275#true} {275#true} #73#return; {275#true} is VALID [2022-04-27 11:45:10,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {275#true} call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4 * ~n~0); {275#true} is VALID [2022-04-27 11:45:10,617 INFO L272 TraceCheckUtils]: 12: Hoare triple {275#true} call #Ultimate.meminit(#t~malloc6.base, #t~malloc6.offset, ~n~0, 4, 4 * ~n~0); {298#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:10,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {298#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {299#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 11:45:10,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {299#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {299#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 11:45:10,620 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {299#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {275#true} #75#return; {287#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc6.base|))} is VALID [2022-04-27 11:45:10,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {287#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc6.base|))} ~a~0.base, ~a~0.offset := #t~malloc6.base, #t~malloc6.offset;~x~0 := 0;~y~0 := ~n~0 - 1; {288#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-27 11:45:10,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {288#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} assume !(~x~0 < ~y~0); {288#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-27 11:45:10,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {288#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} havoc ~i~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~i~0 := #t~nondet11;havoc #t~nondet11; {289#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~x~0 4))) 0) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~i~0 4))) 0))} is VALID [2022-04-27 11:45:10,622 INFO L272 TraceCheckUtils]: 19: Hoare triple {289#(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))} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n~0 then 1 else 0)); {275#true} is VALID [2022-04-27 11:45:10,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {275#true} ~cond := #in~cond; {275#true} is VALID [2022-04-27 11:45:10,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {275#true} assume !(0 == ~cond); {275#true} is VALID [2022-04-27 11:45:10,622 INFO L290 TraceCheckUtils]: 22: Hoare triple {275#true} assume true; {275#true} is VALID [2022-04-27 11:45:10,623 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {275#true} {289#(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))} #77#return; {289#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~x~0 4))) 0) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~i~0 4))) 0))} is VALID [2022-04-27 11:45:10,630 INFO L290 TraceCheckUtils]: 24: Hoare triple {289#(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))} call #t~mem12 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call #t~mem13 := read~int(~a~0.base, ~a~0.offset + 4 * ~x~0, 4); {294#(and (= |main_#t~mem12| 0) (= |main_#t~mem13| 0))} is VALID [2022-04-27 11:45:10,633 INFO L272 TraceCheckUtils]: 25: Hoare triple {294#(and (= |main_#t~mem12| 0) (= |main_#t~mem13| 0))} call __VERIFIER_assert((if #t~mem12 <= #t~mem13 then 1 else 0)); {295#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:45:10,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {295#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {296#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:45:10,633 INFO L290 TraceCheckUtils]: 27: Hoare triple {296#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {276#false} is VALID [2022-04-27 11:45:10,634 INFO L290 TraceCheckUtils]: 28: Hoare triple {276#false} assume !false; {276#false} is VALID [2022-04-27 11:45:10,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:45:10,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:45:10,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029542544] [2022-04-27 11:45:10,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029542544] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:45:10,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:45:10,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-27 11:45:10,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428412298] [2022-04-27 11:45:10,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:45:10,637 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-27 11:45:10,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:45:10,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 11:45:10,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:10,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 11:45:10,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:45:10,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 11:45:10,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-04-27 11:45:10,664 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 11:45:11,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:11,244 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-27 11:45:11,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 11:45:11,245 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-27 11:45:11,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:45:11,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 11:45:11,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 43 transitions. [2022-04-27 11:45:11,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 11:45:11,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 43 transitions. [2022-04-27 11:45:11,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 43 transitions. [2022-04-27 11:45:11,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:11,285 INFO L225 Difference]: With dead ends: 40 [2022-04-27 11:45:11,285 INFO L226 Difference]: Without dead ends: 38 [2022-04-27 11:45:11,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2022-04-27 11:45:11,286 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 73 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:45:11,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 37 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:45:11,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-27 11:45:11,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-27 11:45:11,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:45:11,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 11:45:11,291 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 11:45:11,291 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 11:45:11,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:11,292 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-27 11:45:11,292 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-27 11:45:11,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:11,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:11,293 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 38 states. [2022-04-27 11:45:11,293 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 38 states. [2022-04-27 11:45:11,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:11,295 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-27 11:45:11,295 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-27 11:45:11,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:11,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:11,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:45:11,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:45:11,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 11:45:11,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-27 11:45:11,297 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 29 [2022-04-27 11:45:11,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:45:11,297 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-27 11:45:11,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 11:45:11,297 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-27 11:45:11,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 11:45:11,298 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:45:11,298 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:45:11,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 11:45:11,298 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:45:11,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:45:11,299 INFO L85 PathProgramCache]: Analyzing trace with hash -718145150, now seen corresponding path program 1 times [2022-04-27 11:45:11,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:45:11,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398307195] [2022-04-27 11:45:11,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:11,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:45:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:11,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:45:11,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:11,448 INFO L290 TraceCheckUtils]: 0: Hoare triple {530#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {503#true} is VALID [2022-04-27 11:45:11,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {503#true} assume true; {503#true} is VALID [2022-04-27 11:45:11,448 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {503#true} {503#true} #83#return; {503#true} is VALID [2022-04-27 11:45:11,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:45:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:11,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {503#true} ~cond := #in~cond; {503#true} is VALID [2022-04-27 11:45:11,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {503#true} assume !(0 == ~cond); {503#true} is VALID [2022-04-27 11:45:11,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {503#true} assume true; {503#true} is VALID [2022-04-27 11:45:11,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {503#true} {503#true} #73#return; {503#true} is VALID [2022-04-27 11:45:11,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 11:45:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:11,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {531#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {532#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 11:45:11,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {532#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {532#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 11:45:11,482 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {532#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {503#true} #75#return; {515#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc6.base|))} is VALID [2022-04-27 11:45:11,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-27 11:45:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:11,504 INFO L290 TraceCheckUtils]: 0: Hoare triple {503#true} ~cond := #in~cond; {503#true} is VALID [2022-04-27 11:45:11,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {503#true} assume !(0 == ~cond); {503#true} is VALID [2022-04-27 11:45:11,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {503#true} assume true; {503#true} is VALID [2022-04-27 11:45:11,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {503#true} {516#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} #77#return; {516#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-27 11:45:11,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-27 11:45:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:11,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {503#true} ~cond := #in~cond; {503#true} is VALID [2022-04-27 11:45:11,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {503#true} assume !(0 == ~cond); {503#true} is VALID [2022-04-27 11:45:11,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {503#true} assume true; {503#true} is VALID [2022-04-27 11:45:11,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {503#true} {521#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= |main_#t~mem13| 0))} #79#return; {516#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-27 11:45:11,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {503#true} call ULTIMATE.init(); {530#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:45:11,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {530#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {503#true} is VALID [2022-04-27 11:45:11,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {503#true} assume true; {503#true} is VALID [2022-04-27 11:45:11,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {503#true} {503#true} #83#return; {503#true} is VALID [2022-04-27 11:45:11,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {503#true} call #t~ret17 := main(); {503#true} is VALID [2022-04-27 11:45:11,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {503#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~n~0 := #t~nondet5;havoc #t~nondet5; {503#true} is VALID [2022-04-27 11:45:11,514 INFO L272 TraceCheckUtils]: 6: Hoare triple {503#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {503#true} is VALID [2022-04-27 11:45:11,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {503#true} ~cond := #in~cond; {503#true} is VALID [2022-04-27 11:45:11,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {503#true} assume !(0 == ~cond); {503#true} is VALID [2022-04-27 11:45:11,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {503#true} assume true; {503#true} is VALID [2022-04-27 11:45:11,514 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {503#true} {503#true} #73#return; {503#true} is VALID [2022-04-27 11:45:11,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {503#true} call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(4 * ~n~0); {503#true} is VALID [2022-04-27 11:45:11,515 INFO L272 TraceCheckUtils]: 12: Hoare triple {503#true} call #Ultimate.meminit(#t~malloc6.base, #t~malloc6.offset, ~n~0, 4, 4 * ~n~0); {531#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:11,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {531#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {532#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 11:45:11,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {532#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {532#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 11:45:11,517 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {532#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {503#true} #75#return; {515#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc6.base|))} is VALID [2022-04-27 11:45:11,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {515#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc6.base|))} ~a~0.base, ~a~0.offset := #t~malloc6.base, #t~malloc6.offset;~x~0 := 0;~y~0 := ~n~0 - 1; {516#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-27 11:45:11,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {516#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} assume !(~x~0 < ~y~0); {516#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-27 11:45:11,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {516#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} havoc ~i~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~i~0 := #t~nondet11;havoc #t~nondet11; {516#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-27 11:45:11,518 INFO L272 TraceCheckUtils]: 19: Hoare triple {516#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n~0 then 1 else 0)); {503#true} is VALID [2022-04-27 11:45:11,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {503#true} ~cond := #in~cond; {503#true} is VALID [2022-04-27 11:45:11,518 INFO L290 TraceCheckUtils]: 21: Hoare triple {503#true} assume !(0 == ~cond); {503#true} is VALID [2022-04-27 11:45:11,518 INFO L290 TraceCheckUtils]: 22: Hoare triple {503#true} assume true; {503#true} is VALID [2022-04-27 11:45:11,519 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {503#true} {516#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} #77#return; {516#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-27 11:45:11,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {516#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} call #t~mem12 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call #t~mem13 := read~int(~a~0.base, ~a~0.offset + 4 * ~x~0, 4); {521#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= |main_#t~mem13| 0))} is VALID [2022-04-27 11:45:11,519 INFO L272 TraceCheckUtils]: 25: Hoare triple {521#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= |main_#t~mem13| 0))} call __VERIFIER_assert((if #t~mem12 <= #t~mem13 then 1 else 0)); {503#true} is VALID [2022-04-27 11:45:11,520 INFO L290 TraceCheckUtils]: 26: Hoare triple {503#true} ~cond := #in~cond; {503#true} is VALID [2022-04-27 11:45:11,520 INFO L290 TraceCheckUtils]: 27: Hoare triple {503#true} assume !(0 == ~cond); {503#true} is VALID [2022-04-27 11:45:11,520 INFO L290 TraceCheckUtils]: 28: Hoare triple {503#true} assume true; {503#true} is VALID [2022-04-27 11:45:11,520 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {503#true} {521#(and (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) (= |main_#t~mem13| 0))} #79#return; {516#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-27 11:45:11,521 INFO L290 TraceCheckUtils]: 30: Hoare triple {516#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} havoc #t~mem12;havoc #t~mem13;~i~0 := 0; {526#(and (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~i~0 4))) 0) (<= 0 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* main_~x~0 4)))))} is VALID [2022-04-27 11:45:11,521 INFO L290 TraceCheckUtils]: 31: Hoare triple {526#(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)))))} assume !!(~i~0 < ~n~0);call #t~mem15 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call #t~mem16 := read~int(~a~0.base, ~a~0.offset + 4 * ~x~0, 4); {527#(and (= |main_#t~mem15| 0) (<= 0 |main_#t~mem16|))} is VALID [2022-04-27 11:45:11,522 INFO L272 TraceCheckUtils]: 32: Hoare triple {527#(and (= |main_#t~mem15| 0) (<= 0 |main_#t~mem16|))} call __VERIFIER_assert((if #t~mem15 <= #t~mem16 then 1 else 0)); {528#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:45:11,522 INFO L290 TraceCheckUtils]: 33: Hoare triple {528#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {529#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:45:11,523 INFO L290 TraceCheckUtils]: 34: Hoare triple {529#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {504#false} is VALID [2022-04-27 11:45:11,523 INFO L290 TraceCheckUtils]: 35: Hoare triple {504#false} assume !false; {504#false} is VALID [2022-04-27 11:45:11,523 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:45:11,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:45:11,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398307195] [2022-04-27 11:45:11,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398307195] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:45:11,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:45:11,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-27 11:45:11,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687960638] [2022-04-27 11:45:11,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:45:11,524 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-27 11:45:11,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:45:11,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 11:45:11,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:11,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 11:45:11,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:45:11,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 11:45:11,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-04-27 11:45:11,548 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 11:45:12,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:12,093 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-27 11:45:12,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 11:45:12,094 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-27 11:45:12,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:45:12,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 11:45:12,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2022-04-27 11:45:12,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 11:45:12,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2022-04-27 11:45:12,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 41 transitions. [2022-04-27 11:45:12,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:12,132 INFO L225 Difference]: With dead ends: 38 [2022-04-27 11:45:12,132 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 11:45:12,132 INFO L412 NwaCegarLoop]: 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-27 11:45:12,133 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 54 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 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.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:45:12,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 40 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:45:12,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 11:45:12,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 11:45:12,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:45:12,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:45:12,134 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:45:12,134 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:45:12,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:12,134 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:45:12,134 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:45:12,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:12,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:12,135 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 11:45:12,135 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 11:45:12,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:12,135 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:45:12,135 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:45:12,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:12,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:12,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:45:12,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:45:12,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:45:12,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 11:45:12,135 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2022-04-27 11:45:12,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:45:12,135 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 11:45:12,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 11:45:12,135 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:45:12,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:12,137 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 11:45:12,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 11:45:12,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 11:45:12,213 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-27 11:45:12,213 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-27 11:45:12,213 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-27 11:45:12,213 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 7 9) the Hoare annotation is: true [2022-04-27 11:45:12,213 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2022-04-27 11:45:12,213 INFO L899 garLoopResultBuilder]: For program point L8-2(lines 7 9) no Hoare annotation was computed. [2022-04-27 11:45:12,213 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 7 9) no Hoare annotation was computed. [2022-04-27 11:45:12,214 INFO L895 garLoopResultBuilder]: At program point L35-2(lines 25 37) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc6.base|)))) [2022-04-27 11:45:12,214 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 16 51) no Hoare annotation was computed. [2022-04-27 11:45:12,214 INFO L899 garLoopResultBuilder]: For program point L25-2(lines 25 37) no Hoare annotation was computed. [2022-04-27 11:45:12,214 INFO L895 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-04-27 11:45:12,214 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2022-04-27 11:45:12,214 INFO L895 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= |main_#t~mem15| 0) (= .cse0 (select |#memory_int| |main_#t~malloc6.base|)) (<= 0 |main_#t~mem16|))) [2022-04-27 11:45:12,214 INFO L899 garLoopResultBuilder]: For program point L46-1(line 46) no Hoare annotation was computed. [2022-04-27 11:45:12,214 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 16 51) no Hoare annotation was computed. [2022-04-27 11:45:12,214 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc6.base|)))) [2022-04-27 11:45:12,214 INFO L899 garLoopResultBuilder]: For program point L42-1(line 42) no Hoare annotation was computed. [2022-04-27 11:45:12,214 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 16 51) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-04-27 11:45:12,214 INFO L895 garLoopResultBuilder]: At program point L20(line 20) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-04-27 11:45:12,214 INFO L899 garLoopResultBuilder]: For program point L20-1(line 20) no Hoare annotation was computed. [2022-04-27 11:45:12,214 INFO L895 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= |main_#t~mem12| 0) (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc6.base|)) (= |main_#t~mem13| 0))) [2022-04-27 11:45:12,215 INFO L899 garLoopResultBuilder]: For program point L45-2(lines 45 47) no Hoare annotation was computed. [2022-04-27 11:45:12,215 INFO L899 garLoopResultBuilder]: For program point L43-1(line 43) no Hoare annotation was computed. [2022-04-27 11:45:12,215 INFO L895 garLoopResultBuilder]: At program point L45-3(lines 45 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc6.base|)))) [2022-04-27 11:45:12,215 INFO L899 garLoopResultBuilder]: For program point L45-4(lines 45 47) no Hoare annotation was computed. [2022-04-27 11:45:12,215 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 36) no Hoare annotation was computed. [2022-04-27 11:45:12,215 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:45:12,215 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 11:45:12,215 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:45:12,215 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:45:12,215 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 11:45:12,215 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 11:45:12,215 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:45:12,215 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 10 12) the Hoare annotation is: true [2022-04-27 11:45:12,215 INFO L899 garLoopResultBuilder]: For program point L11(line 11) no Hoare annotation was computed. [2022-04-27 11:45:12,215 INFO L899 garLoopResultBuilder]: For program point L11-1(line 11) no Hoare annotation was computed. [2022-04-27 11:45:12,215 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 10 12) no Hoare annotation was computed. [2022-04-27 11:45:12,215 INFO L899 garLoopResultBuilder]: For program point L11-3(lines 10 12) no Hoare annotation was computed. [2022-04-27 11:45:12,216 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2022-04-27 11:45:12,216 INFO L895 garLoopResultBuilder]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-04-27 11:45:12,216 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:45:12,216 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:45:12,218 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 11:45:12,219 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 11:45:12,221 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 11:45:12,221 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:45:12,221 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 11:45:12,222 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 11:45:12,222 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-27 11:45:12,222 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 11:45:12,222 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:45:12,222 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:45:12,222 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 11:45:12,222 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 11:45:12,222 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-04-27 11:45:12,222 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 11:45:12,222 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 11:45:12,222 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-27 11:45:12,223 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 11:45:12,223 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:45:12,223 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-04-27 11:45:12,223 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-04-27 11:45:12,223 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2022-04-27 11:45:12,223 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2022-04-27 11:45:12,223 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2022-04-27 11:45:12,223 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-27 11:45:12,223 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 11:45:12,223 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 11:45:12,223 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-04-27 11:45:12,224 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:45:12,224 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:45:12,224 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-04-27 11:45:12,224 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-04-27 11:45:12,224 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2022-04-27 11:45:12,224 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-27 11:45:12,224 WARN L170 areAnnotationChecker]: L25-2 has no Hoare annotation [2022-04-27 11:45:12,224 WARN L170 areAnnotationChecker]: L25-2 has no Hoare annotation [2022-04-27 11:45:12,224 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 11:45:12,224 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2022-04-27 11:45:12,224 WARN L170 areAnnotationChecker]: L45-4 has no Hoare annotation [2022-04-27 11:45:12,224 WARN L170 areAnnotationChecker]: L45-4 has no Hoare annotation [2022-04-27 11:45:12,224 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2022-04-27 11:45:12,224 WARN L170 areAnnotationChecker]: L25-2 has no Hoare annotation [2022-04-27 11:45:12,225 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 11:45:12,225 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 11:45:12,225 WARN L170 areAnnotationChecker]: L45-4 has no Hoare annotation [2022-04-27 11:45:12,225 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-27 11:45:12,225 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-04-27 11:45:12,225 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 11:45:12,225 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 11:45:12,225 INFO L163 areAnnotationChecker]: CFG has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 11:45:12,227 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:262) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:449) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-27 11:45:12,229 INFO L158 Benchmark]: Toolchain (without parser) took 3169.21ms. Allocated memory was 188.7MB in the beginning and 245.4MB in the end (delta: 56.6MB). Free memory was 137.8MB in the beginning and 214.9MB in the end (delta: -77.1MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 11:45:12,232 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 188.7MB. Free memory is still 154.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 11:45:12,232 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.87ms. Allocated memory is still 188.7MB. Free memory was 137.6MB in the beginning and 163.1MB in the end (delta: -25.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 11:45:12,233 INFO L158 Benchmark]: Boogie Preprocessor took 23.87ms. Allocated memory is still 188.7MB. Free memory was 163.1MB in the beginning and 161.6MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-27 11:45:12,233 INFO L158 Benchmark]: RCFGBuilder took 345.00ms. Allocated memory is still 188.7MB. Free memory was 161.6MB in the beginning and 147.9MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-27 11:45:12,233 INFO L158 Benchmark]: TraceAbstraction took 2616.76ms. Allocated memory was 188.7MB in the beginning and 245.4MB in the end (delta: 56.6MB). Free memory was 147.4MB in the beginning and 214.9MB in the end (delta: -67.5MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 11:45:12,234 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.35ms. Allocated memory is still 188.7MB. Free memory is still 154.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 178.87ms. Allocated memory is still 188.7MB. Free memory was 137.6MB in the beginning and 163.1MB in the end (delta: -25.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.87ms. Allocated memory is still 188.7MB. Free memory was 163.1MB in the beginning and 161.6MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 345.00ms. Allocated memory is still 188.7MB. Free memory was 161.6MB in the beginning and 147.9MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 2616.76ms. Allocated memory was 188.7MB in the beginning and 245.4MB in the end (delta: 56.6MB). Free memory was 147.4MB in the beginning and 214.9MB in the end (delta: -67.5MB). There was no memory consumed. 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 7 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 166 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 163 mSDsluCounter, 115 SdHoareTripleChecker+Invalid, 0.5s 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: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 20 PreInvPairs, 26 NumberOfFragments, 100 HoareAnnotationTreeSize, 20 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, 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 - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-27 11:45:12,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...