/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-zilu/benchmark25_linear.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:44:20,130 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:44:20,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:44:20,191 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:44:20,191 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:44:20,192 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:44:20,195 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:44:20,198 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:44:20,200 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:44:20,204 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:44:20,204 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:44:20,205 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:44:20,205 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:44:20,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:44:20,206 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:44:20,207 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:44:20,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:44:20,208 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:44:20,208 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:44:20,209 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:44:20,210 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:44:20,216 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:44:20,217 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:44:20,220 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:44:20,221 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:44:20,227 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:44:20,227 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:44:20,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:44:20,228 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:44:20,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:44:20,229 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:44:20,229 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:44:20,231 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:44:20,231 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:44:20,231 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:44:20,232 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:44:20,232 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:44:20,233 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:44:20,233 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:44:20,233 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:44:20,233 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:44:20,236 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:44:20,237 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 11:44:20,263 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:44:20,263 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:44:20,263 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:44:20,263 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:44:20,264 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:44:20,264 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:44:20,264 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:44:20,265 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:44:20,265 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:44:20,265 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:44:20,265 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:44:20,265 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:44:20,265 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:44:20,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:44:20,265 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:44:20,265 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:44:20,266 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:44:20,266 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:44:20,266 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:44:20,266 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:44:20,266 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:44:20,266 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:44:20,266 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:44:20,266 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:44:20,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:44:20,267 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:44:20,267 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:44:20,267 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:44:20,267 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:44:20,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:44:20,267 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:44:20,267 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:44:20,268 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:44:20,268 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 11:44:20,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:44:20,429 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:44:20,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:44:20,431 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:44:20,432 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:44:20,433 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark25_linear.i [2022-04-27 11:44:20,475 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f42d3c1ad/ebeede6095d94c3eb0a4da2be6f95a9a/FLAG0e87ee6ba [2022-04-27 11:44:20,779 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:44:20,779 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark25_linear.i [2022-04-27 11:44:20,784 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f42d3c1ad/ebeede6095d94c3eb0a4da2be6f95a9a/FLAG0e87ee6ba [2022-04-27 11:44:21,208 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f42d3c1ad/ebeede6095d94c3eb0a4da2be6f95a9a [2022-04-27 11:44:21,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:44:21,213 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:44:21,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:44:21,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:44:21,217 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:44:21,218 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:44:21" (1/1) ... [2022-04-27 11:44:21,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7443077b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:21, skipping insertion in model container [2022-04-27 11:44:21,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:44:21" (1/1) ... [2022-04-27 11:44:21,224 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:44:21,234 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:44:21,363 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark25_linear.i[868,881] [2022-04-27 11:44:21,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:44:21,384 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:44:21,393 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark25_linear.i[868,881] [2022-04-27 11:44:21,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:44:21,410 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:44:21,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:21 WrapperNode [2022-04-27 11:44:21,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:44:21,411 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:44:21,411 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:44:21,412 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:44:21,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:21" (1/1) ... [2022-04-27 11:44:21,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:21" (1/1) ... [2022-04-27 11:44:21,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:21" (1/1) ... [2022-04-27 11:44:21,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:21" (1/1) ... [2022-04-27 11:44:21,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:21" (1/1) ... [2022-04-27 11:44:21,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:21" (1/1) ... [2022-04-27 11:44:21,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:21" (1/1) ... [2022-04-27 11:44:21,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:44:21,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:44:21,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:44:21,437 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:44:21,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:21" (1/1) ... [2022-04-27 11:44:21,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:44:21,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:44:21,458 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 11:44:21,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 11:44:21,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:44:21,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:44:21,488 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:44:21,488 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:44:21,490 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:44:21,490 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:44:21,490 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 11:44:21,490 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 11:44:21,490 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:44:21,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:44:21,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 11:44:21,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-27 11:44:21,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:44:21,490 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:44:21,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:44:21,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:44:21,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:44:21,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:44:21,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:44:21,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:44:21,543 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:44:21,544 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:44:21,642 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:44:21,646 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:44:21,647 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 11:44:21,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:44:21 BoogieIcfgContainer [2022-04-27 11:44:21,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:44:21,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:44:21,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:44:21,651 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:44:21,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:44:21" (1/3) ... [2022-04-27 11:44:21,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@319fe6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:44:21, skipping insertion in model container [2022-04-27 11:44:21,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:44:21" (2/3) ... [2022-04-27 11:44:21,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@319fe6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:44:21, skipping insertion in model container [2022-04-27 11:44:21,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:44:21" (3/3) ... [2022-04-27 11:44:21,653 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark25_linear.i [2022-04-27 11:44:21,662 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:44:21,662 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:44:21,691 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:44:21,695 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2ac8e0ac, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6a88ad9b [2022-04-27 11:44:21,695 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:44:21,701 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:44:21,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 11:44:21,705 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:44:21,706 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:44:21,716 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:44:21,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:44:21,720 INFO L85 PathProgramCache]: Analyzing trace with hash -304977768, now seen corresponding path program 1 times [2022-04-27 11:44:21,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:44:21,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605543652] [2022-04-27 11:44:21,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:44:21,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:44:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:21,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:44:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:21,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(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(21, 2); {23#true} is VALID [2022-04-27 11:44:21,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-27 11:44:21,900 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #45#return; {23#true} is VALID [2022-04-27 11:44:21,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:44:21,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(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(21, 2); {23#true} is VALID [2022-04-27 11:44:21,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-27 11:44:21,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #45#return; {23#true} is VALID [2022-04-27 11:44:21,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret2 := main(); {23#true} is VALID [2022-04-27 11:44:21,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1; {23#true} is VALID [2022-04-27 11:44:21,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !!(~x~0 < 0); {28#(<= (+ main_~x~0 1) 0)} is VALID [2022-04-27 11:44:21,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#(<= (+ main_~x~0 1) 0)} assume !(~x~0 < 10); {24#false} is VALID [2022-04-27 11:44:21,904 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} call __VERIFIER_assert((if 10 == ~x~0 then 1 else 0)); {24#false} is VALID [2022-04-27 11:44:21,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-27 11:44:21,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-27 11:44:21,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-27 11:44:21,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:44:21,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:44:21,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605543652] [2022-04-27 11:44:21,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605543652] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:44:21,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:44:21,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 11:44:21,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233382969] [2022-04-27 11:44:21,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:44:21,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 11:44:21,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:44:21,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:21,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:44:21,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:44:21,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:44:21,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:44:21,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 11:44:21,956 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:22,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:22,076 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-27 11:44:22,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 11:44:22,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 11:44:22,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:44:22,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:22,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-04-27 11:44:22,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:22,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-04-27 11:44:22,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 39 transitions. [2022-04-27 11:44:22,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:44:22,136 INFO L225 Difference]: With dead ends: 33 [2022-04-27 11:44:22,136 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 11:44:22,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:44:22,140 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:44:22,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 28 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:44:22,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 11:44:22,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 11:44:22,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:44:22,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:22,166 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:22,167 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:22,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:22,168 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 11:44:22,168 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 11:44:22,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:22,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:44:22,169 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 11:44:22,169 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 11:44:22,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:22,170 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 11:44:22,170 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 11:44:22,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:22,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:44:22,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:44:22,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:44:22,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:22,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-27 11:44:22,172 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-27 11:44:22,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:44:22,173 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-27 11:44:22,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:22,173 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 11:44:22,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 11:44:22,173 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:44:22,173 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:44:22,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:44:22,174 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:44:22,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:44:22,174 INFO L85 PathProgramCache]: Analyzing trace with hash -828987386, now seen corresponding path program 1 times [2022-04-27 11:44:22,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:44:22,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206233725] [2022-04-27 11:44:22,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:44:22,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:44:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:22,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:44:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:22,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {134#(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(21, 2); {127#true} is VALID [2022-04-27 11:44:22,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {127#true} assume true; {127#true} is VALID [2022-04-27 11:44:22,220 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {127#true} {127#true} #45#return; {127#true} is VALID [2022-04-27 11:44:22,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {127#true} call ULTIMATE.init(); {134#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:44:22,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {134#(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(21, 2); {127#true} is VALID [2022-04-27 11:44:22,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {127#true} assume true; {127#true} is VALID [2022-04-27 11:44:22,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127#true} {127#true} #45#return; {127#true} is VALID [2022-04-27 11:44:22,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {127#true} call #t~ret2 := main(); {127#true} is VALID [2022-04-27 11:44:22,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {127#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1; {127#true} is VALID [2022-04-27 11:44:22,223 INFO L290 TraceCheckUtils]: 6: Hoare triple {127#true} assume !!(~x~0 < 0); {132#(<= (+ main_~x~0 1) 0)} is VALID [2022-04-27 11:44:22,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {132#(<= (+ main_~x~0 1) 0)} assume !!(~x~0 < 10);~x~0 := 1 + ~x~0; {133#(<= main_~x~0 0)} is VALID [2022-04-27 11:44:22,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {133#(<= main_~x~0 0)} assume !(~x~0 < 10); {128#false} is VALID [2022-04-27 11:44:22,224 INFO L272 TraceCheckUtils]: 9: Hoare triple {128#false} call __VERIFIER_assert((if 10 == ~x~0 then 1 else 0)); {128#false} is VALID [2022-04-27 11:44:22,224 INFO L290 TraceCheckUtils]: 10: Hoare triple {128#false} ~cond := #in~cond; {128#false} is VALID [2022-04-27 11:44:22,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {128#false} assume 0 == ~cond; {128#false} is VALID [2022-04-27 11:44:22,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {128#false} assume !false; {128#false} is VALID [2022-04-27 11:44:22,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:44:22,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:44:22,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206233725] [2022-04-27 11:44:22,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206233725] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:44:22,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908482570] [2022-04-27 11:44:22,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:44:22,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:44:22,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:44:22,228 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:44:22,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 11:44:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:22,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 11:44:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:22,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:44:22,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {127#true} call ULTIMATE.init(); {127#true} is VALID [2022-04-27 11:44:22,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {127#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {127#true} is VALID [2022-04-27 11:44:22,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {127#true} assume true; {127#true} is VALID [2022-04-27 11:44:22,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127#true} {127#true} #45#return; {127#true} is VALID [2022-04-27 11:44:22,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {127#true} call #t~ret2 := main(); {127#true} is VALID [2022-04-27 11:44:22,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {127#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1; {127#true} is VALID [2022-04-27 11:44:22,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {127#true} assume !!(~x~0 < 0); {132#(<= (+ main_~x~0 1) 0)} is VALID [2022-04-27 11:44:22,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {132#(<= (+ main_~x~0 1) 0)} assume !!(~x~0 < 10);~x~0 := 1 + ~x~0; {133#(<= main_~x~0 0)} is VALID [2022-04-27 11:44:22,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {133#(<= main_~x~0 0)} assume !(~x~0 < 10); {128#false} is VALID [2022-04-27 11:44:22,376 INFO L272 TraceCheckUtils]: 9: Hoare triple {128#false} call __VERIFIER_assert((if 10 == ~x~0 then 1 else 0)); {128#false} is VALID [2022-04-27 11:44:22,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {128#false} ~cond := #in~cond; {128#false} is VALID [2022-04-27 11:44:22,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {128#false} assume 0 == ~cond; {128#false} is VALID [2022-04-27 11:44:22,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {128#false} assume !false; {128#false} is VALID [2022-04-27 11:44:22,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:44:22,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:44:22,451 INFO L290 TraceCheckUtils]: 12: Hoare triple {128#false} assume !false; {128#false} is VALID [2022-04-27 11:44:22,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {128#false} assume 0 == ~cond; {128#false} is VALID [2022-04-27 11:44:22,452 INFO L290 TraceCheckUtils]: 10: Hoare triple {128#false} ~cond := #in~cond; {128#false} is VALID [2022-04-27 11:44:22,452 INFO L272 TraceCheckUtils]: 9: Hoare triple {128#false} call __VERIFIER_assert((if 10 == ~x~0 then 1 else 0)); {128#false} is VALID [2022-04-27 11:44:22,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {186#(< main_~x~0 10)} assume !(~x~0 < 10); {128#false} is VALID [2022-04-27 11:44:22,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {190#(< main_~x~0 9)} assume !!(~x~0 < 10);~x~0 := 1 + ~x~0; {186#(< main_~x~0 10)} is VALID [2022-04-27 11:44:22,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {127#true} assume !!(~x~0 < 0); {190#(< main_~x~0 9)} is VALID [2022-04-27 11:44:22,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {127#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1; {127#true} is VALID [2022-04-27 11:44:22,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {127#true} call #t~ret2 := main(); {127#true} is VALID [2022-04-27 11:44:22,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127#true} {127#true} #45#return; {127#true} is VALID [2022-04-27 11:44:22,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {127#true} assume true; {127#true} is VALID [2022-04-27 11:44:22,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {127#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {127#true} is VALID [2022-04-27 11:44:22,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {127#true} call ULTIMATE.init(); {127#true} is VALID [2022-04-27 11:44:22,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:44:22,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908482570] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:44:22,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:44:22,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-27 11:44:22,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325123489] [2022-04-27 11:44:22,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:44:22,462 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 11:44:22,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:44:22,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:22,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:44:22,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 11:44:22,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:44:22,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 11:44:22,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-27 11:44:22,479 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:22,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:22,585 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-27 11:44:22,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 11:44:22,585 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 11:44:22,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:44:22,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2022-04-27 11:44:22,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:22,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2022-04-27 11:44:22,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 24 transitions. [2022-04-27 11:44:22,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:44:22,610 INFO L225 Difference]: With dead ends: 22 [2022-04-27 11:44:22,610 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 11:44:22,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-04-27 11:44:22,612 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:44:22,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 29 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:44:22,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 11:44:22,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-27 11:44:22,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:44:22,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:22,621 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:22,621 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:22,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:22,623 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-27 11:44:22,623 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-27 11:44:22,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:22,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:44:22,624 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 11:44:22,624 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 11:44:22,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:22,625 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-27 11:44:22,625 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-27 11:44:22,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:22,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:44:22,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:44:22,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:44:22,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:22,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-27 11:44:22,627 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2022-04-27 11:44:22,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:44:22,628 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-27 11:44:22,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:22,631 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-27 11:44:22,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 11:44:22,635 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:44:22,635 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:44:22,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 11:44:22,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:44:22,854 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:44:22,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:44:22,855 INFO L85 PathProgramCache]: Analyzing trace with hash 480105496, now seen corresponding path program 2 times [2022-04-27 11:44:22,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:44:22,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003821904] [2022-04-27 11:44:22,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:44:22,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:44:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:22,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:44:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:44:22,956 INFO L290 TraceCheckUtils]: 0: Hoare triple {328#(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(21, 2); {319#true} is VALID [2022-04-27 11:44:22,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {319#true} assume true; {319#true} is VALID [2022-04-27 11:44:22,957 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {319#true} {319#true} #45#return; {319#true} is VALID [2022-04-27 11:44:22,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {319#true} call ULTIMATE.init(); {328#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:44:22,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {328#(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(21, 2); {319#true} is VALID [2022-04-27 11:44:22,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {319#true} assume true; {319#true} is VALID [2022-04-27 11:44:22,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {319#true} {319#true} #45#return; {319#true} is VALID [2022-04-27 11:44:22,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {319#true} call #t~ret2 := main(); {319#true} is VALID [2022-04-27 11:44:22,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {319#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~x~0 := #t~nondet1;havoc #t~nondet1; {319#true} is VALID [2022-04-27 11:44:22,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {319#true} assume !!(~x~0 < 0); {319#true} is VALID [2022-04-27 11:44:22,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {319#true} assume !!(~x~0 < 10);~x~0 := 1 + ~x~0; {319#true} is VALID [2022-04-27 11:44:22,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {319#true} assume !!(~x~0 < 10);~x~0 := 1 + ~x~0; {319#true} is VALID [2022-04-27 11:44:22,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {319#true} assume !!(~x~0 < 10);~x~0 := 1 + ~x~0; {319#true} is VALID [2022-04-27 11:44:22,959 INFO L290 TraceCheckUtils]: 10: Hoare triple {319#true} assume !!(~x~0 < 10);~x~0 := 1 + ~x~0; {324#(<= main_~x~0 10)} is VALID [2022-04-27 11:44:22,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {324#(<= main_~x~0 10)} assume !(~x~0 < 10); {325#(and (< 9 main_~x~0) (<= main_~x~0 10))} is VALID [2022-04-27 11:44:22,960 INFO L272 TraceCheckUtils]: 12: Hoare triple {325#(and (< 9 main_~x~0) (<= main_~x~0 10))} call __VERIFIER_assert((if 10 == ~x~0 then 1 else 0)); {326#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:44:22,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {326#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {327#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:44:22,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {327#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {320#false} is VALID [2022-04-27 11:44:22,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {320#false} assume !false; {320#false} is VALID [2022-04-27 11:44:22,962 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 11:44:22,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:44:22,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003821904] [2022-04-27 11:44:22,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003821904] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:44:22,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:44:22,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 11:44:22,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752857565] [2022-04-27 11:44:22,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:44:22,963 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 11:44:22,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:44:22,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:22,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:44:22,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 11:44:22,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:44:22,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 11:44:22,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 11:44:22,974 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:23,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:23,047 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-27 11:44:23,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 11:44:23,047 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 11:44:23,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:44:23,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:23,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2022-04-27 11:44:23,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:23,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2022-04-27 11:44:23,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 13 transitions. [2022-04-27 11:44:23,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:44:23,059 INFO L225 Difference]: With dead ends: 17 [2022-04-27 11:44:23,059 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 11:44:23,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-04-27 11:44:23,060 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:44:23,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 25 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:44:23,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 11:44:23,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 11:44:23,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:44:23,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:44:23,061 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:44:23,061 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:44:23,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:23,061 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:44:23,061 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:44:23,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:23,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:44:23,062 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 11:44:23,062 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 11:44:23,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:44:23,062 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:44:23,062 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:44:23,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:23,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:44:23,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:44:23,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:44:23,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:44:23,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 11:44:23,062 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2022-04-27 11:44:23,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:44:23,062 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 11:44:23,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:44:23,063 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:44:23,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:44:23,065 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 11:44:23,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 11:44:23,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 11:44:23,100 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 11) no Hoare annotation was computed. [2022-04-27 11:44:23,100 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 11) no Hoare annotation was computed. [2022-04-27 11:44:23,100 INFO L899 garLoopResultBuilder]: For program point L11-1(line 11) no Hoare annotation was computed. [2022-04-27 11:44:23,100 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 19 27) the Hoare annotation is: true [2022-04-27 11:44:23,100 INFO L899 garLoopResultBuilder]: For program point L25(line 25) no Hoare annotation was computed. [2022-04-27 11:44:23,100 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 19 27) no Hoare annotation was computed. [2022-04-27 11:44:23,100 INFO L899 garLoopResultBuilder]: For program point L21(line 21) no Hoare annotation was computed. [2022-04-27 11:44:23,100 INFO L895 garLoopResultBuilder]: At program point L22-2(lines 22 24) the Hoare annotation is: (<= main_~x~0 10) [2022-04-27 11:44:23,101 INFO L895 garLoopResultBuilder]: At program point L22-3(lines 22 24) the Hoare annotation is: (and (< 9 main_~x~0) (<= main_~x~0 10)) [2022-04-27 11:44:23,101 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 19 27) no Hoare annotation was computed. [2022-04-27 11:44:23,101 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:44:23,101 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 11:44:23,101 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:44:23,101 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:44:23,101 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 11:44:23,101 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 11:44:23,101 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:44:23,101 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-27 11:44:23,101 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-04-27 11:44:23,101 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-27 11:44:23,101 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 18) no Hoare annotation was computed. [2022-04-27 11:44:23,101 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 18) no Hoare annotation was computed. [2022-04-27 11:44:23,102 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-04-27 11:44:23,104 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1] [2022-04-27 11:44:23,105 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 11:44:23,107 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 11:44:23,107 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 11:44:23,108 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:44:23,108 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-27 11:44:23,108 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 11:44:23,108 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2022-04-27 11:44:23,108 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:44:23,108 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:44:23,108 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-27 11:44:23,108 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-04-27 11:44:23,108 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 11:44:23,108 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 11:44:23,109 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 11:44:23,109 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:44:23,109 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 11:44:23,110 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 11:44:23,111 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 11:44:23,111 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 11:44:23,111 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 11:44:23,111 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 11:44:23,111 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:44:23,111 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 11:44:23,111 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 11:44:23,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:44:23 BoogieIcfgContainer [2022-04-27 11:44:23,116 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 11:44:23,117 INFO L158 Benchmark]: Toolchain (without parser) took 1903.65ms. Allocated memory was 175.1MB in the beginning and 215.0MB in the end (delta: 39.8MB). Free memory was 126.4MB in the beginning and 144.5MB in the end (delta: -18.1MB). Peak memory consumption was 21.3MB. Max. memory is 8.0GB. [2022-04-27 11:44:23,117 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 175.1MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 11:44:23,117 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.04ms. Allocated memory is still 175.1MB. Free memory was 126.3MB in the beginning and 152.5MB in the end (delta: -26.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 11:44:23,117 INFO L158 Benchmark]: Boogie Preprocessor took 24.25ms. Allocated memory is still 175.1MB. Free memory was 152.5MB in the beginning and 150.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 11:44:23,117 INFO L158 Benchmark]: RCFGBuilder took 211.17ms. Allocated memory is still 175.1MB. Free memory was 150.9MB in the beginning and 141.0MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 11:44:23,117 INFO L158 Benchmark]: TraceAbstraction took 1466.84ms. Allocated memory was 175.1MB in the beginning and 215.0MB in the end (delta: 39.8MB). Free memory was 140.4MB in the beginning and 144.5MB in the end (delta: -4.1MB). Peak memory consumption was 36.6MB. Max. memory is 8.0GB. [2022-04-27 11:44:23,118 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.24ms. Allocated memory is still 175.1MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 197.04ms. Allocated memory is still 175.1MB. Free memory was 126.3MB in the beginning and 152.5MB in the end (delta: -26.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.25ms. Allocated memory is still 175.1MB. Free memory was 152.5MB in the beginning and 150.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 211.17ms. Allocated memory is still 175.1MB. Free memory was 150.9MB in the beginning and 141.0MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1466.84ms. Allocated memory was 175.1MB in the beginning and 215.0MB in the end (delta: 39.8MB). Free memory was 140.4MB in the beginning and 144.5MB in the end (delta: -4.1MB). Peak memory consumption was 36.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 60 IncrementalHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 39 mSDtfsCounter, 60 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 14 NumberOfFragments, 21 HoareAnnotationTreeSize, 9 FomulaSimplifications, 12 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 15 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 62 ConstructedInterpolants, 0 QuantifiedInterpolants, 114 SizeOfPredicates, 0 NumberOfNonLiveVariables, 53 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 10/13 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: x <= 10 RESULT: Ultimate proved your program to be correct! [2022-04-27 11:44:23,140 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...