/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/openssl-simplified/s3_srvr_1b.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:08:25,334 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:08:25,336 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:08:25,389 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:08:25,390 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:08:25,391 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:08:25,392 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:08:25,407 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:08:25,409 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:08:25,414 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:08:25,415 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:08:25,416 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:08:25,416 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:08:25,416 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:08:25,417 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:08:25,418 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:08:25,419 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:08:25,419 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:08:25,420 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:08:25,422 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:08:25,423 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:08:25,424 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:08:25,424 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:08:25,425 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:08:25,426 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:08:25,428 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:08:25,429 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:08:25,429 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:08:25,430 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:08:25,430 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:08:25,431 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:08:25,431 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:08:25,431 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:08:25,432 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:08:25,433 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:08:25,433 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:08:25,434 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:08:25,434 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:08:25,434 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:08:25,435 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:08:25,435 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:08:25,441 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:08:25,441 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 15:08:25,468 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:08:25,468 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:08:25,469 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 15:08:25,469 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 15:08:25,469 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 15:08:25,470 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 15:08:25,470 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 15:08:25,470 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 15:08:25,470 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 15:08:25,471 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:08:25,472 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:08:25,472 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:08:25,472 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:08:25,472 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:08:25,472 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:08:25,472 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:08:25,472 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:08:25,473 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:08:25,474 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:08:25,474 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:08:25,474 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:08:25,474 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:08:25,474 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:08:25,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:08:25,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:08:25,475 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:08:25,475 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 15:08:25,475 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 15:08:25,475 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:08:25,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 15:08:25,476 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 15:08:25,476 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 15:08:25,476 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 15:08:25,476 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 15:08:25,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:08:25,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:08:25,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:08:25,717 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:08:25,718 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:08:25,719 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_1b.cil.c [2022-04-27 15:08:25,777 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34f9326bc/0a467925a9254d478fb518c06b150ff6/FLAG8fdff7585 [2022-04-27 15:08:26,201 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:08:26,201 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1b.cil.c [2022-04-27 15:08:26,207 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34f9326bc/0a467925a9254d478fb518c06b150ff6/FLAG8fdff7585 [2022-04-27 15:08:26,613 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34f9326bc/0a467925a9254d478fb518c06b150ff6 [2022-04-27 15:08:26,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:08:26,616 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 15:08:26,618 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:08:26,620 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:08:26,623 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:08:26,624 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:08:26" (1/1) ... [2022-04-27 15:08:26,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12938633 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:08:26, skipping insertion in model container [2022-04-27 15:08:26,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:08:26" (1/1) ... [2022-04-27 15:08:26,631 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:08:26,648 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:08:26,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1b.cil.c[8244,8257] [2022-04-27 15:08:26,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:08:26,911 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:08:26,942 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1b.cil.c[8244,8257] [2022-04-27 15:08:26,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:08:26,953 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:08:26,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:08:26 WrapperNode [2022-04-27 15:08:26,954 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:08:26,955 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:08:26,955 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:08:26,955 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:08:26,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:08:26" (1/1) ... [2022-04-27 15:08:26,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:08:26" (1/1) ... [2022-04-27 15:08:26,969 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:08:26" (1/1) ... [2022-04-27 15:08:26,970 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:08:26" (1/1) ... [2022-04-27 15:08:26,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:08:26" (1/1) ... [2022-04-27 15:08:26,990 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:08:26" (1/1) ... [2022-04-27 15:08:26,994 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:08:26" (1/1) ... [2022-04-27 15:08:26,997 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:08:26,999 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:08:26,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:08:27,000 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:08:27,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:08:26" (1/1) ... [2022-04-27 15:08:27,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:08:27,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:08:27,028 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 15:08:27,058 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 15:08:27,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:08:27,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:08:27,079 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:08:27,079 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:08:27,080 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:08:27,080 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:08:27,080 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:08:27,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:08:27,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-27 15:08:27,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 15:08:27,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-27 15:08:27,081 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:08:27,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:08:27,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:08:27,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:08:27,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:08:27,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:08:27,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:08:27,129 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:08:27,130 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:08:27,321 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:08:27,327 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:08:27,327 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 15:08:27,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:08:27 BoogieIcfgContainer [2022-04-27 15:08:27,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:08:27,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:08:27,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:08:27,380 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:08:27,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:08:26" (1/3) ... [2022-04-27 15:08:27,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50e2dbf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:08:27, skipping insertion in model container [2022-04-27 15:08:27,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:08:26" (2/3) ... [2022-04-27 15:08:27,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50e2dbf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:08:27, skipping insertion in model container [2022-04-27 15:08:27,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:08:27" (3/3) ... [2022-04-27 15:08:27,383 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1b.cil.c [2022-04-27 15:08:27,402 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:08:27,402 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:08:27,459 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:08:27,469 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@2521ff9b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@41f2a29c [2022-04-27 15:08:27,470 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:08:27,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 24 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:08:27,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-27 15:08:27,483 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:08:27,484 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:08:27,485 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:08:27,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:08:27,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1468663722, now seen corresponding path program 1 times [2022-04-27 15:08:27,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:08:27,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129498818] [2022-04-27 15:08:27,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:08:27,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:08:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:08:27,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:08:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:08:27,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#(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(17, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-27 15:08:27,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-27 15:08:27,726 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #108#return; {32#true} is VALID [2022-04-27 15:08:27,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {38#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:08:27,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#(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(17, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-27 15:08:27,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-27 15:08:27,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #108#return; {32#true} is VALID [2022-04-27 15:08:27,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-27 15:08:27,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {37#(= main_~blastFlag~0 0)} is VALID [2022-04-27 15:08:27,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {37#(= main_~blastFlag~0 0)} assume !false; {37#(= main_~blastFlag~0 0)} is VALID [2022-04-27 15:08:27,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#(= main_~blastFlag~0 0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {33#false} is VALID [2022-04-27 15:08:27,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-27 15:08:27,735 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 15:08:27,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:08:27,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129498818] [2022-04-27 15:08:27,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129498818] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:08:27,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:08:27,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:08:27,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616661387] [2022-04-27 15:08:27,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:08:27,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-27 15:08:27,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:08:27,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:27,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:08:27,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:08:27,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:08:27,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:08:27,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:08:27,796 INFO L87 Difference]: Start difference. First operand has 29 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 24 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:28,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:28,033 INFO L93 Difference]: Finished difference Result 70 states and 115 transitions. [2022-04-27 15:08:28,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:08:28,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-27 15:08:28,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:08:28,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:28,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-27 15:08:28,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:28,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-27 15:08:28,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-27 15:08:28,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:08:28,243 INFO L225 Difference]: With dead ends: 70 [2022-04-27 15:08:28,243 INFO L226 Difference]: Without dead ends: 39 [2022-04-27 15:08:28,246 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 15:08:28,251 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 79 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:08:28,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 44 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:08:28,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-27 15:08:28,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-27 15:08:28,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:08:28,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:28,295 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:28,295 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:28,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:28,299 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2022-04-27 15:08:28,300 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-04-27 15:08:28,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:08:28,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:08:28,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-27 15:08:28,301 INFO L87 Difference]: Start difference. First operand has 39 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-27 15:08:28,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:28,305 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2022-04-27 15:08:28,305 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-04-27 15:08:28,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:08:28,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:08:28,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:08:28,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:08:28,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:28,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-04-27 15:08:28,311 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 9 [2022-04-27 15:08:28,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:08:28,311 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2022-04-27 15:08:28,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:28,311 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-04-27 15:08:28,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 15:08:28,312 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:08:28,312 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:08:28,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:08:28,313 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:08:28,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:08:28,313 INFO L85 PathProgramCache]: Analyzing trace with hash -968056640, now seen corresponding path program 1 times [2022-04-27 15:08:28,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:08:28,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138349476] [2022-04-27 15:08:28,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:08:28,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:08:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:08:28,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:08:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:08:28,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {275#(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(17, 2);call #Ultimate.allocInit(12, 3); {269#true} is VALID [2022-04-27 15:08:28,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#true} assume true; {269#true} is VALID [2022-04-27 15:08:28,373 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {269#true} {269#true} #108#return; {269#true} is VALID [2022-04-27 15:08:28,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {269#true} call ULTIMATE.init(); {275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:08:28,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#(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(17, 2);call #Ultimate.allocInit(12, 3); {269#true} is VALID [2022-04-27 15:08:28,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {269#true} assume true; {269#true} is VALID [2022-04-27 15:08:28,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {269#true} {269#true} #108#return; {269#true} is VALID [2022-04-27 15:08:28,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {269#true} call #t~ret6 := main(); {269#true} is VALID [2022-04-27 15:08:28,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {269#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {269#true} is VALID [2022-04-27 15:08:28,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {269#true} assume !false; {269#true} is VALID [2022-04-27 15:08:28,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {269#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {269#true} is VALID [2022-04-27 15:08:28,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {269#true} assume 8466 == ~s__state~0; {269#true} is VALID [2022-04-27 15:08:28,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {269#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 2; {274#(= (+ (- 2) main_~blastFlag~0) 0)} is VALID [2022-04-27 15:08:28,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {274#(= (+ (- 2) main_~blastFlag~0) 0)} assume !(0 != ~s__hit~0);~s__state~0 := 8512; {274#(= (+ (- 2) main_~blastFlag~0) 0)} is VALID [2022-04-27 15:08:28,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {274#(= (+ (- 2) main_~blastFlag~0) 0)} assume !false; {274#(= (+ (- 2) main_~blastFlag~0) 0)} is VALID [2022-04-27 15:08:28,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {274#(= (+ (- 2) main_~blastFlag~0) 0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {270#false} is VALID [2022-04-27 15:08:28,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {270#false} assume !false; {270#false} is VALID [2022-04-27 15:08:28,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:08:28,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:08:28,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138349476] [2022-04-27 15:08:28,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138349476] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:08:28,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:08:28,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:08:28,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102702412] [2022-04-27 15:08:28,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:08:28,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 15:08:28,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:08:28,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:28,402 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 15:08:28,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:08:28,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:08:28,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:08:28,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:08:28,403 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:28,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:28,543 INFO L93 Difference]: Finished difference Result 70 states and 103 transitions. [2022-04-27 15:08:28,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:08:28,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 15:08:28,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:08:28,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:28,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-04-27 15:08:28,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:28,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-04-27 15:08:28,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 84 transitions. [2022-04-27 15:08:28,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:08:28,631 INFO L225 Difference]: With dead ends: 70 [2022-04-27 15:08:28,631 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 15:08:28,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 15:08:28,639 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 47 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:08:28,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 51 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:08:28,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 15:08:28,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-27 15:08:28,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:08:28,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:28,651 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:28,651 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:28,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:28,654 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-27 15:08:28,654 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-27 15:08:28,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:08:28,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:08:28,656 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-27 15:08:28,656 INFO L87 Difference]: Start difference. First operand has 52 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-27 15:08:28,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:28,659 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-27 15:08:28,659 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-27 15:08:28,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:08:28,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:08:28,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:08:28,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:08:28,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:28,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2022-04-27 15:08:28,663 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 14 [2022-04-27 15:08:28,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:08:28,663 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2022-04-27 15:08:28,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:28,663 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-27 15:08:28,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 15:08:28,664 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:08:28,664 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:08:28,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:08:28,665 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:08:28,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:08:28,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1990721020, now seen corresponding path program 1 times [2022-04-27 15:08:28,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:08:28,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898041584] [2022-04-27 15:08:28,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:08:28,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:08:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:08:28,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:08:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:08:28,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {559#(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(17, 2);call #Ultimate.allocInit(12, 3); {553#true} is VALID [2022-04-27 15:08:28,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {553#true} assume true; {553#true} is VALID [2022-04-27 15:08:28,731 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {553#true} {553#true} #108#return; {553#true} is VALID [2022-04-27 15:08:28,732 INFO L272 TraceCheckUtils]: 0: Hoare triple {553#true} call ULTIMATE.init(); {559#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:08:28,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {559#(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(17, 2);call #Ultimate.allocInit(12, 3); {553#true} is VALID [2022-04-27 15:08:28,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {553#true} assume true; {553#true} is VALID [2022-04-27 15:08:28,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {553#true} {553#true} #108#return; {553#true} is VALID [2022-04-27 15:08:28,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {553#true} call #t~ret6 := main(); {553#true} is VALID [2022-04-27 15:08:28,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {553#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {553#true} is VALID [2022-04-27 15:08:28,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {553#true} assume !false; {553#true} is VALID [2022-04-27 15:08:28,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {553#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {553#true} is VALID [2022-04-27 15:08:28,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {553#true} assume 8466 == ~s__state~0; {553#true} is VALID [2022-04-27 15:08:28,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {553#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 2; {553#true} is VALID [2022-04-27 15:08:28,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {553#true} assume !(0 != ~s__hit~0);~s__state~0 := 8512; {558#(= (+ (- 8512) main_~s__state~0) 0)} is VALID [2022-04-27 15:08:28,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {558#(= (+ (- 8512) main_~s__state~0) 0)} assume !false; {558#(= (+ (- 8512) main_~s__state~0) 0)} is VALID [2022-04-27 15:08:28,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {558#(= (+ (- 8512) main_~s__state~0) 0)} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {558#(= (+ (- 8512) main_~s__state~0) 0)} is VALID [2022-04-27 15:08:28,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {558#(= (+ (- 8512) main_~s__state~0) 0)} assume !(8466 == ~s__state~0); {558#(= (+ (- 8512) main_~s__state~0) 0)} is VALID [2022-04-27 15:08:28,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {558#(= (+ (- 8512) main_~s__state~0) 0)} assume !(8512 == ~s__state~0); {554#false} is VALID [2022-04-27 15:08:28,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {554#false} assume !(8640 == ~s__state~0); {554#false} is VALID [2022-04-27 15:08:28,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {554#false} assume 8656 == ~s__state~0; {554#false} is VALID [2022-04-27 15:08:28,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {554#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {554#false} is VALID [2022-04-27 15:08:28,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {554#false} assume !(4 == ~blastFlag~0); {554#false} is VALID [2022-04-27 15:08:28,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {554#false} assume 5 == ~blastFlag~0; {554#false} is VALID [2022-04-27 15:08:28,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {554#false} assume !false; {554#false} is VALID [2022-04-27 15:08:28,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:08:28,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:08:28,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898041584] [2022-04-27 15:08:28,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898041584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:08:28,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:08:28,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:08:28,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906471302] [2022-04-27 15:08:28,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:08:28,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 15:08:28,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:08:28,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:28,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:08:28,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:08:28,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:08:28,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:08:28,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:08:28,756 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:28,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:28,870 INFO L93 Difference]: Finished difference Result 93 states and 131 transitions. [2022-04-27 15:08:28,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:08:28,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 15:08:28,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:08:28,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:28,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-27 15:08:28,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:28,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-27 15:08:28,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2022-04-27 15:08:28,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:08:28,942 INFO L225 Difference]: With dead ends: 93 [2022-04-27 15:08:28,942 INFO L226 Difference]: Without dead ends: 62 [2022-04-27 15:08:28,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 15:08:28,950 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 32 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:08:28,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 43 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:08:28,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-27 15:08:28,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2022-04-27 15:08:28,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:08:28,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 60 states, 56 states have (on average 1.375) internal successors, (77), 56 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:28,964 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 60 states, 56 states have (on average 1.375) internal successors, (77), 56 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:28,964 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 60 states, 56 states have (on average 1.375) internal successors, (77), 56 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:28,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:28,967 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2022-04-27 15:08:28,967 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 81 transitions. [2022-04-27 15:08:28,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:08:28,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:08:28,968 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 56 states have (on average 1.375) internal successors, (77), 56 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 62 states. [2022-04-27 15:08:28,969 INFO L87 Difference]: Start difference. First operand has 60 states, 56 states have (on average 1.375) internal successors, (77), 56 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 62 states. [2022-04-27 15:08:28,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:28,971 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2022-04-27 15:08:28,971 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 81 transitions. [2022-04-27 15:08:28,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:08:28,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:08:28,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:08:28,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:08:28,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 56 states have (on average 1.375) internal successors, (77), 56 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:28,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 80 transitions. [2022-04-27 15:08:28,975 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 80 transitions. Word has length 21 [2022-04-27 15:08:28,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:08:28,975 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 80 transitions. [2022-04-27 15:08:28,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:28,975 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2022-04-27 15:08:28,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 15:08:28,976 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:08:28,976 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:08:28,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 15:08:28,976 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:08:28,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:08:28,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1603181698, now seen corresponding path program 1 times [2022-04-27 15:08:28,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:08:28,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104778688] [2022-04-27 15:08:28,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:08:28,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:08:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:08:29,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:08:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:08:29,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {904#(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(17, 2);call #Ultimate.allocInit(12, 3); {898#true} is VALID [2022-04-27 15:08:29,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {898#true} assume true; {898#true} is VALID [2022-04-27 15:08:29,025 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {898#true} {898#true} #108#return; {898#true} is VALID [2022-04-27 15:08:29,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {898#true} call ULTIMATE.init(); {904#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:08:29,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {904#(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(17, 2);call #Ultimate.allocInit(12, 3); {898#true} is VALID [2022-04-27 15:08:29,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {898#true} assume true; {898#true} is VALID [2022-04-27 15:08:29,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {898#true} {898#true} #108#return; {898#true} is VALID [2022-04-27 15:08:29,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {898#true} call #t~ret6 := main(); {898#true} is VALID [2022-04-27 15:08:29,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {898#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {898#true} is VALID [2022-04-27 15:08:29,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {898#true} assume !false; {898#true} is VALID [2022-04-27 15:08:29,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {898#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {898#true} is VALID [2022-04-27 15:08:29,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {898#true} assume 8466 == ~s__state~0; {898#true} is VALID [2022-04-27 15:08:29,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {898#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 2; {898#true} is VALID [2022-04-27 15:08:29,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {898#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {898#true} is VALID [2022-04-27 15:08:29,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {898#true} assume !false; {898#true} is VALID [2022-04-27 15:08:29,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {898#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {898#true} is VALID [2022-04-27 15:08:29,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {898#true} assume !(8466 == ~s__state~0); {898#true} is VALID [2022-04-27 15:08:29,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {898#true} assume !(8512 == ~s__state~0); {898#true} is VALID [2022-04-27 15:08:29,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {898#true} assume !(8640 == ~s__state~0); {898#true} is VALID [2022-04-27 15:08:29,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {898#true} assume 8656 == ~s__state~0; {898#true} is VALID [2022-04-27 15:08:29,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {898#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {903#(= 3 main_~blastFlag~0)} is VALID [2022-04-27 15:08:29,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {903#(= 3 main_~blastFlag~0)} assume !(4 == ~blastFlag~0); {903#(= 3 main_~blastFlag~0)} is VALID [2022-04-27 15:08:29,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {903#(= 3 main_~blastFlag~0)} assume 5 == ~blastFlag~0; {899#false} is VALID [2022-04-27 15:08:29,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {899#false} assume !false; {899#false} is VALID [2022-04-27 15:08:29,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 15:08:29,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:08:29,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104778688] [2022-04-27 15:08:29,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104778688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:08:29,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:08:29,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:08:29,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961954726] [2022-04-27 15:08:29,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:08:29,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 15:08:29,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:08:29,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:29,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:08:29,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:08:29,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:08:29,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:08:29,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:08:29,049 INFO L87 Difference]: Start difference. First operand 60 states and 80 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:29,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:29,161 INFO L93 Difference]: Finished difference Result 120 states and 167 transitions. [2022-04-27 15:08:29,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:08:29,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 15:08:29,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:08:29,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:29,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-04-27 15:08:29,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:29,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-04-27 15:08:29,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 89 transitions. [2022-04-27 15:08:29,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:08:29,231 INFO L225 Difference]: With dead ends: 120 [2022-04-27 15:08:29,231 INFO L226 Difference]: Without dead ends: 81 [2022-04-27 15:08:29,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 15:08:29,233 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 51 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:08:29,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 53 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:08:29,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-27 15:08:29,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2022-04-27 15:08:29,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:08:29,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 79 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 75 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:29,241 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 79 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 75 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:29,241 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 79 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 75 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:29,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:29,244 INFO L93 Difference]: Finished difference Result 81 states and 107 transitions. [2022-04-27 15:08:29,244 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 107 transitions. [2022-04-27 15:08:29,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:08:29,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:08:29,245 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 75 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 81 states. [2022-04-27 15:08:29,245 INFO L87 Difference]: Start difference. First operand has 79 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 75 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 81 states. [2022-04-27 15:08:29,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:29,248 INFO L93 Difference]: Finished difference Result 81 states and 107 transitions. [2022-04-27 15:08:29,248 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 107 transitions. [2022-04-27 15:08:29,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:08:29,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:08:29,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:08:29,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:08:29,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 75 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:29,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 106 transitions. [2022-04-27 15:08:29,252 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 106 transitions. Word has length 21 [2022-04-27 15:08:29,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:08:29,252 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 106 transitions. [2022-04-27 15:08:29,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:29,252 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 106 transitions. [2022-04-27 15:08:29,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 15:08:29,253 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:08:29,253 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:08:29,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 15:08:29,253 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:08:29,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:08:29,254 INFO L85 PathProgramCache]: Analyzing trace with hash 351223625, now seen corresponding path program 1 times [2022-04-27 15:08:29,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:08:29,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804641815] [2022-04-27 15:08:29,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:08:29,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:08:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:08:29,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:08:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:08:29,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {1347#(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(17, 2);call #Ultimate.allocInit(12, 3); {1341#true} is VALID [2022-04-27 15:08:29,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {1341#true} assume true; {1341#true} is VALID [2022-04-27 15:08:29,292 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1341#true} {1341#true} #108#return; {1341#true} is VALID [2022-04-27 15:08:29,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {1341#true} call ULTIMATE.init(); {1347#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:08:29,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {1347#(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(17, 2);call #Ultimate.allocInit(12, 3); {1341#true} is VALID [2022-04-27 15:08:29,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {1341#true} assume true; {1341#true} is VALID [2022-04-27 15:08:29,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1341#true} {1341#true} #108#return; {1341#true} is VALID [2022-04-27 15:08:29,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {1341#true} call #t~ret6 := main(); {1341#true} is VALID [2022-04-27 15:08:29,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {1341#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {1341#true} is VALID [2022-04-27 15:08:29,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {1341#true} assume !false; {1341#true} is VALID [2022-04-27 15:08:29,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {1341#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1341#true} is VALID [2022-04-27 15:08:29,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {1341#true} assume 8466 == ~s__state~0; {1341#true} is VALID [2022-04-27 15:08:29,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {1341#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 2; {1341#true} is VALID [2022-04-27 15:08:29,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {1341#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {1341#true} is VALID [2022-04-27 15:08:29,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {1341#true} assume !false; {1341#true} is VALID [2022-04-27 15:08:29,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {1341#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1341#true} is VALID [2022-04-27 15:08:29,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {1341#true} assume !(8466 == ~s__state~0); {1341#true} is VALID [2022-04-27 15:08:29,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {1341#true} assume !(8512 == ~s__state~0); {1341#true} is VALID [2022-04-27 15:08:29,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {1341#true} assume !(8640 == ~s__state~0); {1341#true} is VALID [2022-04-27 15:08:29,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {1341#true} assume 8656 == ~s__state~0; {1341#true} is VALID [2022-04-27 15:08:29,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {1341#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {1341#true} is VALID [2022-04-27 15:08:29,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {1341#true} assume !(4 == ~blastFlag~0); {1341#true} is VALID [2022-04-27 15:08:29,296 INFO L290 TraceCheckUtils]: 19: Hoare triple {1341#true} assume !(5 == ~blastFlag~0); {1341#true} is VALID [2022-04-27 15:08:29,296 INFO L290 TraceCheckUtils]: 20: Hoare triple {1341#true} assume 0 != ~s__hit~0;~s__state~0 := 8640; {1346#(<= 8640 main_~s__state~0)} is VALID [2022-04-27 15:08:29,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {1346#(<= 8640 main_~s__state~0)} assume !false; {1346#(<= 8640 main_~s__state~0)} is VALID [2022-04-27 15:08:29,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {1346#(<= 8640 main_~s__state~0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {1342#false} is VALID [2022-04-27 15:08:29,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {1342#false} assume !false; {1342#false} is VALID [2022-04-27 15:08:29,298 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 15:08:29,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:08:29,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804641815] [2022-04-27 15:08:29,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804641815] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:08:29,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:08:29,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:08:29,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286421140] [2022-04-27 15:08:29,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:08:29,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 15:08:29,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:08:29,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:29,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:08:29,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:08:29,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:08:29,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:08:29,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:08:29,316 INFO L87 Difference]: Start difference. First operand 79 states and 106 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:29,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:29,416 INFO L93 Difference]: Finished difference Result 148 states and 201 transitions. [2022-04-27 15:08:29,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:08:29,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 15:08:29,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:08:29,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:29,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-04-27 15:08:29,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:29,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-04-27 15:08:29,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 71 transitions. [2022-04-27 15:08:29,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:08:29,499 INFO L225 Difference]: With dead ends: 148 [2022-04-27 15:08:29,499 INFO L226 Difference]: Without dead ends: 61 [2022-04-27 15:08:29,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 15:08:29,501 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 41 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:08:29,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 41 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:08:29,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-27 15:08:29,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-04-27 15:08:29,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:08:29,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 59 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:29,527 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 59 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:29,528 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 59 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:29,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:29,530 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-27 15:08:29,530 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-27 15:08:29,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:08:29,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:08:29,531 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-27 15:08:29,531 INFO L87 Difference]: Start difference. First operand has 59 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-27 15:08:29,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:29,533 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-27 15:08:29,533 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-27 15:08:29,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:08:29,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:08:29,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:08:29,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:08:29,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:29,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2022-04-27 15:08:29,536 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 24 [2022-04-27 15:08:29,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:08:29,537 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2022-04-27 15:08:29,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:29,537 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2022-04-27 15:08:29,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 15:08:29,538 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:08:29,538 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:08:29,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 15:08:29,538 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:08:29,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:08:29,539 INFO L85 PathProgramCache]: Analyzing trace with hash 322478086, now seen corresponding path program 1 times [2022-04-27 15:08:29,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:08:29,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534989510] [2022-04-27 15:08:29,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:08:29,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:08:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:08:29,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:08:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:08:29,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {1757#(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(17, 2);call #Ultimate.allocInit(12, 3); {1751#true} is VALID [2022-04-27 15:08:29,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {1751#true} assume true; {1751#true} is VALID [2022-04-27 15:08:29,585 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1751#true} {1751#true} #108#return; {1751#true} is VALID [2022-04-27 15:08:29,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {1751#true} call ULTIMATE.init(); {1757#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:08:29,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {1757#(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(17, 2);call #Ultimate.allocInit(12, 3); {1751#true} is VALID [2022-04-27 15:08:29,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {1751#true} assume true; {1751#true} is VALID [2022-04-27 15:08:29,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1751#true} {1751#true} #108#return; {1751#true} is VALID [2022-04-27 15:08:29,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {1751#true} call #t~ret6 := main(); {1751#true} is VALID [2022-04-27 15:08:29,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {1751#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {1751#true} is VALID [2022-04-27 15:08:29,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {1751#true} assume !false; {1751#true} is VALID [2022-04-27 15:08:29,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {1751#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1751#true} is VALID [2022-04-27 15:08:29,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {1751#true} assume 8466 == ~s__state~0; {1751#true} is VALID [2022-04-27 15:08:29,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {1751#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 2; {1751#true} is VALID [2022-04-27 15:08:29,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {1751#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {1756#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:29,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {1756#(not (= main_~s__hit~0 0))} assume !false; {1756#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:29,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {1756#(not (= main_~s__hit~0 0))} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1756#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:29,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {1756#(not (= main_~s__hit~0 0))} assume !(8466 == ~s__state~0); {1756#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:29,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {1756#(not (= main_~s__hit~0 0))} assume !(8512 == ~s__state~0); {1756#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:29,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {1756#(not (= main_~s__hit~0 0))} assume !(8640 == ~s__state~0); {1756#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:29,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {1756#(not (= main_~s__hit~0 0))} assume 8656 == ~s__state~0; {1756#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:29,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {1756#(not (= main_~s__hit~0 0))} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {1756#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:29,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {1756#(not (= main_~s__hit~0 0))} assume !(4 == ~blastFlag~0); {1756#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:29,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {1756#(not (= main_~s__hit~0 0))} assume !(5 == ~blastFlag~0); {1756#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:29,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {1756#(not (= main_~s__hit~0 0))} assume 0 != ~s__hit~0;~s__state~0 := 8640; {1756#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:29,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {1756#(not (= main_~s__hit~0 0))} assume !false; {1756#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:29,592 INFO L290 TraceCheckUtils]: 22: Hoare triple {1756#(not (= main_~s__hit~0 0))} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1756#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:29,592 INFO L290 TraceCheckUtils]: 23: Hoare triple {1756#(not (= main_~s__hit~0 0))} assume !(8466 == ~s__state~0); {1756#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:29,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {1756#(not (= main_~s__hit~0 0))} assume !(8512 == ~s__state~0); {1756#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:29,593 INFO L290 TraceCheckUtils]: 25: Hoare triple {1756#(not (= main_~s__hit~0 0))} assume 8640 == ~s__state~0; {1756#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:29,594 INFO L290 TraceCheckUtils]: 26: Hoare triple {1756#(not (= main_~s__hit~0 0))} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {1756#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:29,594 INFO L290 TraceCheckUtils]: 27: Hoare triple {1756#(not (= main_~s__hit~0 0))} assume !(0 != ~s__hit~0);~s__state~0 := 8656; {1752#false} is VALID [2022-04-27 15:08:29,594 INFO L290 TraceCheckUtils]: 28: Hoare triple {1752#false} assume !false; {1752#false} is VALID [2022-04-27 15:08:29,594 INFO L290 TraceCheckUtils]: 29: Hoare triple {1752#false} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1752#false} is VALID [2022-04-27 15:08:29,595 INFO L290 TraceCheckUtils]: 30: Hoare triple {1752#false} assume !(8466 == ~s__state~0); {1752#false} is VALID [2022-04-27 15:08:29,595 INFO L290 TraceCheckUtils]: 31: Hoare triple {1752#false} assume !(8512 == ~s__state~0); {1752#false} is VALID [2022-04-27 15:08:29,595 INFO L290 TraceCheckUtils]: 32: Hoare triple {1752#false} assume !(8640 == ~s__state~0); {1752#false} is VALID [2022-04-27 15:08:29,595 INFO L290 TraceCheckUtils]: 33: Hoare triple {1752#false} assume 8656 == ~s__state~0; {1752#false} is VALID [2022-04-27 15:08:29,595 INFO L290 TraceCheckUtils]: 34: Hoare triple {1752#false} assume !(2 == ~blastFlag~0); {1752#false} is VALID [2022-04-27 15:08:29,595 INFO L290 TraceCheckUtils]: 35: Hoare triple {1752#false} assume !(4 == ~blastFlag~0); {1752#false} is VALID [2022-04-27 15:08:29,596 INFO L290 TraceCheckUtils]: 36: Hoare triple {1752#false} assume 5 == ~blastFlag~0; {1752#false} is VALID [2022-04-27 15:08:29,596 INFO L290 TraceCheckUtils]: 37: Hoare triple {1752#false} assume !false; {1752#false} is VALID [2022-04-27 15:08:29,596 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 15:08:29,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:08:29,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534989510] [2022-04-27 15:08:29,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534989510] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:08:29,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:08:29,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:08:29,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675705444] [2022-04-27 15:08:29,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:08:29,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-27 15:08:29,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:08:29,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:29,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:08:29,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:08:29,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:08:29,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:08:29,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:08:29,621 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:29,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:29,704 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2022-04-27 15:08:29,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:08:29,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-27 15:08:29,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:08:29,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:29,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-04-27 15:08:29,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:29,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-04-27 15:08:29,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 61 transitions. [2022-04-27 15:08:29,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:08:29,761 INFO L225 Difference]: With dead ends: 92 [2022-04-27 15:08:29,761 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 15:08:29,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 15:08:29,766 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 36 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:08:29,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 39 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:08:29,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 15:08:29,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 15:08:29,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:08:29,770 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 15:08:29,770 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 15:08:29,771 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 15:08:29,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:29,771 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 15:08:29,771 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:08:29,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:08:29,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:08:29,771 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 15:08:29,771 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 15:08:29,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:29,772 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 15:08:29,772 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:08:29,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:08:29,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:08:29,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:08:29,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:08:29,772 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 15:08:29,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 15:08:29,773 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2022-04-27 15:08:29,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:08:29,773 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 15:08:29,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:08:29,773 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:08:29,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:08:29,776 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 15:08:29,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 15:08:29,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 15:08:29,923 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 13) no Hoare annotation was computed. [2022-04-27 15:08:29,924 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 13) no Hoare annotation was computed. [2022-04-27 15:08:29,924 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 13) no Hoare annotation was computed. [2022-04-27 15:08:29,924 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 20 152) no Hoare annotation was computed. [2022-04-27 15:08:29,924 INFO L899 garLoopResultBuilder]: For program point L89-1(lines 65 118) no Hoare annotation was computed. [2022-04-27 15:08:29,924 INFO L899 garLoopResultBuilder]: For program point L81(lines 81 85) no Hoare annotation was computed. [2022-04-27 15:08:29,924 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 139) no Hoare annotation was computed. [2022-04-27 15:08:29,924 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 65 118) no Hoare annotation was computed. [2022-04-27 15:08:29,924 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 120) no Hoare annotation was computed. [2022-04-27 15:08:29,924 INFO L899 garLoopResultBuilder]: For program point L57(lines 57 122) no Hoare annotation was computed. [2022-04-27 15:08:29,925 INFO L902 garLoopResultBuilder]: At program point L148(lines 20 152) the Hoare annotation is: true [2022-04-27 15:08:29,925 INFO L895 garLoopResultBuilder]: At program point L111(lines 29 146) the Hoare annotation is: (or (= main_~blastFlag~0 0) (and (= 3 main_~blastFlag~0) (not (= main_~s__hit~0 0)) (<= 8640 main_~s__state~0)) (= 2 main_~blastFlag~0)) [2022-04-27 15:08:29,925 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 109) no Hoare annotation was computed. [2022-04-27 15:08:29,925 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 136) no Hoare annotation was computed. [2022-04-27 15:08:29,925 INFO L895 garLoopResultBuilder]: At program point L37(lines 36 139) the Hoare annotation is: (or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-27 15:08:29,925 INFO L895 garLoopResultBuilder]: At program point L62(lines 61 120) the Hoare annotation is: (let ((.cse0 (<= 8640 main_~s__state~0))) (or (and .cse0 (= 2 main_~blastFlag~0)) (and (= 3 main_~blastFlag~0) (not (= main_~s__hit~0 0)) .cse0) (and (= main_~blastFlag~0 0) .cse0))) [2022-04-27 15:08:29,925 INFO L895 garLoopResultBuilder]: At program point L58(lines 57 122) the Hoare annotation is: (let ((.cse0 (<= 8640 main_~s__state~0))) (or (and .cse0 (= 2 main_~blastFlag~0)) (and (= 3 main_~blastFlag~0) (not (= main_~s__hit~0 0)) .cse0) (and (= main_~blastFlag~0 0) .cse0))) [2022-04-27 15:08:29,926 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 20 152) no Hoare annotation was computed. [2022-04-27 15:08:29,926 INFO L895 garLoopResultBuilder]: At program point L108(lines 20 152) the Hoare annotation is: false [2022-04-27 15:08:29,926 INFO L895 garLoopResultBuilder]: At program point L42(lines 41 136) the Hoare annotation is: (let ((.cse0 (= (+ (- 8512) main_~s__state~0) 0))) (or (and (= (+ (- 2) main_~blastFlag~0) 0) .cse0) (and (= main_~blastFlag~0 0) .cse0))) [2022-04-27 15:08:29,926 INFO L899 garLoopResultBuilder]: For program point L104-1(lines 65 118) no Hoare annotation was computed. [2022-04-27 15:08:29,926 INFO L899 garLoopResultBuilder]: For program point L100-1(lines 65 118) no Hoare annotation was computed. [2022-04-27 15:08:29,926 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2022-04-27 15:08:29,926 INFO L899 garLoopResultBuilder]: For program point L30(line 30) no Hoare annotation was computed. [2022-04-27 15:08:29,926 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 20 152) the Hoare annotation is: true [2022-04-27 15:08:29,927 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 15:08:29,927 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 15:08:29,927 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 15:08:29,927 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 15:08:29,927 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 15:08:29,927 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 15:08:29,927 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 15:08:29,930 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-04-27 15:08:29,932 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 15:08:29,934 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 15:08:29,935 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 15:08:29,937 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 15:08:29,937 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 15:08:29,937 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 15:08:29,937 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-27 15:08:29,937 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 15:08:29,937 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 15:08:29,938 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 15:08:29,938 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-27 15:08:29,938 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-27 15:08:29,938 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 15:08:29,938 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-04-27 15:08:29,938 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 15:08:29,938 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 15:08:29,938 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 15:08:29,938 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 15:08:29,938 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2022-04-27 15:08:29,938 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2022-04-27 15:08:29,938 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-27 15:08:29,938 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-27 15:08:29,939 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2022-04-27 15:08:29,939 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2022-04-27 15:08:29,939 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-04-27 15:08:29,939 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-27 15:08:29,939 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-27 15:08:29,939 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-04-27 15:08:29,939 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-04-27 15:08:29,939 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2022-04-27 15:08:29,939 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2022-04-27 15:08:29,939 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-04-27 15:08:29,939 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-04-27 15:08:29,939 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2022-04-27 15:08:29,939 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2022-04-27 15:08:29,939 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2022-04-27 15:08:29,940 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2022-04-27 15:08:29,940 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2022-04-27 15:08:29,940 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2022-04-27 15:08:29,940 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2022-04-27 15:08:29,940 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2022-04-27 15:08:29,940 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2022-04-27 15:08:29,940 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2022-04-27 15:08:29,940 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 15:08:29,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:08:29 BoogieIcfgContainer [2022-04-27 15:08:29,949 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 15:08:29,951 INFO L158 Benchmark]: Toolchain (without parser) took 3334.10ms. Allocated memory was 176.2MB in the beginning and 229.6MB in the end (delta: 53.5MB). Free memory was 127.5MB in the beginning and 167.8MB in the end (delta: -40.2MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. [2022-04-27 15:08:29,951 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 176.2MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 15:08:29,951 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.61ms. Allocated memory is still 176.2MB. Free memory was 127.3MB in the beginning and 154.0MB in the end (delta: -26.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 15:08:29,951 INFO L158 Benchmark]: Boogie Preprocessor took 42.89ms. Allocated memory is still 176.2MB. Free memory was 154.0MB in the beginning and 152.6MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 15:08:29,952 INFO L158 Benchmark]: RCFGBuilder took 330.06ms. Allocated memory is still 176.2MB. Free memory was 152.6MB in the beginning and 141.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 15:08:29,952 INFO L158 Benchmark]: TraceAbstraction took 2619.02ms. Allocated memory was 176.2MB in the beginning and 229.6MB in the end (delta: 53.5MB). Free memory was 140.6MB in the beginning and 167.8MB in the end (delta: -27.1MB). Peak memory consumption was 27.9MB. Max. memory is 8.0GB. [2022-04-27 15:08:29,953 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.13ms. Allocated memory is still 176.2MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 336.61ms. Allocated memory is still 176.2MB. Free memory was 127.3MB in the beginning and 154.0MB in the end (delta: -26.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.89ms. Allocated memory is still 176.2MB. Free memory was 154.0MB in the beginning and 152.6MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 330.06ms. Allocated memory is still 176.2MB. Free memory was 152.6MB in the beginning and 141.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2619.02ms. Allocated memory was 176.2MB in the beginning and 229.6MB in the end (delta: 53.5MB). Free memory was 140.6MB in the beginning and 167.8MB in the end (delta: -27.1MB). Peak memory consumption was 27.9MB. 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: 150]: 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 4 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 286 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 286 mSDsluCounter, 271 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 185 IncrementalHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 227 mSDtfsCounter, 185 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=4, InterpolantAutomatonStates: 24, 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, 6 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 32 NumberOfFragments, 112 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 72 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 127 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 121 ConstructedInterpolants, 0 QuantifiedInterpolants, 248 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 43/43 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: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (-2 + blastFlag == 0 && -8512 + s__state == 0) || (blastFlag == 0 && -8512 + s__state == 0) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (blastFlag == 0 || ((3 == blastFlag && !(s__hit == 0)) && 8640 <= s__state)) || 2 == blastFlag - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((8640 <= s__state && 2 == blastFlag) || ((3 == blastFlag && !(s__hit == 0)) && 8640 <= s__state)) || (blastFlag == 0 && 8640 <= s__state) - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: ((8640 <= s__state && 2 == blastFlag) || ((3 == blastFlag && !(s__hit == 0)) && 8640 <= s__state)) || (blastFlag == 0 && 8640 <= s__state) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: -2 + blastFlag == 0 || blastFlag == 0 RESULT: Ultimate proved your program to be correct! [2022-04-27 15:08:29,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...