/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/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_1b.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 14:51:48,504 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 14:51:48,536 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 14:51:48,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 14:51:48,578 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 14:51:48,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 14:51:48,584 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 14:51:48,587 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 14:51:48,588 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 14:51:48,592 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 14:51:48,593 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 14:51:48,594 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 14:51:48,595 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 14:51:48,598 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 14:51:48,599 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 14:51:48,600 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 14:51:48,600 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 14:51:48,602 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 14:51:48,605 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 14:51:48,610 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 14:51:48,612 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 14:51:48,613 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 14:51:48,613 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 14:51:48,614 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 14:51:48,615 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 14:51:48,621 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 14:51:48,621 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 14:51:48,621 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 14:51:48,622 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 14:51:48,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 14:51:48,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 14:51:48,623 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 14:51:48,625 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 14:51:48,625 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 14:51:48,626 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 14:51:48,626 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 14:51:48,627 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 14:51:48,627 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 14:51:48,627 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 14:51:48,627 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 14:51:48,628 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 14:51:48,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 14:51:48,630 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 14:51:48,640 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 14:51:48,640 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 14:51:48,643 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 14:51:48,643 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 14:51:48,643 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 14:51:48,643 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 14:51:48,643 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 14:51:48,644 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 14:51:48,644 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 14:51:48,644 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 14:51:48,645 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 14:51:48,645 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 14:51:48,645 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 14:51:48,645 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 14:51:48,645 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 14:51:48,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:51:48,645 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 14:51:48,646 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 14:51:48,647 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 14:51:48,647 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 14:51:48,650 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 14:51:48,651 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 14:51:48,652 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-08 14:51:48,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 14:51:48,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 14:51:48,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 14:51:48,887 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 14:51:48,891 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 14:51:48,892 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-08 14:51:48,956 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a3edcaf9/3616172650154a41be8fbbe56aff919d/FLAGc7730d27a [2022-04-08 14:51:49,330 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 14:51:49,330 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1b.cil.c [2022-04-08 14:51:49,336 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a3edcaf9/3616172650154a41be8fbbe56aff919d/FLAGc7730d27a [2022-04-08 14:51:49,346 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a3edcaf9/3616172650154a41be8fbbe56aff919d [2022-04-08 14:51:49,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 14:51:49,349 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 14:51:49,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 14:51:49,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 14:51:49,353 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 14:51:49,354 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:51:49" (1/1) ... [2022-04-08 14:51:49,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3543a10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:51:49, skipping insertion in model container [2022-04-08 14:51:49,355 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:51:49" (1/1) ... [2022-04-08 14:51:49,362 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 14:51:49,382 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 14:51:49,533 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-08 14:51:49,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:51:49,552 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 14:51:49,567 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-08 14:51:49,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:51:49,577 INFO L208 MainTranslator]: Completed translation [2022-04-08 14:51:49,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:51:49 WrapperNode [2022-04-08 14:51:49,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 14:51:49,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 14:51:49,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 14:51:49,578 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 14:51:49,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:51:49" (1/1) ... [2022-04-08 14:51:49,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:51:49" (1/1) ... [2022-04-08 14:51:49,591 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:51:49" (1/1) ... [2022-04-08 14:51:49,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:51:49" (1/1) ... [2022-04-08 14:51:49,596 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:51:49" (1/1) ... [2022-04-08 14:51:49,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:51:49" (1/1) ... [2022-04-08 14:51:49,602 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:51:49" (1/1) ... [2022-04-08 14:51:49,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 14:51:49,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 14:51:49,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 14:51:49,604 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 14:51:49,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:51:49" (1/1) ... [2022-04-08 14:51:49,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:51:49,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:51:49,632 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-08 14:51:49,645 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-08 14:51:49,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 14:51:49,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 14:51:49,676 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 14:51:49,676 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 14:51:49,676 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 14:51:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 14:51:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 14:51:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 14:51:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-08 14:51:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 14:51:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-08 14:51:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 14:51:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 14:51:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 14:51:49,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 14:51:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 14:51:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 14:51:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 14:51:49,738 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 14:51:49,740 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 14:51:49,887 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 14:51:49,892 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 14:51:49,892 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 14:51:49,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:51:49 BoogieIcfgContainer [2022-04-08 14:51:49,894 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 14:51:49,895 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 14:51:49,895 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 14:51:49,898 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 14:51:49,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:51:49" (1/3) ... [2022-04-08 14:51:49,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a2172b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:51:49, skipping insertion in model container [2022-04-08 14:51:49,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:51:49" (2/3) ... [2022-04-08 14:51:49,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a2172b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:51:49, skipping insertion in model container [2022-04-08 14:51:49,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:51:49" (3/3) ... [2022-04-08 14:51:49,900 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1b.cil.c [2022-04-08 14:51:49,904 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 14:51:49,905 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 14:51:49,937 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 14:51:49,942 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 14:51:49,943 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 14:51:49,958 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-08 14:51:49,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-08 14:51:49,964 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:51:49,964 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:51:49,965 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:51:49,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:51:49,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1468663722, now seen corresponding path program 1 times [2022-04-08 14:51:49,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:51:49,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1086856652] [2022-04-08 14:51:49,985 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:51:49,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1468663722, now seen corresponding path program 2 times [2022-04-08 14:51:49,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:51:49,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589866032] [2022-04-08 14:51:49,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:51:49,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:51:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:51:50,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:51:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:51:50,188 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-08 14:51:50,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 14:51:50,189 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #108#return; {32#true} is VALID [2022-04-08 14:51:50,193 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-08 14:51:50,193 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-08 14:51:50,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 14:51:50,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #108#return; {32#true} is VALID [2022-04-08 14:51:50,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-08 14:51:50,195 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-08 14:51:50,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {37#(= main_~blastFlag~0 0)} assume !false; {37#(= main_~blastFlag~0 0)} is VALID [2022-04-08 14:51:50,197 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-08 14:51:50,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-08 14:51:50,198 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-08 14:51:50,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:51:50,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589866032] [2022-04-08 14:51:50,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589866032] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:51:50,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:51:50,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:51:50,204 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:51:50,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1086856652] [2022-04-08 14:51:50,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1086856652] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:51:50,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:51:50,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:51:50,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144261452] [2022-04-08 14:51:50,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:51:50,212 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-08 14:51:50,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:51:50,216 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-08 14:51:50,238 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-08 14:51:50,238 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:51:50,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:51:50,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:51:50,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:51:50,266 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-08 14:51:50,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:50,524 INFO L93 Difference]: Finished difference Result 70 states and 115 transitions. [2022-04-08 14:51:50,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:51:50,525 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-08 14:51:50,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:51:50,526 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-08 14:51:50,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-08 14:51:50,534 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-08 14:51:50,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-08 14:51:50,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-08 14:51:50,711 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-08 14:51:50,719 INFO L225 Difference]: With dead ends: 70 [2022-04-08 14:51:50,719 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 14:51:50,721 INFO L912 BasicCegarLoop]: 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-08 14:51:50,724 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 79 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-08 14:51:50,725 INFO L914 BasicCegarLoop]: 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-08 14:51:50,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 14:51:50,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-08 14:51:50,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:51:50,753 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-08 14:51:50,754 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-08 14:51:50,755 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-08 14:51:50,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:50,759 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2022-04-08 14:51:50,759 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-04-08 14:51:50,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:51:50,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:51:50,761 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-08 14:51:50,761 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-08 14:51:50,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:50,765 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2022-04-08 14:51:50,765 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-04-08 14:51:50,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:51:50,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:51:50,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:51:50,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:51:50,766 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-08 14:51:50,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-04-08 14:51:50,770 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 9 [2022-04-08 14:51:50,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:51:50,770 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2022-04-08 14:51:50,771 INFO L479 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-08 14:51:50,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 53 transitions. [2022-04-08 14:51:50,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:51:50,866 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-04-08 14:51:50,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 14:51:50,866 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:51:50,867 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:51:50,867 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 14:51:50,867 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:51:50,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:51:50,868 INFO L85 PathProgramCache]: Analyzing trace with hash -968056640, now seen corresponding path program 1 times [2022-04-08 14:51:50,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:51:50,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2049793001] [2022-04-08 14:51:50,905 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:51:50,906 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:51:50,906 INFO L85 PathProgramCache]: Analyzing trace with hash -968056640, now seen corresponding path program 2 times [2022-04-08 14:51:50,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:51:50,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369492347] [2022-04-08 14:51:50,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:51:50,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:51:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:51:50,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:51:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:51:51,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {345#(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); {339#true} is VALID [2022-04-08 14:51:51,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {339#true} assume true; {339#true} is VALID [2022-04-08 14:51:51,001 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {339#true} {339#true} #108#return; {339#true} is VALID [2022-04-08 14:51:51,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {339#true} call ULTIMATE.init(); {345#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:51:51,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {345#(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); {339#true} is VALID [2022-04-08 14:51:51,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {339#true} assume true; {339#true} is VALID [2022-04-08 14:51:51,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {339#true} {339#true} #108#return; {339#true} is VALID [2022-04-08 14:51:51,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {339#true} call #t~ret6 := main(); {339#true} is VALID [2022-04-08 14:51:51,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {339#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; {339#true} is VALID [2022-04-08 14:51:51,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {339#true} assume !false; {339#true} is VALID [2022-04-08 14:51:51,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {339#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {339#true} is VALID [2022-04-08 14:51:51,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {339#true} assume 8466 == ~s__state~0; {339#true} is VALID [2022-04-08 14:51:51,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {339#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 2; {344#(= (+ (- 2) main_~blastFlag~0) 0)} is VALID [2022-04-08 14:51:51,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {344#(= (+ (- 2) main_~blastFlag~0) 0)} assume !(0 != ~s__hit~0);~s__state~0 := 8512; {344#(= (+ (- 2) main_~blastFlag~0) 0)} is VALID [2022-04-08 14:51:51,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {344#(= (+ (- 2) main_~blastFlag~0) 0)} assume !false; {344#(= (+ (- 2) main_~blastFlag~0) 0)} is VALID [2022-04-08 14:51:51,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {344#(= (+ (- 2) main_~blastFlag~0) 0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {340#false} is VALID [2022-04-08 14:51:51,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {340#false} assume !false; {340#false} is VALID [2022-04-08 14:51:51,007 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-08 14:51:51,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:51:51,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369492347] [2022-04-08 14:51:51,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369492347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:51:51,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:51:51,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:51:51,008 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:51:51,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2049793001] [2022-04-08 14:51:51,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2049793001] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:51:51,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:51:51,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:51:51,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005997083] [2022-04-08 14:51:51,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:51:51,010 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-08 14:51:51,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:51:51,010 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-08 14:51:51,031 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-08 14:51:51,031 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:51:51,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:51:51,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:51:51,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:51:51,032 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-08 14:51:51,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:51,169 INFO L93 Difference]: Finished difference Result 70 states and 103 transitions. [2022-04-08 14:51:51,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:51:51,169 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-08 14:51:51,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:51:51,170 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-08 14:51:51,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-04-08 14:51:51,172 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-08 14:51:51,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-04-08 14:51:51,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 84 transitions. [2022-04-08 14:51:51,254 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-08 14:51:51,257 INFO L225 Difference]: With dead ends: 70 [2022-04-08 14:51:51,257 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 14:51:51,258 INFO L912 BasicCegarLoop]: 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-08 14:51:51,259 INFO L913 BasicCegarLoop]: 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-08 14:51:51,260 INFO L914 BasicCegarLoop]: 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-08 14:51:51,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 14:51:51,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-08 14:51:51,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:51:51,269 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-08 14:51:51,270 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-08 14:51:51,270 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-08 14:51:51,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:51,273 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-08 14:51:51,273 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-08 14:51:51,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:51:51,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:51:51,275 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-08 14:51:51,275 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-08 14:51:51,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:51,278 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-08 14:51:51,278 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-08 14:51:51,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:51:51,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:51:51,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:51:51,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:51:51,280 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-08 14:51:51,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2022-04-08 14:51:51,282 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 14 [2022-04-08 14:51:51,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:51:51,283 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2022-04-08 14:51:51,283 INFO L479 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-08 14:51:51,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 71 transitions. [2022-04-08 14:51:51,347 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-08 14:51:51,347 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-08 14:51:51,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 14:51:51,348 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:51:51,348 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:51:51,348 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 14:51:51,348 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:51:51,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:51:51,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1990721020, now seen corresponding path program 1 times [2022-04-08 14:51:51,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:51:51,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [34855900] [2022-04-08 14:51:51,354 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:51:51,355 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:51:51,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1990721020, now seen corresponding path program 2 times [2022-04-08 14:51:51,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:51:51,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138264945] [2022-04-08 14:51:51,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:51:51,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:51:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:51:51,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:51:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:51:51,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {705#(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); {699#true} is VALID [2022-04-08 14:51:51,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {699#true} assume true; {699#true} is VALID [2022-04-08 14:51:51,399 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {699#true} {699#true} #108#return; {699#true} is VALID [2022-04-08 14:51:51,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {699#true} call ULTIMATE.init(); {705#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:51:51,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {705#(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); {699#true} is VALID [2022-04-08 14:51:51,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {699#true} assume true; {699#true} is VALID [2022-04-08 14:51:51,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {699#true} {699#true} #108#return; {699#true} is VALID [2022-04-08 14:51:51,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {699#true} call #t~ret6 := main(); {699#true} is VALID [2022-04-08 14:51:51,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {699#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; {699#true} is VALID [2022-04-08 14:51:51,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {699#true} assume !false; {699#true} is VALID [2022-04-08 14:51:51,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {699#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {699#true} is VALID [2022-04-08 14:51:51,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {699#true} assume 8466 == ~s__state~0; {699#true} is VALID [2022-04-08 14:51:51,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {699#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 2; {699#true} is VALID [2022-04-08 14:51:51,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {699#true} assume !(0 != ~s__hit~0);~s__state~0 := 8512; {704#(= (+ (- 8512) main_~s__state~0) 0)} is VALID [2022-04-08 14:51:51,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {704#(= (+ (- 8512) main_~s__state~0) 0)} assume !false; {704#(= (+ (- 8512) main_~s__state~0) 0)} is VALID [2022-04-08 14:51:51,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {704#(= (+ (- 8512) main_~s__state~0) 0)} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {704#(= (+ (- 8512) main_~s__state~0) 0)} is VALID [2022-04-08 14:51:51,403 INFO L290 TraceCheckUtils]: 13: Hoare triple {704#(= (+ (- 8512) main_~s__state~0) 0)} assume !(8466 == ~s__state~0); {704#(= (+ (- 8512) main_~s__state~0) 0)} is VALID [2022-04-08 14:51:51,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {704#(= (+ (- 8512) main_~s__state~0) 0)} assume !(8512 == ~s__state~0); {700#false} is VALID [2022-04-08 14:51:51,404 INFO L290 TraceCheckUtils]: 15: Hoare triple {700#false} assume !(8640 == ~s__state~0); {700#false} is VALID [2022-04-08 14:51:51,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {700#false} assume 8656 == ~s__state~0; {700#false} is VALID [2022-04-08 14:51:51,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {700#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {700#false} is VALID [2022-04-08 14:51:51,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {700#false} assume !(4 == ~blastFlag~0); {700#false} is VALID [2022-04-08 14:51:51,405 INFO L290 TraceCheckUtils]: 19: Hoare triple {700#false} assume 5 == ~blastFlag~0; {700#false} is VALID [2022-04-08 14:51:51,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {700#false} assume !false; {700#false} is VALID [2022-04-08 14:51:51,405 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-08 14:51:51,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:51:51,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138264945] [2022-04-08 14:51:51,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138264945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:51:51,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:51:51,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:51:51,406 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:51:51,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [34855900] [2022-04-08 14:51:51,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [34855900] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:51:51,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:51:51,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:51:51,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767607081] [2022-04-08 14:51:51,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:51:51,408 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-08 14:51:51,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:51:51,408 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-08 14:51:51,424 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-08 14:51:51,424 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:51:51,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:51:51,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:51:51,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:51:51,425 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-08 14:51:51,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:51,519 INFO L93 Difference]: Finished difference Result 93 states and 131 transitions. [2022-04-08 14:51:51,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:51:51,520 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-08 14:51:51,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:51:51,520 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-08 14:51:51,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-08 14:51:51,522 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-08 14:51:51,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-08 14:51:51,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2022-04-08 14:51:51,578 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-08 14:51:51,581 INFO L225 Difference]: With dead ends: 93 [2022-04-08 14:51:51,581 INFO L226 Difference]: Without dead ends: 62 [2022-04-08 14:51:51,581 INFO L912 BasicCegarLoop]: 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-08 14:51:51,582 INFO L913 BasicCegarLoop]: 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-08 14:51:51,583 INFO L914 BasicCegarLoop]: 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-08 14:51:51,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-08 14:51:51,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2022-04-08 14:51:51,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:51:51,594 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-08 14:51:51,594 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-08 14:51:51,595 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-08 14:51:51,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:51,597 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2022-04-08 14:51:51,598 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 81 transitions. [2022-04-08 14:51:51,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:51:51,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:51:51,599 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-08 14:51:51,599 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-08 14:51:51,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:51,601 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2022-04-08 14:51:51,601 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 81 transitions. [2022-04-08 14:51:51,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:51:51,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:51:51,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:51:51,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:51:51,603 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-08 14:51:51,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 80 transitions. [2022-04-08 14:51:51,605 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 80 transitions. Word has length 21 [2022-04-08 14:51:51,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:51:51,605 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 80 transitions. [2022-04-08 14:51:51,605 INFO L479 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-08 14:51:51,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 80 transitions. [2022-04-08 14:51:51,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:51:51,681 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2022-04-08 14:51:51,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 14:51:51,682 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:51:51,682 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:51:51,682 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 14:51:51,682 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:51:51,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:51:51,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1603181698, now seen corresponding path program 1 times [2022-04-08 14:51:51,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:51:51,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [9389421] [2022-04-08 14:51:51,688 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:51:51,688 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:51:51,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1603181698, now seen corresponding path program 2 times [2022-04-08 14:51:51,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:51:51,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346255539] [2022-04-08 14:51:51,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:51:51,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:51:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:51:51,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:51:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:51:51,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {1147#(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); {1141#true} is VALID [2022-04-08 14:51:51,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {1141#true} assume true; {1141#true} is VALID [2022-04-08 14:51:51,734 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1141#true} {1141#true} #108#return; {1141#true} is VALID [2022-04-08 14:51:51,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {1141#true} call ULTIMATE.init(); {1147#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:51:51,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {1147#(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); {1141#true} is VALID [2022-04-08 14:51:51,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {1141#true} assume true; {1141#true} is VALID [2022-04-08 14:51:51,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1141#true} {1141#true} #108#return; {1141#true} is VALID [2022-04-08 14:51:51,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {1141#true} call #t~ret6 := main(); {1141#true} is VALID [2022-04-08 14:51:51,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {1141#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; {1141#true} is VALID [2022-04-08 14:51:51,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {1141#true} assume !false; {1141#true} is VALID [2022-04-08 14:51:51,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {1141#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1141#true} is VALID [2022-04-08 14:51:51,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {1141#true} assume 8466 == ~s__state~0; {1141#true} is VALID [2022-04-08 14:51:51,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {1141#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 2; {1141#true} is VALID [2022-04-08 14:51:51,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {1141#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {1141#true} is VALID [2022-04-08 14:51:51,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {1141#true} assume !false; {1141#true} is VALID [2022-04-08 14:51:51,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {1141#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1141#true} is VALID [2022-04-08 14:51:51,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {1141#true} assume !(8466 == ~s__state~0); {1141#true} is VALID [2022-04-08 14:51:51,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {1141#true} assume !(8512 == ~s__state~0); {1141#true} is VALID [2022-04-08 14:51:51,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {1141#true} assume !(8640 == ~s__state~0); {1141#true} is VALID [2022-04-08 14:51:51,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {1141#true} assume 8656 == ~s__state~0; {1141#true} is VALID [2022-04-08 14:51:51,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {1141#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {1146#(= 3 main_~blastFlag~0)} is VALID [2022-04-08 14:51:51,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {1146#(= 3 main_~blastFlag~0)} assume !(4 == ~blastFlag~0); {1146#(= 3 main_~blastFlag~0)} is VALID [2022-04-08 14:51:51,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {1146#(= 3 main_~blastFlag~0)} assume 5 == ~blastFlag~0; {1142#false} is VALID [2022-04-08 14:51:51,739 INFO L290 TraceCheckUtils]: 20: Hoare triple {1142#false} assume !false; {1142#false} is VALID [2022-04-08 14:51:51,739 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-08 14:51:51,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:51:51,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346255539] [2022-04-08 14:51:51,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346255539] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:51:51,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:51:51,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:51:51,740 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:51:51,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [9389421] [2022-04-08 14:51:51,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [9389421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:51:51,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:51:51,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:51:51,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255861381] [2022-04-08 14:51:51,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:51:51,742 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-08 14:51:51,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:51:51,742 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-08 14:51:51,756 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-08 14:51:51,757 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:51:51,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:51:51,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:51:51,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:51:51,758 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-08 14:51:51,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:51,872 INFO L93 Difference]: Finished difference Result 120 states and 167 transitions. [2022-04-08 14:51:51,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:51:51,872 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-08 14:51:51,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:51:51,872 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-08 14:51:51,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-04-08 14:51:51,874 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-08 14:51:51,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-04-08 14:51:51,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 89 transitions. [2022-04-08 14:51:51,949 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-08 14:51:51,951 INFO L225 Difference]: With dead ends: 120 [2022-04-08 14:51:51,952 INFO L226 Difference]: Without dead ends: 81 [2022-04-08 14:51:51,952 INFO L912 BasicCegarLoop]: 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-08 14:51:51,953 INFO L913 BasicCegarLoop]: 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-08 14:51:51,953 INFO L914 BasicCegarLoop]: 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-08 14:51:51,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-08 14:51:51,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2022-04-08 14:51:51,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:51:51,963 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-08 14:51:51,964 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-08 14:51:51,964 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-08 14:51:51,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:51,967 INFO L93 Difference]: Finished difference Result 81 states and 107 transitions. [2022-04-08 14:51:51,967 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 107 transitions. [2022-04-08 14:51:51,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:51:51,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:51:51,968 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-08 14:51:51,968 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-08 14:51:51,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:51,974 INFO L93 Difference]: Finished difference Result 81 states and 107 transitions. [2022-04-08 14:51:51,974 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 107 transitions. [2022-04-08 14:51:51,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:51:51,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:51:51,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:51:51,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:51:51,977 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-08 14:51:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 106 transitions. [2022-04-08 14:51:51,979 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 106 transitions. Word has length 21 [2022-04-08 14:51:51,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:51:51,979 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 106 transitions. [2022-04-08 14:51:51,980 INFO L479 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-08 14:51:51,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 106 transitions. [2022-04-08 14:51:52,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:51:52,090 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 106 transitions. [2022-04-08 14:51:52,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 14:51:52,091 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:51:52,091 INFO L499 BasicCegarLoop]: 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-08 14:51:52,091 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 14:51:52,091 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:51:52,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:51:52,092 INFO L85 PathProgramCache]: Analyzing trace with hash 351223625, now seen corresponding path program 1 times [2022-04-08 14:51:52,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:51:52,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1790276526] [2022-04-08 14:51:52,102 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:51:52,102 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:51:52,102 INFO L85 PathProgramCache]: Analyzing trace with hash 351223625, now seen corresponding path program 2 times [2022-04-08 14:51:52,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:51:52,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684447788] [2022-04-08 14:51:52,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:51:52,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:51:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:51:52,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:51:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:51:52,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {1719#(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); {1713#true} is VALID [2022-04-08 14:51:52,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {1713#true} assume true; {1713#true} is VALID [2022-04-08 14:51:52,151 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1713#true} {1713#true} #108#return; {1713#true} is VALID [2022-04-08 14:51:52,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {1713#true} call ULTIMATE.init(); {1719#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:51:52,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {1719#(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); {1713#true} is VALID [2022-04-08 14:51:52,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {1713#true} assume true; {1713#true} is VALID [2022-04-08 14:51:52,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1713#true} {1713#true} #108#return; {1713#true} is VALID [2022-04-08 14:51:52,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {1713#true} call #t~ret6 := main(); {1713#true} is VALID [2022-04-08 14:51:52,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {1713#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; {1713#true} is VALID [2022-04-08 14:51:52,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {1713#true} assume !false; {1713#true} is VALID [2022-04-08 14:51:52,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {1713#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1713#true} is VALID [2022-04-08 14:51:52,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {1713#true} assume 8466 == ~s__state~0; {1713#true} is VALID [2022-04-08 14:51:52,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {1713#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 2; {1713#true} is VALID [2022-04-08 14:51:52,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {1713#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {1713#true} is VALID [2022-04-08 14:51:52,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {1713#true} assume !false; {1713#true} is VALID [2022-04-08 14:51:52,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {1713#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1713#true} is VALID [2022-04-08 14:51:52,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {1713#true} assume !(8466 == ~s__state~0); {1713#true} is VALID [2022-04-08 14:51:52,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {1713#true} assume !(8512 == ~s__state~0); {1713#true} is VALID [2022-04-08 14:51:52,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {1713#true} assume !(8640 == ~s__state~0); {1713#true} is VALID [2022-04-08 14:51:52,154 INFO L290 TraceCheckUtils]: 16: Hoare triple {1713#true} assume 8656 == ~s__state~0; {1713#true} is VALID [2022-04-08 14:51:52,154 INFO L290 TraceCheckUtils]: 17: Hoare triple {1713#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {1713#true} is VALID [2022-04-08 14:51:52,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {1713#true} assume !(4 == ~blastFlag~0); {1713#true} is VALID [2022-04-08 14:51:52,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {1713#true} assume !(5 == ~blastFlag~0); {1713#true} is VALID [2022-04-08 14:51:52,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {1713#true} assume 0 != ~s__hit~0;~s__state~0 := 8640; {1718#(<= 8640 main_~s__state~0)} is VALID [2022-04-08 14:51:52,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {1718#(<= 8640 main_~s__state~0)} assume !false; {1718#(<= 8640 main_~s__state~0)} is VALID [2022-04-08 14:51:52,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {1718#(<= 8640 main_~s__state~0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {1714#false} is VALID [2022-04-08 14:51:52,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {1714#false} assume !false; {1714#false} is VALID [2022-04-08 14:51:52,157 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-08 14:51:52,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:51:52,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684447788] [2022-04-08 14:51:52,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684447788] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:51:52,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:51:52,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:51:52,157 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:51:52,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1790276526] [2022-04-08 14:51:52,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1790276526] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:51:52,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:51:52,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:51:52,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098116780] [2022-04-08 14:51:52,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:51:52,158 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-08 14:51:52,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:51:52,159 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-08 14:51:52,173 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-08 14:51:52,174 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:51:52,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:51:52,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:51:52,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:51:52,174 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-08 14:51:52,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:52,303 INFO L93 Difference]: Finished difference Result 148 states and 201 transitions. [2022-04-08 14:51:52,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:51:52,303 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-08 14:51:52,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:51:52,304 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-08 14:51:52,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-04-08 14:51:52,306 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-08 14:51:52,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-04-08 14:51:52,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 71 transitions. [2022-04-08 14:51:52,359 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-08 14:51:52,361 INFO L225 Difference]: With dead ends: 148 [2022-04-08 14:51:52,361 INFO L226 Difference]: Without dead ends: 61 [2022-04-08 14:51:52,362 INFO L912 BasicCegarLoop]: 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-08 14:51:52,363 INFO L913 BasicCegarLoop]: 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-08 14:51:52,365 INFO L914 BasicCegarLoop]: 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-08 14:51:52,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-08 14:51:52,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-04-08 14:51:52,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:51:52,400 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-08 14:51:52,401 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-08 14:51:52,401 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-08 14:51:52,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:52,403 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-08 14:51:52,403 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-08 14:51:52,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:51:52,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:51:52,403 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-08 14:51:52,404 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-08 14:51:52,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:52,405 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-08 14:51:52,405 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-04-08 14:51:52,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:51:52,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:51:52,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:51:52,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:51:52,406 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-08 14:51:52,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2022-04-08 14:51:52,408 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 24 [2022-04-08 14:51:52,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:51:52,408 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2022-04-08 14:51:52,408 INFO L479 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-08 14:51:52,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 70 transitions. [2022-04-08 14:51:52,470 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-08 14:51:52,470 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2022-04-08 14:51:52,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 14:51:52,471 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:51:52,471 INFO L499 BasicCegarLoop]: 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-08 14:51:52,471 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 14:51:52,471 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:51:52,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:51:52,472 INFO L85 PathProgramCache]: Analyzing trace with hash 322478086, now seen corresponding path program 1 times [2022-04-08 14:51:52,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:51:52,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1463847113] [2022-04-08 14:51:52,481 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:51:52,481 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:51:52,481 INFO L85 PathProgramCache]: Analyzing trace with hash 322478086, now seen corresponding path program 2 times [2022-04-08 14:51:52,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:51:52,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201349606] [2022-04-08 14:51:52,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:51:52,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:51:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:51:52,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:51:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:51:52,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {2267#(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); {2261#true} is VALID [2022-04-08 14:51:52,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {2261#true} assume true; {2261#true} is VALID [2022-04-08 14:51:52,535 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2261#true} {2261#true} #108#return; {2261#true} is VALID [2022-04-08 14:51:52,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {2261#true} call ULTIMATE.init(); {2267#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:51:52,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {2267#(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); {2261#true} is VALID [2022-04-08 14:51:52,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {2261#true} assume true; {2261#true} is VALID [2022-04-08 14:51:52,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2261#true} {2261#true} #108#return; {2261#true} is VALID [2022-04-08 14:51:52,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {2261#true} call #t~ret6 := main(); {2261#true} is VALID [2022-04-08 14:51:52,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {2261#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; {2261#true} is VALID [2022-04-08 14:51:52,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {2261#true} assume !false; {2261#true} is VALID [2022-04-08 14:51:52,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {2261#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {2261#true} is VALID [2022-04-08 14:51:52,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {2261#true} assume 8466 == ~s__state~0; {2261#true} is VALID [2022-04-08 14:51:52,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {2261#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 2; {2261#true} is VALID [2022-04-08 14:51:52,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {2261#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {2266#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:52,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {2266#(not (= main_~s__hit~0 0))} assume !false; {2266#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:52,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {2266#(not (= main_~s__hit~0 0))} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {2266#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:52,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {2266#(not (= main_~s__hit~0 0))} assume !(8466 == ~s__state~0); {2266#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:52,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {2266#(not (= main_~s__hit~0 0))} assume !(8512 == ~s__state~0); {2266#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:52,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {2266#(not (= main_~s__hit~0 0))} assume !(8640 == ~s__state~0); {2266#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:52,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {2266#(not (= main_~s__hit~0 0))} assume 8656 == ~s__state~0; {2266#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:52,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {2266#(not (= main_~s__hit~0 0))} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {2266#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:52,541 INFO L290 TraceCheckUtils]: 18: Hoare triple {2266#(not (= main_~s__hit~0 0))} assume !(4 == ~blastFlag~0); {2266#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:52,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {2266#(not (= main_~s__hit~0 0))} assume !(5 == ~blastFlag~0); {2266#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:52,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {2266#(not (= main_~s__hit~0 0))} assume 0 != ~s__hit~0;~s__state~0 := 8640; {2266#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:52,542 INFO L290 TraceCheckUtils]: 21: Hoare triple {2266#(not (= main_~s__hit~0 0))} assume !false; {2266#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:52,542 INFO L290 TraceCheckUtils]: 22: Hoare triple {2266#(not (= main_~s__hit~0 0))} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {2266#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:52,542 INFO L290 TraceCheckUtils]: 23: Hoare triple {2266#(not (= main_~s__hit~0 0))} assume !(8466 == ~s__state~0); {2266#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:52,543 INFO L290 TraceCheckUtils]: 24: Hoare triple {2266#(not (= main_~s__hit~0 0))} assume !(8512 == ~s__state~0); {2266#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:52,543 INFO L290 TraceCheckUtils]: 25: Hoare triple {2266#(not (= main_~s__hit~0 0))} assume 8640 == ~s__state~0; {2266#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:52,543 INFO L290 TraceCheckUtils]: 26: Hoare triple {2266#(not (= main_~s__hit~0 0))} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {2266#(not (= main_~s__hit~0 0))} is VALID [2022-04-08 14:51:52,544 INFO L290 TraceCheckUtils]: 27: Hoare triple {2266#(not (= main_~s__hit~0 0))} assume !(0 != ~s__hit~0);~s__state~0 := 8656; {2262#false} is VALID [2022-04-08 14:51:52,544 INFO L290 TraceCheckUtils]: 28: Hoare triple {2262#false} assume !false; {2262#false} is VALID [2022-04-08 14:51:52,544 INFO L290 TraceCheckUtils]: 29: Hoare triple {2262#false} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {2262#false} is VALID [2022-04-08 14:51:52,544 INFO L290 TraceCheckUtils]: 30: Hoare triple {2262#false} assume !(8466 == ~s__state~0); {2262#false} is VALID [2022-04-08 14:51:52,544 INFO L290 TraceCheckUtils]: 31: Hoare triple {2262#false} assume !(8512 == ~s__state~0); {2262#false} is VALID [2022-04-08 14:51:52,545 INFO L290 TraceCheckUtils]: 32: Hoare triple {2262#false} assume !(8640 == ~s__state~0); {2262#false} is VALID [2022-04-08 14:51:52,545 INFO L290 TraceCheckUtils]: 33: Hoare triple {2262#false} assume 8656 == ~s__state~0; {2262#false} is VALID [2022-04-08 14:51:52,545 INFO L290 TraceCheckUtils]: 34: Hoare triple {2262#false} assume !(2 == ~blastFlag~0); {2262#false} is VALID [2022-04-08 14:51:52,545 INFO L290 TraceCheckUtils]: 35: Hoare triple {2262#false} assume !(4 == ~blastFlag~0); {2262#false} is VALID [2022-04-08 14:51:52,545 INFO L290 TraceCheckUtils]: 36: Hoare triple {2262#false} assume 5 == ~blastFlag~0; {2262#false} is VALID [2022-04-08 14:51:52,545 INFO L290 TraceCheckUtils]: 37: Hoare triple {2262#false} assume !false; {2262#false} is VALID [2022-04-08 14:51:52,546 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-08 14:51:52,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:51:52,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201349606] [2022-04-08 14:51:52,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201349606] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:51:52,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:51:52,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:51:52,546 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:51:52,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1463847113] [2022-04-08 14:51:52,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1463847113] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:51:52,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:51:52,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:51:52,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957103022] [2022-04-08 14:51:52,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:51:52,547 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-08 14:51:52,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:51:52,548 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-08 14:51:52,568 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-08 14:51:52,568 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:51:52,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:51:52,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:51:52,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:51:52,569 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-08 14:51:52,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:52,656 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2022-04-08 14:51:52,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:51:52,657 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-08 14:51:52,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:51:52,657 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-08 14:51:52,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-04-08 14:51:52,658 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-08 14:51:52,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-04-08 14:51:52,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 61 transitions. [2022-04-08 14:51:52,704 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-08 14:51:52,705 INFO L225 Difference]: With dead ends: 92 [2022-04-08 14:51:52,705 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 14:51:52,705 INFO L912 BasicCegarLoop]: 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-08 14:51:52,706 INFO L913 BasicCegarLoop]: 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-08 14:51:52,706 INFO L914 BasicCegarLoop]: 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-08 14:51:52,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 14:51:52,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 14:51:52,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:51:52,707 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-08 14:51:52,707 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-08 14:51:52,707 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-08 14:51:52,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:52,707 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 14:51:52,707 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:51:52,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:51:52,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:51:52,708 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-08 14:51:52,708 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-08 14:51:52,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:51:52,708 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 14:51:52,708 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:51:52,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:51:52,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:51:52,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:51:52,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:51:52,708 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-08 14:51:52,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 14:51:52,708 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2022-04-08 14:51:52,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:51:52,708 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 14:51:52,709 INFO L479 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-08 14:51:52,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 14:51:52,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:51:52,709 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 14:51:52,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:51:52,711 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 14:51:52,711 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 14:51:52,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 14:51:53,100 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 13) no Hoare annotation was computed. [2022-04-08 14:51:53,100 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 13) no Hoare annotation was computed. [2022-04-08 14:51:53,100 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 13) no Hoare annotation was computed. [2022-04-08 14:51:53,100 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 20 152) the Hoare annotation is: true [2022-04-08 14:51:53,100 INFO L878 garLoopResultBuilder]: At program point L89-1(lines 65 118) the Hoare annotation is: (let ((.cse0 (<= 8640 main_~s__state~0))) (or (and .cse0 (= 2 main_~blastFlag~0)) (and (= main_~blastFlag~0 0) .cse0) (and (not (= main_~s__hit~0 0)) .cse0))) [2022-04-08 14:51:53,100 INFO L878 garLoopResultBuilder]: At program point L81(lines 81 85) 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-08 14:51:53,101 INFO L878 garLoopResultBuilder]: At program point L36(lines 36 139) 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-08 14:51:53,101 INFO L878 garLoopResultBuilder]: At program point L69-1(lines 65 118) the Hoare annotation is: (= (+ (- 2) main_~blastFlag~0) 0) [2022-04-08 14:51:53,101 INFO L878 garLoopResultBuilder]: At program point L61(lines 61 120) 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-08 14:51:53,101 INFO L878 garLoopResultBuilder]: At program point L57(lines 57 122) 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-08 14:51:53,101 INFO L885 garLoopResultBuilder]: At program point L148(lines 20 152) the Hoare annotation is: true [2022-04-08 14:51:53,101 INFO L878 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-08 14:51:53,101 INFO L878 garLoopResultBuilder]: At program point L107(lines 107 109) the Hoare annotation is: (let ((.cse0 (<= 8640 main_~s__state~0))) (or (and (= main_~blastFlag~0 0) .cse0) (and (= 3 main_~blastFlag~0) .cse0))) [2022-04-08 14:51:53,101 INFO L878 garLoopResultBuilder]: At program point L41(lines 41 136) 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-08 14:51:53,101 INFO L878 garLoopResultBuilder]: At program point L37(lines 36 139) the Hoare annotation is: (or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-08 14:51:53,101 INFO L878 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-08 14:51:53,102 INFO L878 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-08 14:51:53,102 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 20 152) the Hoare annotation is: true [2022-04-08 14:51:53,102 INFO L878 garLoopResultBuilder]: At program point L108(lines 20 152) the Hoare annotation is: false [2022-04-08 14:51:53,102 INFO L878 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-08 14:51:53,102 INFO L878 garLoopResultBuilder]: At program point L104-1(lines 65 118) the Hoare annotation is: (let ((.cse0 (<= 8640 main_~s__state~0))) (or (and (= main_~blastFlag~0 0) .cse0) (and (= 3 main_~blastFlag~0) .cse0))) [2022-04-08 14:51:53,102 INFO L878 garLoopResultBuilder]: At program point L100-1(lines 65 118) the Hoare annotation is: (let ((.cse0 (<= 8640 main_~s__state~0))) (or (and (= main_~blastFlag~0 0) .cse0) (and (= 3 main_~blastFlag~0) .cse0))) [2022-04-08 14:51:53,102 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 150) the Hoare annotation is: false [2022-04-08 14:51:53,102 INFO L878 garLoopResultBuilder]: At program point L30(line 30) 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-08 14:51:53,102 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 20 152) the Hoare annotation is: true [2022-04-08 14:51:53,102 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 14:51:53,102 INFO L878 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-08 14:51:53,103 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 14:51:53,103 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 14:51:53,103 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 14:51:53,103 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 14:51:53,103 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 14:51:53,105 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2] [2022-04-08 14:51:53,106 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 14:51:53,109 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 14:51:53,111 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 14:51:53,127 INFO L163 areAnnotationChecker]: CFG has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 14:51:53,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 02:51:53 BoogieIcfgContainer [2022-04-08 14:51:53,136 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 14:51:53,137 INFO L158 Benchmark]: Toolchain (without parser) took 3787.87ms. Allocated memory was 188.7MB in the beginning and 232.8MB in the end (delta: 44.0MB). Free memory was 139.9MB in the beginning and 113.6MB in the end (delta: 26.3MB). Peak memory consumption was 70.2MB. Max. memory is 8.0GB. [2022-04-08 14:51:53,137 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 188.7MB. Free memory was 156.1MB in the beginning and 156.1MB in the end (delta: 74.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 14:51:53,137 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.50ms. Allocated memory is still 188.7MB. Free memory was 139.7MB in the beginning and 164.2MB in the end (delta: -24.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 14:51:53,138 INFO L158 Benchmark]: Boogie Preprocessor took 25.19ms. Allocated memory is still 188.7MB. Free memory was 164.2MB in the beginning and 162.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 14:51:53,138 INFO L158 Benchmark]: RCFGBuilder took 290.16ms. Allocated memory is still 188.7MB. Free memory was 162.6MB in the beginning and 151.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 14:51:53,138 INFO L158 Benchmark]: TraceAbstraction took 3240.48ms. Allocated memory was 188.7MB in the beginning and 232.8MB in the end (delta: 44.0MB). Free memory was 150.6MB in the beginning and 113.6MB in the end (delta: 37.0MB). Peak memory consumption was 81.3MB. Max. memory is 8.0GB. [2022-04-08 14:51:53,139 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 188.7MB. Free memory was 156.1MB in the beginning and 156.1MB in the end (delta: 74.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 227.50ms. Allocated memory is still 188.7MB. Free memory was 139.7MB in the beginning and 164.2MB in the end (delta: -24.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.19ms. Allocated memory is still 188.7MB. Free memory was 164.2MB in the beginning and 162.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 290.16ms. Allocated memory is still 188.7MB. Free memory was 162.6MB in the beginning and 151.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3240.48ms. Allocated memory was 188.7MB in the beginning and 232.8MB in the end (delta: 44.0MB). Free memory was 150.6MB in the beginning and 113.6MB in the end (delta: 37.0MB). Peak memory consumption was 81.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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: 3.2s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 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, 29 LocationsWithAnnotation, 29 PreInvPairs, 103 NumberOfFragments, 303 HoareAnnotationTreeSize, 29 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 29 FomulaSimplificationsInter, 322 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 - ProcedureContractResult [Line: 20]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 14:51:53,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...