/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/loop-acceleration/array_3-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:30:39,356 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:30:39,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:30:39,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:30:39,385 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:30:39,386 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:30:39,387 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:30:39,388 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:30:39,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:30:39,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:30:39,390 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:30:39,391 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:30:39,392 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:30:39,392 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:30:39,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:30:39,394 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:30:39,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:30:39,395 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:30:39,396 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:30:39,397 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:30:39,398 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:30:39,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:30:39,400 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:30:39,400 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:30:39,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:30:39,403 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:30:39,403 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:30:39,403 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:30:39,404 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:30:39,404 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:30:39,405 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:30:39,405 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:30:39,406 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:30:39,406 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:30:39,407 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:30:39,407 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:30:39,407 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:30:39,408 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:30:39,408 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:30:39,408 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:30:39,409 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:30:39,410 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:30:39,410 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 10:30:39,427 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:30:39,428 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:30:39,428 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:30:39,428 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:30:39,429 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:30:39,429 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:30:39,429 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:30:39,429 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:30:39,429 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:30:39,430 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:30:39,430 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:30:39,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:30:39,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:30:39,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:30:39,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:30:39,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:30:39,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:30:39,431 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:30:39,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:30:39,431 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:30:39,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:30:39,432 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:30:39,432 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:30:39,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:30:39,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:30:39,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:30:39,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:30:39,433 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:30:39,433 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:30:39,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:30:39,433 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:30:39,433 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:30:39,433 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:30:39,433 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 10:30:39,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:30:39,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:30:39,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:30:39,636 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:30:39,637 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:30:39,638 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_3-1.i [2022-04-27 10:30:39,695 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acb215bde/326cff5102c641868969136284881187/FLAG16fd54836 [2022-04-27 10:30:40,081 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:30:40,082 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_3-1.i [2022-04-27 10:30:40,086 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acb215bde/326cff5102c641868969136284881187/FLAG16fd54836 [2022-04-27 10:30:40,107 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acb215bde/326cff5102c641868969136284881187 [2022-04-27 10:30:40,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:30:40,110 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:30:40,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:30:40,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:30:40,114 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:30:40,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:30:40" (1/1) ... [2022-04-27 10:30:40,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16920b4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:30:40, skipping insertion in model container [2022-04-27 10:30:40,116 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:30:40" (1/1) ... [2022-04-27 10:30:40,120 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:30:40,128 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:30:40,248 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_3-1.i[849,862] [2022-04-27 10:30:40,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:30:40,272 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:30:40,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_3-1.i[849,862] [2022-04-27 10:30:40,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:30:40,293 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:30:40,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:30:40 WrapperNode [2022-04-27 10:30:40,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:30:40,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:30:40,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:30:40,294 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:30:40,301 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:30:40" (1/1) ... [2022-04-27 10:30:40,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:30:40" (1/1) ... [2022-04-27 10:30:40,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:30:40" (1/1) ... [2022-04-27 10:30:40,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:30:40" (1/1) ... [2022-04-27 10:30:40,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:30:40" (1/1) ... [2022-04-27 10:30:40,312 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:30:40" (1/1) ... [2022-04-27 10:30:40,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:30:40" (1/1) ... [2022-04-27 10:30:40,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:30:40,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:30:40,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:30:40,314 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:30:40,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:30:40" (1/1) ... [2022-04-27 10:30:40,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:30:40,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:30:40,338 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 10:30:40,355 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 10:30:40,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:30:40,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:30:40,368 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:30:40,369 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:30:40,370 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:30:40,370 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:30:40,370 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:30:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:30:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:30:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:30:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:30:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:30:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:30:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:30:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 10:30:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:30:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:30:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:30:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:30:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:30:40,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:30:40,415 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:30:40,416 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:30:40,510 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:30:40,514 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:30:40,514 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 10:30:40,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:30:40 BoogieIcfgContainer [2022-04-27 10:30:40,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:30:40,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:30:40,517 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:30:40,533 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:30:40,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:30:40" (1/3) ... [2022-04-27 10:30:40,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72811d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:30:40, skipping insertion in model container [2022-04-27 10:30:40,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:30:40" (2/3) ... [2022-04-27 10:30:40,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72811d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:30:40, skipping insertion in model container [2022-04-27 10:30:40,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:30:40" (3/3) ... [2022-04-27 10:30:40,536 INFO L111 eAbstractionObserver]: Analyzing ICFG array_3-1.i [2022-04-27 10:30:40,545 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:30:40,545 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:30:40,574 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:30:40,579 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@5a7ee400, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@56729063 [2022-04-27 10:30:40,579 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:30:40,585 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:30:40,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 10:30:40,589 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:30:40,590 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:30:40,590 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:30:40,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:30:40,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1037683284, now seen corresponding path program 1 times [2022-04-27 10:30:40,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:30:40,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832904545] [2022-04-27 10:30:40,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:30:40,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:30:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:40,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:30:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:40,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(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(12, 2); {28#true} is VALID [2022-04-27 10:30:40,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-27 10:30:40,736 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #63#return; {28#true} is VALID [2022-04-27 10:30:40,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:30:40,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(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(12, 2); {28#true} is VALID [2022-04-27 10:30:40,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-27 10:30:40,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #63#return; {28#true} is VALID [2022-04-27 10:30:40,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret5 := main(); {28#true} is VALID [2022-04-27 10:30:40,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {28#true} is VALID [2022-04-27 10:30:40,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-04-27 10:30:40,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#false} ~i~0 := 0; {29#false} is VALID [2022-04-27 10:30:40,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#false} assume !true; {29#false} is VALID [2022-04-27 10:30:40,740 INFO L272 TraceCheckUtils]: 9: Hoare triple {29#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {29#false} is VALID [2022-04-27 10:30:40,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-27 10:30:40,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-27 10:30:40,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-27 10:30:40,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:30:40,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:30:40,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832904545] [2022-04-27 10:30:40,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832904545] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:30:40,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:30:40,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:30:40,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239044174] [2022-04-27 10:30:40,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:30:40,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 10:30:40,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:30:40,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:40,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:30:40,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:30:40,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:30:40,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:30:40,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:30:40,789 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:40,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:40,862 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-27 10:30:40,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:30:40,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 10:30:40,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:30:40,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:40,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-04-27 10:30:40,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:40,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-04-27 10:30:40,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 51 transitions. [2022-04-27 10:30:40,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:30:40,939 INFO L225 Difference]: With dead ends: 42 [2022-04-27 10:30:40,939 INFO L226 Difference]: Without dead ends: 18 [2022-04-27 10:30:40,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:30:40,948 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:30:40,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:30:40,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-27 10:30:40,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-27 10:30:40,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:30:40,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:40,977 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:40,977 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:40,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:40,989 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-27 10:30:40,989 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-27 10:30:40,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:30:40,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:30:40,990 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-27 10:30:40,991 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-27 10:30:40,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:40,993 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-27 10:30:40,993 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-27 10:30:40,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:30:40,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:30:40,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:30:40,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:30:40,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:40,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-27 10:30:40,999 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2022-04-27 10:30:40,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:30:41,000 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-27 10:30:41,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:41,003 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-27 10:30:41,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 10:30:41,003 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:30:41,003 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:30:41,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:30:41,003 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:30:41,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:30:41,004 INFO L85 PathProgramCache]: Analyzing trace with hash -193552662, now seen corresponding path program 1 times [2022-04-27 10:30:41,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:30:41,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199763836] [2022-04-27 10:30:41,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:30:41,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:30:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:41,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:30:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:41,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {157#(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(12, 2); {151#true} is VALID [2022-04-27 10:30:41,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#true} assume true; {151#true} is VALID [2022-04-27 10:30:41,067 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {151#true} {151#true} #63#return; {151#true} is VALID [2022-04-27 10:30:41,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {151#true} call ULTIMATE.init(); {157#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:30:41,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#(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(12, 2); {151#true} is VALID [2022-04-27 10:30:41,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {151#true} assume true; {151#true} is VALID [2022-04-27 10:30:41,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151#true} {151#true} #63#return; {151#true} is VALID [2022-04-27 10:30:41,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {151#true} call #t~ret5 := main(); {151#true} is VALID [2022-04-27 10:30:41,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {151#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {156#(= main_~i~0 0)} is VALID [2022-04-27 10:30:41,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {156#(= main_~i~0 0)} assume !(~i~0 < 1024); {152#false} is VALID [2022-04-27 10:30:41,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {152#false} ~i~0 := 0; {152#false} is VALID [2022-04-27 10:30:41,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {152#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {152#false} is VALID [2022-04-27 10:30:41,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {152#false} assume !(0 != #t~mem4);havoc #t~mem4; {152#false} is VALID [2022-04-27 10:30:41,070 INFO L272 TraceCheckUtils]: 10: Hoare triple {152#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {152#false} is VALID [2022-04-27 10:30:41,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {152#false} ~cond := #in~cond; {152#false} is VALID [2022-04-27 10:30:41,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {152#false} assume 0 == ~cond; {152#false} is VALID [2022-04-27 10:30:41,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {152#false} assume !false; {152#false} is VALID [2022-04-27 10:30:41,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:30:41,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:30:41,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199763836] [2022-04-27 10:30:41,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199763836] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:30:41,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:30:41,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:30:41,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316386438] [2022-04-27 10:30:41,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:30:41,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 10:30:41,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:30:41,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:41,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:30:41,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:30:41,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:30:41,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:30:41,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:30:41,085 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:41,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:41,172 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-27 10:30:41,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:30:41,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 10:30:41,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:30:41,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:41,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-27 10:30:41,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:41,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-27 10:30:41,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2022-04-27 10:30:41,229 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 10:30:41,233 INFO L225 Difference]: With dead ends: 35 [2022-04-27 10:30:41,233 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 10:30:41,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 10:30:41,236 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 24 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:30:41,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 22 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:30:41,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 10:30:41,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-04-27 10:30:41,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:30:41,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:41,241 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:41,241 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:41,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:41,242 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 10:30:41,242 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 10:30:41,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:30:41,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:30:41,243 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-27 10:30:41,251 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-27 10:30:41,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:41,253 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-27 10:30:41,253 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 10:30:41,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:30:41,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:30:41,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:30:41,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:30:41,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:41,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-04-27 10:30:41,258 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2022-04-27 10:30:41,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:30:41,259 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-04-27 10:30:41,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:41,260 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-27 10:30:41,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 10:30:41,260 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:30:41,260 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:30:41,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:30:41,261 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:30:41,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:30:41,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1156315956, now seen corresponding path program 1 times [2022-04-27 10:30:41,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:30:41,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073736535] [2022-04-27 10:30:41,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:30:41,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:30:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:41,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:30:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:41,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {300#(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(12, 2); {293#true} is VALID [2022-04-27 10:30:41,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {293#true} assume true; {293#true} is VALID [2022-04-27 10:30:41,342 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {293#true} {293#true} #63#return; {293#true} is VALID [2022-04-27 10:30:41,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {293#true} call ULTIMATE.init(); {300#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:30:41,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {300#(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(12, 2); {293#true} is VALID [2022-04-27 10:30:41,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {293#true} assume true; {293#true} is VALID [2022-04-27 10:30:41,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {293#true} {293#true} #63#return; {293#true} is VALID [2022-04-27 10:30:41,344 INFO L272 TraceCheckUtils]: 4: Hoare triple {293#true} call #t~ret5 := main(); {293#true} is VALID [2022-04-27 10:30:41,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {293#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {298#(= main_~i~0 0)} is VALID [2022-04-27 10:30:41,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {298#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {298#(= main_~i~0 0)} is VALID [2022-04-27 10:30:41,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {298#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {299#(<= main_~i~0 1)} is VALID [2022-04-27 10:30:41,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {299#(<= main_~i~0 1)} assume !(~i~0 < 1024); {294#false} is VALID [2022-04-27 10:30:41,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {294#false} ~i~0 := 0; {294#false} is VALID [2022-04-27 10:30:41,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {294#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {294#false} is VALID [2022-04-27 10:30:41,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {294#false} assume !(0 != #t~mem4);havoc #t~mem4; {294#false} is VALID [2022-04-27 10:30:41,348 INFO L272 TraceCheckUtils]: 12: Hoare triple {294#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {294#false} is VALID [2022-04-27 10:30:41,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {294#false} ~cond := #in~cond; {294#false} is VALID [2022-04-27 10:30:41,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {294#false} assume 0 == ~cond; {294#false} is VALID [2022-04-27 10:30:41,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {294#false} assume !false; {294#false} is VALID [2022-04-27 10:30:41,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:30:41,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:30:41,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073736535] [2022-04-27 10:30:41,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073736535] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:30:41,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875791029] [2022-04-27 10:30:41,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:30:41,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:30:41,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:30:41,352 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:30:41,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 10:30:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:41,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 10:30:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:41,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:30:41,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {293#true} call ULTIMATE.init(); {293#true} is VALID [2022-04-27 10:30:41,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {293#true} #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(12, 2); {293#true} is VALID [2022-04-27 10:30:41,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {293#true} assume true; {293#true} is VALID [2022-04-27 10:30:41,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {293#true} {293#true} #63#return; {293#true} is VALID [2022-04-27 10:30:41,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {293#true} call #t~ret5 := main(); {293#true} is VALID [2022-04-27 10:30:41,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {293#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {319#(<= main_~i~0 0)} is VALID [2022-04-27 10:30:41,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {319#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {319#(<= main_~i~0 0)} is VALID [2022-04-27 10:30:41,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {319#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {299#(<= main_~i~0 1)} is VALID [2022-04-27 10:30:41,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {299#(<= main_~i~0 1)} assume !(~i~0 < 1024); {294#false} is VALID [2022-04-27 10:30:41,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {294#false} ~i~0 := 0; {294#false} is VALID [2022-04-27 10:30:41,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {294#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {294#false} is VALID [2022-04-27 10:30:41,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {294#false} assume !(0 != #t~mem4);havoc #t~mem4; {294#false} is VALID [2022-04-27 10:30:41,548 INFO L272 TraceCheckUtils]: 12: Hoare triple {294#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {294#false} is VALID [2022-04-27 10:30:41,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {294#false} ~cond := #in~cond; {294#false} is VALID [2022-04-27 10:30:41,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {294#false} assume 0 == ~cond; {294#false} is VALID [2022-04-27 10:30:41,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {294#false} assume !false; {294#false} is VALID [2022-04-27 10:30:41,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:30:41,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:30:41,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {294#false} assume !false; {294#false} is VALID [2022-04-27 10:30:41,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {294#false} assume 0 == ~cond; {294#false} is VALID [2022-04-27 10:30:41,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {294#false} ~cond := #in~cond; {294#false} is VALID [2022-04-27 10:30:41,639 INFO L272 TraceCheckUtils]: 12: Hoare triple {294#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {294#false} is VALID [2022-04-27 10:30:41,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {294#false} assume !(0 != #t~mem4);havoc #t~mem4; {294#false} is VALID [2022-04-27 10:30:41,640 INFO L290 TraceCheckUtils]: 10: Hoare triple {294#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {294#false} is VALID [2022-04-27 10:30:41,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {294#false} ~i~0 := 0; {294#false} is VALID [2022-04-27 10:30:41,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {371#(< main_~i~0 1024)} assume !(~i~0 < 1024); {294#false} is VALID [2022-04-27 10:30:41,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {375#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {371#(< main_~i~0 1024)} is VALID [2022-04-27 10:30:41,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {375#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {375#(< main_~i~0 1023)} is VALID [2022-04-27 10:30:41,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {293#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {375#(< main_~i~0 1023)} is VALID [2022-04-27 10:30:41,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {293#true} call #t~ret5 := main(); {293#true} is VALID [2022-04-27 10:30:41,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {293#true} {293#true} #63#return; {293#true} is VALID [2022-04-27 10:30:41,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {293#true} assume true; {293#true} is VALID [2022-04-27 10:30:41,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {293#true} #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(12, 2); {293#true} is VALID [2022-04-27 10:30:41,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {293#true} call ULTIMATE.init(); {293#true} is VALID [2022-04-27 10:30:41,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:30:41,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875791029] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:30:41,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:30:41,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-27 10:30:41,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807472702] [2022-04-27 10:30:41,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:30:41,644 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 10:30:41,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:30:41,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:41,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:30:41,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:30:41,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:30:41,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:30:41,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:30:41,672 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:41,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:41,850 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2022-04-27 10:30:41,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:30:41,850 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 10:30:41,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:30:41,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:41,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-27 10:30:41,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:41,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-27 10:30:41,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2022-04-27 10:30:41,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:30:41,907 INFO L225 Difference]: With dead ends: 52 [2022-04-27 10:30:41,907 INFO L226 Difference]: Without dead ends: 39 [2022-04-27 10:30:41,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:30:41,911 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 57 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:30:41,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 31 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:30:41,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-27 10:30:41,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2022-04-27 10:30:41,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:30:41,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:41,928 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:41,929 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:41,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:41,934 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-27 10:30:41,934 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-04-27 10:30:41,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:30:41,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:30:41,934 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-27 10:30:41,934 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-27 10:30:41,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:41,938 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-27 10:30:41,938 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-04-27 10:30:41,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:30:41,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:30:41,940 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:30:41,940 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:30:41,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:41,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-04-27 10:30:41,944 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 16 [2022-04-27 10:30:41,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:30:41,944 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-04-27 10:30:41,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:41,945 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-27 10:30:41,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 10:30:41,948 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:30:41,949 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:30:41,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 10:30:42,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:30:42,164 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:30:42,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:30:42,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1094783858, now seen corresponding path program 2 times [2022-04-27 10:30:42,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:30:42,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885189132] [2022-04-27 10:30:42,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:30:42,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:30:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:42,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:30:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:42,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {618#(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(12, 2); {610#true} is VALID [2022-04-27 10:30:42,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {610#true} assume true; {610#true} is VALID [2022-04-27 10:30:42,278 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {610#true} {610#true} #63#return; {610#true} is VALID [2022-04-27 10:30:42,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {610#true} call ULTIMATE.init(); {618#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:30:42,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {618#(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(12, 2); {610#true} is VALID [2022-04-27 10:30:42,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {610#true} assume true; {610#true} is VALID [2022-04-27 10:30:42,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {610#true} {610#true} #63#return; {610#true} is VALID [2022-04-27 10:30:42,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {610#true} call #t~ret5 := main(); {610#true} is VALID [2022-04-27 10:30:42,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {610#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {610#true} is VALID [2022-04-27 10:30:42,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {610#true} is VALID [2022-04-27 10:30:42,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {610#true} is VALID [2022-04-27 10:30:42,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {610#true} is VALID [2022-04-27 10:30:42,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {610#true} is VALID [2022-04-27 10:30:42,279 INFO L290 TraceCheckUtils]: 10: Hoare triple {610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {610#true} is VALID [2022-04-27 10:30:42,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {610#true} is VALID [2022-04-27 10:30:42,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {610#true} is VALID [2022-04-27 10:30:42,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {610#true} is VALID [2022-04-27 10:30:42,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {610#true} assume !(~i~0 < 1024); {610#true} is VALID [2022-04-27 10:30:42,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {610#true} ~i~0 := 0; {615#(<= main_~i~0 1024)} is VALID [2022-04-27 10:30:42,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {615#(<= main_~i~0 1024)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {615#(<= main_~i~0 1024)} is VALID [2022-04-27 10:30:42,281 INFO L290 TraceCheckUtils]: 17: Hoare triple {615#(<= main_~i~0 1024)} assume !(0 != #t~mem4);havoc #t~mem4; {615#(<= main_~i~0 1024)} is VALID [2022-04-27 10:30:42,281 INFO L272 TraceCheckUtils]: 18: Hoare triple {615#(<= main_~i~0 1024)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {616#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:30:42,282 INFO L290 TraceCheckUtils]: 19: Hoare triple {616#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {617#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:30:42,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {617#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {611#false} is VALID [2022-04-27 10:30:42,282 INFO L290 TraceCheckUtils]: 21: Hoare triple {611#false} assume !false; {611#false} is VALID [2022-04-27 10:30:42,282 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 10:30:42,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:30:42,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885189132] [2022-04-27 10:30:42,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885189132] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:30:42,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:30:42,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:30:42,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757403871] [2022-04-27 10:30:42,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:30:42,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 10:30:42,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:30:42,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:42,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:30:42,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:30:42,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:30:42,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:30:42,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:30:42,295 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:42,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:42,415 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-04-27 10:30:42,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:30:42,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 10:30:42,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:30:42,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:42,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-04-27 10:30:42,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:42,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-04-27 10:30:42,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 29 transitions. [2022-04-27 10:30:42,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:30:42,452 INFO L225 Difference]: With dead ends: 41 [2022-04-27 10:30:42,453 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 10:30:42,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-27 10:30:42,454 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:30:42,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 31 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:30:42,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 10:30:42,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-27 10:30:42,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:30:42,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:42,464 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:42,464 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:42,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:42,465 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-27 10:30:42,465 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-27 10:30:42,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:30:42,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:30:42,466 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-27 10:30:42,466 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-27 10:30:42,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:42,467 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-27 10:30:42,467 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-27 10:30:42,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:30:42,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:30:42,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:30:42,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:30:42,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:42,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-04-27 10:30:42,468 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2022-04-27 10:30:42,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:30:42,469 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-04-27 10:30:42,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:42,469 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-27 10:30:42,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 10:30:42,469 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:30:42,469 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:30:42,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 10:30:42,469 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:30:42,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:30:42,470 INFO L85 PathProgramCache]: Analyzing trace with hash 606177401, now seen corresponding path program 1 times [2022-04-27 10:30:42,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:30:42,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841999686] [2022-04-27 10:30:42,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:30:42,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:30:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:42,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:30:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:42,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {818#(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(12, 2); {809#true} is VALID [2022-04-27 10:30:42,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {809#true} assume true; {809#true} is VALID [2022-04-27 10:30:42,558 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {809#true} {809#true} #63#return; {809#true} is VALID [2022-04-27 10:30:42,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {809#true} call ULTIMATE.init(); {818#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:30:42,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {818#(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(12, 2); {809#true} is VALID [2022-04-27 10:30:42,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {809#true} assume true; {809#true} is VALID [2022-04-27 10:30:42,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {809#true} {809#true} #63#return; {809#true} is VALID [2022-04-27 10:30:42,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {809#true} call #t~ret5 := main(); {809#true} is VALID [2022-04-27 10:30:42,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {809#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {809#true} is VALID [2022-04-27 10:30:42,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {809#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {809#true} is VALID [2022-04-27 10:30:42,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {809#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {809#true} is VALID [2022-04-27 10:30:42,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {809#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {809#true} is VALID [2022-04-27 10:30:42,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {809#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {809#true} is VALID [2022-04-27 10:30:42,573 INFO L290 TraceCheckUtils]: 10: Hoare triple {809#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {809#true} is VALID [2022-04-27 10:30:42,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {809#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {809#true} is VALID [2022-04-27 10:30:42,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {809#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {809#true} is VALID [2022-04-27 10:30:42,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {809#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {809#true} is VALID [2022-04-27 10:30:42,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {809#true} assume !(~i~0 < 1024); {809#true} is VALID [2022-04-27 10:30:42,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {809#true} ~i~0 := 0; {814#(= main_~i~0 0)} is VALID [2022-04-27 10:30:42,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {814#(= main_~i~0 0)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {814#(= main_~i~0 0)} is VALID [2022-04-27 10:30:42,576 INFO L290 TraceCheckUtils]: 17: Hoare triple {814#(= main_~i~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4; {814#(= main_~i~0 0)} is VALID [2022-04-27 10:30:42,577 INFO L290 TraceCheckUtils]: 18: Hoare triple {814#(= main_~i~0 0)} assume !(~i~0 >= 1023); {814#(= main_~i~0 0)} is VALID [2022-04-27 10:30:42,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {814#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {815#(<= main_~i~0 1)} is VALID [2022-04-27 10:30:42,577 INFO L290 TraceCheckUtils]: 20: Hoare triple {815#(<= main_~i~0 1)} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {815#(<= main_~i~0 1)} is VALID [2022-04-27 10:30:42,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {815#(<= main_~i~0 1)} assume !(0 != #t~mem4);havoc #t~mem4; {815#(<= main_~i~0 1)} is VALID [2022-04-27 10:30:42,578 INFO L272 TraceCheckUtils]: 22: Hoare triple {815#(<= main_~i~0 1)} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {816#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:30:42,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {816#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {817#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:30:42,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {817#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {810#false} is VALID [2022-04-27 10:30:42,579 INFO L290 TraceCheckUtils]: 25: Hoare triple {810#false} assume !false; {810#false} is VALID [2022-04-27 10:30:42,579 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 10:30:42,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:30:42,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841999686] [2022-04-27 10:30:42,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841999686] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:30:42,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901552803] [2022-04-27 10:30:42,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:30:42,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:30:42,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:30:42,581 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:30:42,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 10:30:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:42,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 10:30:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:42,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:30:42,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {809#true} call ULTIMATE.init(); {809#true} is VALID [2022-04-27 10:30:42,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {809#true} #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(12, 2); {809#true} is VALID [2022-04-27 10:30:42,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {809#true} assume true; {809#true} is VALID [2022-04-27 10:30:42,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {809#true} {809#true} #63#return; {809#true} is VALID [2022-04-27 10:30:42,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {809#true} call #t~ret5 := main(); {809#true} is VALID [2022-04-27 10:30:42,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {809#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {837#(<= main_~i~0 0)} is VALID [2022-04-27 10:30:42,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {837#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {837#(<= main_~i~0 0)} is VALID [2022-04-27 10:30:42,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {837#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {815#(<= main_~i~0 1)} is VALID [2022-04-27 10:30:42,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {815#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {815#(<= main_~i~0 1)} is VALID [2022-04-27 10:30:42,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {815#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {850#(<= main_~i~0 2)} is VALID [2022-04-27 10:30:42,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {850#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {850#(<= main_~i~0 2)} is VALID [2022-04-27 10:30:42,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {850#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {857#(<= main_~i~0 3)} is VALID [2022-04-27 10:30:42,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {857#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {857#(<= main_~i~0 3)} is VALID [2022-04-27 10:30:42,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {857#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {864#(<= main_~i~0 4)} is VALID [2022-04-27 10:30:42,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {864#(<= main_~i~0 4)} assume !(~i~0 < 1024); {810#false} is VALID [2022-04-27 10:30:42,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {810#false} ~i~0 := 0; {810#false} is VALID [2022-04-27 10:30:42,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {810#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {810#false} is VALID [2022-04-27 10:30:42,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {810#false} assume !!(0 != #t~mem4);havoc #t~mem4; {810#false} is VALID [2022-04-27 10:30:42,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {810#false} assume !(~i~0 >= 1023); {810#false} is VALID [2022-04-27 10:30:42,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {810#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {810#false} is VALID [2022-04-27 10:30:42,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {810#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {810#false} is VALID [2022-04-27 10:30:42,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {810#false} assume !(0 != #t~mem4);havoc #t~mem4; {810#false} is VALID [2022-04-27 10:30:42,779 INFO L272 TraceCheckUtils]: 22: Hoare triple {810#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {810#false} is VALID [2022-04-27 10:30:42,780 INFO L290 TraceCheckUtils]: 23: Hoare triple {810#false} ~cond := #in~cond; {810#false} is VALID [2022-04-27 10:30:42,780 INFO L290 TraceCheckUtils]: 24: Hoare triple {810#false} assume 0 == ~cond; {810#false} is VALID [2022-04-27 10:30:42,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {810#false} assume !false; {810#false} is VALID [2022-04-27 10:30:42,780 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 10:30:42,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:30:42,937 INFO L290 TraceCheckUtils]: 25: Hoare triple {810#false} assume !false; {810#false} is VALID [2022-04-27 10:30:42,937 INFO L290 TraceCheckUtils]: 24: Hoare triple {810#false} assume 0 == ~cond; {810#false} is VALID [2022-04-27 10:30:42,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {810#false} ~cond := #in~cond; {810#false} is VALID [2022-04-27 10:30:42,937 INFO L272 TraceCheckUtils]: 22: Hoare triple {810#false} call __VERIFIER_assert((if ~i~0 <= 1024 then 1 else 0)); {810#false} is VALID [2022-04-27 10:30:42,937 INFO L290 TraceCheckUtils]: 21: Hoare triple {810#false} assume !(0 != #t~mem4);havoc #t~mem4; {810#false} is VALID [2022-04-27 10:30:42,937 INFO L290 TraceCheckUtils]: 20: Hoare triple {810#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {810#false} is VALID [2022-04-27 10:30:42,938 INFO L290 TraceCheckUtils]: 19: Hoare triple {810#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {810#false} is VALID [2022-04-27 10:30:42,938 INFO L290 TraceCheckUtils]: 18: Hoare triple {810#false} assume !(~i~0 >= 1023); {810#false} is VALID [2022-04-27 10:30:42,938 INFO L290 TraceCheckUtils]: 17: Hoare triple {810#false} assume !!(0 != #t~mem4);havoc #t~mem4; {810#false} is VALID [2022-04-27 10:30:42,938 INFO L290 TraceCheckUtils]: 16: Hoare triple {810#false} call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4); {810#false} is VALID [2022-04-27 10:30:42,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {810#false} ~i~0 := 0; {810#false} is VALID [2022-04-27 10:30:42,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {934#(< main_~i~0 1024)} assume !(~i~0 < 1024); {810#false} is VALID [2022-04-27 10:30:42,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {938#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {934#(< main_~i~0 1024)} is VALID [2022-04-27 10:30:42,939 INFO L290 TraceCheckUtils]: 12: Hoare triple {938#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {938#(< main_~i~0 1023)} is VALID [2022-04-27 10:30:42,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {945#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {938#(< main_~i~0 1023)} is VALID [2022-04-27 10:30:42,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {945#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {945#(< main_~i~0 1022)} is VALID [2022-04-27 10:30:42,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {952#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {945#(< main_~i~0 1022)} is VALID [2022-04-27 10:30:42,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {952#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {952#(< main_~i~0 1021)} is VALID [2022-04-27 10:30:42,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {959#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {952#(< main_~i~0 1021)} is VALID [2022-04-27 10:30:42,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {959#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {959#(< main_~i~0 1020)} is VALID [2022-04-27 10:30:42,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {809#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {959#(< main_~i~0 1020)} is VALID [2022-04-27 10:30:42,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {809#true} call #t~ret5 := main(); {809#true} is VALID [2022-04-27 10:30:42,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {809#true} {809#true} #63#return; {809#true} is VALID [2022-04-27 10:30:42,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {809#true} assume true; {809#true} is VALID [2022-04-27 10:30:42,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {809#true} #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(12, 2); {809#true} is VALID [2022-04-27 10:30:42,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {809#true} call ULTIMATE.init(); {809#true} is VALID [2022-04-27 10:30:42,942 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 10:30:42,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901552803] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:30:42,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:30:42,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-04-27 10:30:42,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100545398] [2022-04-27 10:30:42,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:30:42,943 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 10:30:42,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:30:42,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.8125) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:42,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:30:42,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-27 10:30:42,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:30:42,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-27 10:30:42,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2022-04-27 10:30:42,978 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:43,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:43,407 INFO L93 Difference]: Finished difference Result 99 states and 125 transitions. [2022-04-27 10:30:43,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 10:30:43,407 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 10:30:43,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:30:43,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:43,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 112 transitions. [2022-04-27 10:30:43,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:43,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 112 transitions. [2022-04-27 10:30:43,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 112 transitions. [2022-04-27 10:30:43,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:30:43,488 INFO L225 Difference]: With dead ends: 99 [2022-04-27 10:30:43,488 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:30:43,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=225, Invalid=531, Unknown=0, NotChecked=0, Total=756 [2022-04-27 10:30:43,489 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 152 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:30:43,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 38 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:30:43,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:30:43,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:30:43,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:30:43,490 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 10:30:43,490 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 10:30:43,490 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 10:30:43,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:43,490 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:30:43,490 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:30:43,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:30:43,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:30:43,490 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 10:30:43,491 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 10:30:43,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:43,491 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:30:43,491 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:30:43,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:30:43,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:30:43,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:30:43,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:30:43,491 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 10:30:43,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:30:43,491 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-04-27 10:30:43,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:30:43,491 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:30:43,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 14 states have internal predecessors, (45), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:43,491 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:30:43,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:30:43,493 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:30:43,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 10:30:43,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:30:43,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:30:43,818 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-27 10:30:43,818 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-27 10:30:43,818 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-27 10:30:43,818 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-04-27 10:30:43,818 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 31) no Hoare annotation was computed. [2022-04-27 10:30:43,818 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 20 34) no Hoare annotation was computed. [2022-04-27 10:30:43,818 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 20 34) no Hoare annotation was computed. [2022-04-27 10:30:43,818 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 20 34) the Hoare annotation is: true [2022-04-27 10:30:43,818 INFO L899 garLoopResultBuilder]: For program point L28-1(lines 28 32) no Hoare annotation was computed. [2022-04-27 10:30:43,818 INFO L899 garLoopResultBuilder]: For program point L28-3(lines 28 32) no Hoare annotation was computed. [2022-04-27 10:30:43,818 INFO L895 garLoopResultBuilder]: At program point L28-4(lines 28 32) the Hoare annotation is: (< main_~i~0 1024) [2022-04-27 10:30:43,819 INFO L895 garLoopResultBuilder]: At program point L28-5(lines 28 32) the Hoare annotation is: (< main_~i~0 1024) [2022-04-27 10:30:43,819 INFO L899 garLoopResultBuilder]: For program point L24-2(lines 24 26) no Hoare annotation was computed. [2022-04-27 10:30:43,819 INFO L902 garLoopResultBuilder]: At program point L24-3(lines 24 26) the Hoare annotation is: true [2022-04-27 10:30:43,819 INFO L899 garLoopResultBuilder]: For program point L24-4(lines 24 26) no Hoare annotation was computed. [2022-04-27 10:30:43,819 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:30:43,819 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 10:30:43,819 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:30:43,819 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:30:43,819 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:30:43,819 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:30:43,819 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:30:43,819 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-27 10:30:43,819 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-04-27 10:30:43,819 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 19) the Hoare annotation is: true [2022-04-27 10:30:43,820 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 19) no Hoare annotation was computed. [2022-04-27 10:30:43,820 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 19) no Hoare annotation was computed. [2022-04-27 10:30:43,820 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-04-27 10:30:43,822 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2022-04-27 10:30:43,824 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:30:43,827 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:30:43,827 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:30:43,827 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:30:43,829 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:30:43,829 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-27 10:30:43,829 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:30:43,829 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:30:43,829 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2022-04-27 10:30:43,829 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2022-04-27 10:30:43,829 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-04-27 10:30:43,829 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:30:43,829 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:30:43,829 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:30:43,829 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:30:43,829 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2022-04-27 10:30:43,829 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-04-27 10:30:43,829 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 10:30:43,830 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 10:30:43,830 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 10:30:43,830 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 10:30:43,830 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:30:43,830 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 10:30:43,830 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-27 10:30:43,830 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 10:30:43,830 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 10:30:43,830 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 10:30:43,831 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-27 10:30:43,831 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:30:43,831 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2022-04-27 10:30:43,831 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:30:43,831 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:30:43,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:30:43 BoogieIcfgContainer [2022-04-27 10:30:43,837 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:30:43,838 INFO L158 Benchmark]: Toolchain (without parser) took 3728.13ms. Allocated memory was 203.4MB in the beginning and 245.4MB in the end (delta: 41.9MB). Free memory was 150.9MB in the beginning and 161.4MB in the end (delta: -10.5MB). Peak memory consumption was 31.2MB. Max. memory is 8.0GB. [2022-04-27 10:30:43,838 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 203.4MB. Free memory was 167.6MB in the beginning and 167.4MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:30:43,839 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.66ms. Allocated memory is still 203.4MB. Free memory was 150.6MB in the beginning and 178.3MB in the end (delta: -27.7MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. [2022-04-27 10:30:43,839 INFO L158 Benchmark]: Boogie Preprocessor took 19.83ms. Allocated memory is still 203.4MB. Free memory was 178.3MB in the beginning and 176.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 10:30:43,839 INFO L158 Benchmark]: RCFGBuilder took 201.53ms. Allocated memory is still 203.4MB. Free memory was 176.9MB in the beginning and 166.0MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 10:30:43,839 INFO L158 Benchmark]: TraceAbstraction took 3320.38ms. Allocated memory was 203.4MB in the beginning and 245.4MB in the end (delta: 41.9MB). Free memory was 165.4MB in the beginning and 161.4MB in the end (delta: 3.9MB). Peak memory consumption was 46.8MB. Max. memory is 8.0GB. [2022-04-27 10:30:43,840 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.10ms. Allocated memory is still 203.4MB. Free memory was 167.6MB in the beginning and 167.4MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 182.66ms. Allocated memory is still 203.4MB. Free memory was 150.6MB in the beginning and 178.3MB in the end (delta: -27.7MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.83ms. Allocated memory is still 203.4MB. Free memory was 178.3MB in the beginning and 176.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 201.53ms. Allocated memory is still 203.4MB. Free memory was 176.9MB in the beginning and 166.0MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3320.38ms. Allocated memory was 203.4MB in the beginning and 245.4MB in the end (delta: 41.9MB). Free memory was 165.4MB in the beginning and 161.4MB in the end (delta: 3.9MB). Peak memory consumption was 46.8MB. 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: 16]: 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 5 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 274 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 273 mSDsluCounter, 151 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 115 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 221 IncrementalHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 115 mSolverCounterUnsat, 80 mSDtfsCounter, 221 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=3, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 21 PreInvPairs, 51 NumberOfFragments, 18 HoareAnnotationTreeSize, 21 FomulaSimplifications, 33 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 196 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 284 SizeOfPredicates, 0 NumberOfNonLiveVariables, 189 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 36/73 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 - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: i < 1024 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-04-27 10:30:43,869 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...