/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/nla-digbench-scaling/sqrt1-ll_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 14:55:18,977 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 14:55:18,980 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 14:55:19,027 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 14:55:19,028 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 14:55:19,028 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 14:55:19,029 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 14:55:19,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 14:55:19,032 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 14:55:19,032 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 14:55:19,033 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 14:55:19,033 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 14:55:19,034 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 14:55:19,034 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 14:55:19,035 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 14:55:19,035 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 14:55:19,036 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 14:55:19,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 14:55:19,037 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 14:55:19,038 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 14:55:19,039 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 14:55:19,046 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 14:55:19,046 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 14:55:19,047 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 14:55:19,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 14:55:19,049 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 14:55:19,049 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 14:55:19,049 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 14:55:19,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 14:55:19,050 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 14:55:19,050 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 14:55:19,051 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 14:55:19,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 14:55:19,051 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 14:55:19,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 14:55:19,052 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 14:55:19,053 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 14:55:19,053 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 14:55:19,053 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 14:55:19,053 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 14:55:19,054 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 14:55:19,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 14:55:19,058 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 14:55:19,073 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 14:55:19,073 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 14:55:19,073 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 14:55:19,073 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 14:55:19,074 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 14:55:19,074 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 14:55:19,074 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 14:55:19,074 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 14:55:19,074 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 14:55:19,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 14:55:19,075 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 14:55:19,075 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 14:55:19,075 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 14:55:19,075 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 14:55:19,075 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 14:55:19,075 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 14:55:19,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 14:55:19,075 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 14:55:19,075 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 14:55:19,075 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 14:55:19,075 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 14:55:19,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 14:55:19,076 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 14:55:19,076 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 14:55:19,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:55:19,076 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 14:55:19,076 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 14:55:19,076 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 14:55:19,076 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 14:55:19,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 14:55:19,076 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 14:55:19,076 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 14:55:19,077 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 14:55:19,077 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 14:55:19,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 14:55:19,258 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 14:55:19,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 14:55:19,261 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 14:55:19,262 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 14:55:19,262 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound2.c [2022-04-27 14:55:19,308 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53673ba41/adda55f7bf4e44dcabb14bc8beba5a82/FLAG32b045db9 [2022-04-27 14:55:19,612 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 14:55:19,612 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound2.c [2022-04-27 14:55:19,617 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53673ba41/adda55f7bf4e44dcabb14bc8beba5a82/FLAG32b045db9 [2022-04-27 14:55:20,040 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53673ba41/adda55f7bf4e44dcabb14bc8beba5a82 [2022-04-27 14:55:20,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 14:55:20,045 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 14:55:20,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 14:55:20,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 14:55:20,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 14:55:20,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:55:20" (1/1) ... [2022-04-27 14:55:20,050 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ccc01f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:20, skipping insertion in model container [2022-04-27 14:55:20,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 02:55:20" (1/1) ... [2022-04-27 14:55:20,055 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 14:55:20,065 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 14:55:20,213 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound2.c[520,533] [2022-04-27 14:55:20,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:55:20,244 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 14:55:20,254 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound2.c[520,533] [2022-04-27 14:55:20,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 14:55:20,277 INFO L208 MainTranslator]: Completed translation [2022-04-27 14:55:20,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:20 WrapperNode [2022-04-27 14:55:20,278 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 14:55:20,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 14:55:20,279 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 14:55:20,279 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 14:55:20,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:20" (1/1) ... [2022-04-27 14:55:20,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:20" (1/1) ... [2022-04-27 14:55:20,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:20" (1/1) ... [2022-04-27 14:55:20,290 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:20" (1/1) ... [2022-04-27 14:55:20,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:20" (1/1) ... [2022-04-27 14:55:20,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:20" (1/1) ... [2022-04-27 14:55:20,304 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:20" (1/1) ... [2022-04-27 14:55:20,307 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 14:55:20,308 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 14:55:20,308 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 14:55:20,308 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 14:55:20,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:20" (1/1) ... [2022-04-27 14:55:20,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 14:55:20,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:55:20,331 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 14:55:20,339 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 14:55:20,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 14:55:20,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 14:55:20,359 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 14:55:20,359 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 14:55:20,360 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 14:55:20,360 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 14:55:20,360 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 14:55:20,360 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 14:55:20,360 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 14:55:20,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 14:55:20,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 14:55:20,360 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 14:55:20,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 14:55:20,360 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 14:55:20,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 14:55:20,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 14:55:20,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 14:55:20,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 14:55:20,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 14:55:20,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 14:55:20,407 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 14:55:20,409 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 14:55:20,527 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 14:55:20,542 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 14:55:20,542 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 14:55:20,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:55:20 BoogieIcfgContainer [2022-04-27 14:55:20,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 14:55:20,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 14:55:20,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 14:55:20,553 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 14:55:20,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 02:55:20" (1/3) ... [2022-04-27 14:55:20,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2097b2d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:55:20, skipping insertion in model container [2022-04-27 14:55:20,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 02:55:20" (2/3) ... [2022-04-27 14:55:20,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2097b2d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 02:55:20, skipping insertion in model container [2022-04-27 14:55:20,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 02:55:20" (3/3) ... [2022-04-27 14:55:20,555 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound2.c [2022-04-27 14:55:20,564 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 14:55:20,564 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 14:55:20,625 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 14:55:20,634 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@70cdab5b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@37bc3f8d [2022-04-27 14:55:20,634 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 14:55:20,640 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 14:55:20,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 14:55:20,650 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:20,651 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:20,651 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:20,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:20,657 INFO L85 PathProgramCache]: Analyzing trace with hash -643130361, now seen corresponding path program 1 times [2022-04-27 14:55:20,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:20,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461720974] [2022-04-27 14:55:20,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:20,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:20,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:55:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:20,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29#true} is VALID [2022-04-27 14:55:20,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-27 14:55:20,785 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #66#return; {29#true} is VALID [2022-04-27 14:55:20,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:55:20,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29#true} is VALID [2022-04-27 14:55:20,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-27 14:55:20,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #66#return; {29#true} is VALID [2022-04-27 14:55:20,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret6 := main(); {29#true} is VALID [2022-04-27 14:55:20,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {29#true} is VALID [2022-04-27 14:55:20,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-27 14:55:20,789 INFO L272 TraceCheckUtils]: 7: Hoare triple {30#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {30#false} is VALID [2022-04-27 14:55:20,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-27 14:55:20,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-27 14:55:20,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-27 14:55:20,791 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 14:55:20,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:20,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461720974] [2022-04-27 14:55:20,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461720974] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:55:20,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:55:20,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 14:55:20,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278958093] [2022-04-27 14:55:20,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:55:20,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-27 14:55:20,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:20,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 14:55:20,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:20,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 14:55:20,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:20,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 14:55:20,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:55:20,848 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 14:55:20,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:20,997 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2022-04-27 14:55:20,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 14:55:20,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-27 14:55:20,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:20,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 14:55:21,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-27 14:55:21,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 14:55:21,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-27 14:55:21,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-27 14:55:21,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:21,126 INFO L225 Difference]: With dead ends: 47 [2022-04-27 14:55:21,126 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 14:55:21,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 14:55:21,145 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:21,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:55:21,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 14:55:21,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-27 14:55:21,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:21,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:55:21,183 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:55:21,183 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:55:21,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:21,187 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-27 14:55:21,187 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-27 14:55:21,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:21,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:21,188 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-04-27 14:55:21,188 INFO L87 Difference]: Start difference. First operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-04-27 14:55:21,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:21,196 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-27 14:55:21,196 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-27 14:55:21,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:21,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:21,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:21,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:21,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:55:21,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-04-27 14:55:21,209 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 11 [2022-04-27 14:55:21,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:21,209 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-04-27 14:55:21,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 14:55:21,211 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-27 14:55:21,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 14:55:21,214 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:21,215 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:21,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 14:55:21,217 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:21,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:21,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1070997212, now seen corresponding path program 1 times [2022-04-27 14:55:21,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:21,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819751821] [2022-04-27 14:55:21,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:21,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:21,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:55:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:21,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {189#(and (= ~counter~0 |old(~counter~0)|) (= |#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {187#(= ~counter~0 0)} is VALID [2022-04-27 14:55:21,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {187#(= ~counter~0 0)} assume true; {187#(= ~counter~0 0)} is VALID [2022-04-27 14:55:21,340 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {187#(= ~counter~0 0)} {182#true} #66#return; {187#(= ~counter~0 0)} is VALID [2022-04-27 14:55:21,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {182#true} call ULTIMATE.init(); {189#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:55:21,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {189#(and (= ~counter~0 |old(~counter~0)|) (= |#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {187#(= ~counter~0 0)} is VALID [2022-04-27 14:55:21,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {187#(= ~counter~0 0)} assume true; {187#(= ~counter~0 0)} is VALID [2022-04-27 14:55:21,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {187#(= ~counter~0 0)} {182#true} #66#return; {187#(= ~counter~0 0)} is VALID [2022-04-27 14:55:21,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {187#(= ~counter~0 0)} call #t~ret6 := main(); {187#(= ~counter~0 0)} is VALID [2022-04-27 14:55:21,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {187#(= ~counter~0 0)} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {187#(= ~counter~0 0)} is VALID [2022-04-27 14:55:21,343 INFO L290 TraceCheckUtils]: 6: Hoare triple {187#(= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {188#(= |main_#t~post5| 0)} is VALID [2022-04-27 14:55:21,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {188#(= |main_#t~post5| 0)} assume !(#t~post5 < 2);havoc #t~post5; {183#false} is VALID [2022-04-27 14:55:21,344 INFO L272 TraceCheckUtils]: 8: Hoare triple {183#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {183#false} is VALID [2022-04-27 14:55:21,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {183#false} ~cond := #in~cond; {183#false} is VALID [2022-04-27 14:55:21,345 INFO L290 TraceCheckUtils]: 10: Hoare triple {183#false} assume 0 == ~cond; {183#false} is VALID [2022-04-27 14:55:21,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {183#false} assume !false; {183#false} is VALID [2022-04-27 14:55:21,345 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 14:55:21,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:21,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819751821] [2022-04-27 14:55:21,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819751821] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:55:21,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:55:21,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 14:55:21,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172151842] [2022-04-27 14:55:21,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:55:21,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 12 [2022-04-27 14:55:21,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:21,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 14:55:21,358 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 14:55:21,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:55:21,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:21,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:55:21,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:55:21,360 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 14:55:21,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:21,501 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-27 14:55:21,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 14:55:21,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 12 [2022-04-27 14:55:21,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:21,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 14:55:21,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-27 14:55:21,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 14:55:21,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-27 14:55:21,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-27 14:55:21,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:21,544 INFO L225 Difference]: With dead ends: 32 [2022-04-27 14:55:21,544 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 14:55:21,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:55:21,549 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:21,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 49 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:55:21,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 14:55:21,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-27 14:55:21,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:21,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:55:21,558 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:55:21,558 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:55:21,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:21,561 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-27 14:55:21,561 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-27 14:55:21,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:21,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:21,562 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 23 states. [2022-04-27 14:55:21,563 INFO L87 Difference]: Start difference. First operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 23 states. [2022-04-27 14:55:21,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:21,566 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-27 14:55:21,566 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-27 14:55:21,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:21,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:21,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:21,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:21,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 14:55:21,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-04-27 14:55:21,570 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 12 [2022-04-27 14:55:21,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:21,571 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-04-27 14:55:21,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 14:55:21,571 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-27 14:55:21,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 14:55:21,574 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:21,575 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:21,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 14:55:21,575 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:21,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:21,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665508, now seen corresponding path program 1 times [2022-04-27 14:55:21,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:21,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340922326] [2022-04-27 14:55:21,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:21,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:21,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 14:55:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:21,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {333#(and (= ~counter~0 |old(~counter~0)|) (= |#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {325#true} is VALID [2022-04-27 14:55:21,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {325#true} assume true; {325#true} is VALID [2022-04-27 14:55:21,660 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {325#true} {325#true} #66#return; {325#true} is VALID [2022-04-27 14:55:21,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {325#true} call ULTIMATE.init(); {333#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 14:55:21,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {333#(and (= ~counter~0 |old(~counter~0)|) (= |#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {325#true} is VALID [2022-04-27 14:55:21,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {325#true} assume true; {325#true} is VALID [2022-04-27 14:55:21,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {325#true} {325#true} #66#return; {325#true} is VALID [2022-04-27 14:55:21,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {325#true} call #t~ret6 := main(); {325#true} is VALID [2022-04-27 14:55:21,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {325#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {330#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-27 14:55:21,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {330#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {330#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-27 14:55:21,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {330#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} assume !!(#t~post5 < 2);havoc #t~post5; {330#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-27 14:55:21,666 INFO L272 TraceCheckUtils]: 8: Hoare triple {330#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {331#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 14:55:21,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {331#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {332#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 14:55:21,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {332#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {326#false} is VALID [2022-04-27 14:55:21,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {326#false} assume !false; {326#false} is VALID [2022-04-27 14:55:21,668 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 14:55:21,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:21,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340922326] [2022-04-27 14:55:21,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340922326] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:55:21,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:55:21,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 14:55:21,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143175767] [2022-04-27 14:55:21,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:55:21,670 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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 14:55:21,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:21,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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 14:55:21,682 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 14:55:21,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 14:55:21,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:21,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 14:55:21,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:55:21,685 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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 14:55:21,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:21,974 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-27 14:55:21,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 14:55:21,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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 14:55:21,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:21,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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 14:55:21,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-27 14:55:21,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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 14:55:21,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-27 14:55:21,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-27 14:55:22,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:22,021 INFO L225 Difference]: With dead ends: 36 [2022-04-27 14:55:22,022 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 14:55:22,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 14:55:22,028 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:22,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 53 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 14:55:22,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 14:55:22,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-27 14:55:22,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:22,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:55:22,042 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:55:22,042 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:55:22,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:22,047 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-27 14:55:22,047 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-27 14:55:22,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:22,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:22,048 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-27 14:55:22,049 INFO L87 Difference]: Start difference. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-27 14:55:22,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:22,052 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-27 14:55:22,052 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-27 14:55:22,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:22,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:22,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:22,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:22,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 14:55:22,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-27 14:55:22,056 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-27 14:55:22,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:22,057 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-27 14:55:22,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 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 14:55:22,057 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-27 14:55:22,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 14:55:22,057 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:22,057 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:22,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 14:55:22,058 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:22,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:22,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1640566567, now seen corresponding path program 1 times [2022-04-27 14:55:22,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:22,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34668147] [2022-04-27 14:55:22,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:22,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:22,096 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:55:22,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1380489826] [2022-04-27 14:55:22,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:22,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:22,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:55:22,098 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 14:55:22,099 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 14:55:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:22,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:55:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:22,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:55:22,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {518#true} call ULTIMATE.init(); {518#true} is VALID [2022-04-27 14:55:22,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {518#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {518#true} is VALID [2022-04-27 14:55:22,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {518#true} assume true; {518#true} is VALID [2022-04-27 14:55:22,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {518#true} {518#true} #66#return; {518#true} is VALID [2022-04-27 14:55:22,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {518#true} call #t~ret6 := main(); {518#true} is VALID [2022-04-27 14:55:22,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {518#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {538#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-27 14:55:22,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {538#(and (= main_~a~0 0) (= main_~s~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {538#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-27 14:55:22,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {538#(and (= main_~a~0 0) (= main_~s~0 1))} assume !!(#t~post5 < 2);havoc #t~post5; {538#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-27 14:55:22,289 INFO L272 TraceCheckUtils]: 8: Hoare triple {538#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {518#true} is VALID [2022-04-27 14:55:22,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {518#true} ~cond := #in~cond; {518#true} is VALID [2022-04-27 14:55:22,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {518#true} assume !(0 == ~cond); {518#true} is VALID [2022-04-27 14:55:22,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {518#true} assume true; {518#true} is VALID [2022-04-27 14:55:22,291 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {518#true} {538#(and (= main_~a~0 0) (= main_~s~0 1))} #54#return; {538#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-27 14:55:22,292 INFO L272 TraceCheckUtils]: 13: Hoare triple {538#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {563#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:55:22,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {563#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {567#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:55:22,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {567#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {519#false} is VALID [2022-04-27 14:55:22,293 INFO L290 TraceCheckUtils]: 16: Hoare triple {519#false} assume !false; {519#false} is VALID [2022-04-27 14:55:22,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 14:55:22,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:55:22,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:22,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34668147] [2022-04-27 14:55:22,294 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:55:22,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380489826] [2022-04-27 14:55:22,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380489826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:55:22,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:55:22,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:55:22,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416404584] [2022-04-27 14:55:22,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:55:22,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-27 14:55:22,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:22,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:55:22,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:22,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:55:22,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:22,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:55:22,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:55:22,310 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:55:22,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:22,424 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-27 14:55:22,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:55:22,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-27 14:55:22,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:22,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:55:22,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-27 14:55:22,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:55:22,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-27 14:55:22,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-27 14:55:22,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:22,464 INFO L225 Difference]: With dead ends: 40 [2022-04-27 14:55:22,464 INFO L226 Difference]: Without dead ends: 38 [2022-04-27 14:55:22,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:55:22,469 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:22,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:55:22,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-27 14:55:22,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-27 14:55:22,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:22,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:55:22,481 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:55:22,481 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:55:22,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:22,484 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-27 14:55:22,484 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-27 14:55:22,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:22,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:22,484 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-27 14:55:22,485 INFO L87 Difference]: Start difference. First operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-27 14:55:22,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:22,487 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-27 14:55:22,487 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-27 14:55:22,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:22,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:22,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:22,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:22,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 14:55:22,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-04-27 14:55:22,490 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 17 [2022-04-27 14:55:22,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:22,490 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-04-27 14:55:22,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 14:55:22,490 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-27 14:55:22,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 14:55:22,491 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:22,491 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:22,509 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 14:55:22,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:22,704 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:22,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:22,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1129080132, now seen corresponding path program 1 times [2022-04-27 14:55:22,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:22,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294212097] [2022-04-27 14:55:22,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:22,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:22,712 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:55:22,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [150180922] [2022-04-27 14:55:22,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:22,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:22,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:55:22,714 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:55:22,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 14:55:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:22,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:55:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:22,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:55:22,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {769#true} call ULTIMATE.init(); {769#true} is VALID [2022-04-27 14:55:22,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {769#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {769#true} is VALID [2022-04-27 14:55:22,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {769#true} assume true; {769#true} is VALID [2022-04-27 14:55:22,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {769#true} {769#true} #66#return; {769#true} is VALID [2022-04-27 14:55:22,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {769#true} call #t~ret6 := main(); {769#true} is VALID [2022-04-27 14:55:22,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {769#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {789#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:55:22,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {789#(and (= main_~t~0 1) (= main_~s~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {789#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:55:22,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {789#(and (= main_~t~0 1) (= main_~s~0 1))} assume !!(#t~post5 < 2);havoc #t~post5; {789#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:55:22,833 INFO L272 TraceCheckUtils]: 8: Hoare triple {789#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {769#true} is VALID [2022-04-27 14:55:22,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {769#true} ~cond := #in~cond; {769#true} is VALID [2022-04-27 14:55:22,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {769#true} assume !(0 == ~cond); {769#true} is VALID [2022-04-27 14:55:22,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {769#true} assume true; {769#true} is VALID [2022-04-27 14:55:22,834 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {769#true} {789#(and (= main_~t~0 1) (= main_~s~0 1))} #54#return; {789#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:55:22,834 INFO L272 TraceCheckUtils]: 13: Hoare triple {789#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {769#true} is VALID [2022-04-27 14:55:22,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {769#true} ~cond := #in~cond; {769#true} is VALID [2022-04-27 14:55:22,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {769#true} assume !(0 == ~cond); {769#true} is VALID [2022-04-27 14:55:22,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {769#true} assume true; {769#true} is VALID [2022-04-27 14:55:22,835 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {769#true} {789#(and (= main_~t~0 1) (= main_~s~0 1))} #56#return; {789#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:55:22,836 INFO L272 TraceCheckUtils]: 18: Hoare triple {789#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {829#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:55:22,836 INFO L290 TraceCheckUtils]: 19: Hoare triple {829#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {833#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:55:22,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {833#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {770#false} is VALID [2022-04-27 14:55:22,837 INFO L290 TraceCheckUtils]: 21: Hoare triple {770#false} assume !false; {770#false} is VALID [2022-04-27 14:55:22,837 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 14:55:22,837 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 14:55:22,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:22,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294212097] [2022-04-27 14:55:22,837 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:55:22,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150180922] [2022-04-27 14:55:22,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150180922] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 14:55:22,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 14:55:22,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 14:55:22,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830758360] [2022-04-27 14:55:22,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:55:22,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 14:55:22,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:22,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:55:22,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:22,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:55:22,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:22,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:55:22,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:55:22,852 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:55:22,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:22,963 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-27 14:55:22,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:55:22,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 14:55:22,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:22,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:55:22,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-27 14:55:22,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:55:22,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-27 14:55:22,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-27 14:55:22,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:22,996 INFO L225 Difference]: With dead ends: 44 [2022-04-27 14:55:22,996 INFO L226 Difference]: Without dead ends: 39 [2022-04-27 14:55:22,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:55:22,997 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:22,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 95 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:55:22,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-27 14:55:23,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-27 14:55:23,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:23,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:55:23,005 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:55:23,005 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:55:23,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:23,006 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-27 14:55:23,006 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-27 14:55:23,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:23,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:23,007 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 39 states. [2022-04-27 14:55:23,007 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 39 states. [2022-04-27 14:55:23,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:23,008 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-27 14:55:23,008 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-27 14:55:23,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:23,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:23,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:23,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:23,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:55:23,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-04-27 14:55:23,010 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 22 [2022-04-27 14:55:23,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:23,010 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-04-27 14:55:23,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 14:55:23,010 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-27 14:55:23,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 14:55:23,011 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:23,011 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:23,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 14:55:23,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:23,227 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:23,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:23,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1326533350, now seen corresponding path program 1 times [2022-04-27 14:55:23,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:23,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115654976] [2022-04-27 14:55:23,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:23,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:23,238 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:55:23,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1753519654] [2022-04-27 14:55:23,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:23,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:23,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:55:23,239 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:55:23,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 14:55:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:23,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 14:55:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:23,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:55:23,391 INFO L272 TraceCheckUtils]: 0: Hoare triple {1043#true} call ULTIMATE.init(); {1043#true} is VALID [2022-04-27 14:55:23,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {1043#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1051#(<= ~counter~0 0)} is VALID [2022-04-27 14:55:23,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {1051#(<= ~counter~0 0)} assume true; {1051#(<= ~counter~0 0)} is VALID [2022-04-27 14:55:23,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1051#(<= ~counter~0 0)} {1043#true} #66#return; {1051#(<= ~counter~0 0)} is VALID [2022-04-27 14:55:23,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {1051#(<= ~counter~0 0)} call #t~ret6 := main(); {1051#(<= ~counter~0 0)} is VALID [2022-04-27 14:55:23,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {1051#(<= ~counter~0 0)} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {1051#(<= ~counter~0 0)} is VALID [2022-04-27 14:55:23,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {1051#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:23,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {1067#(<= ~counter~0 1)} assume !!(#t~post5 < 2);havoc #t~post5; {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:23,394 INFO L272 TraceCheckUtils]: 8: Hoare triple {1067#(<= ~counter~0 1)} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:23,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {1067#(<= ~counter~0 1)} ~cond := #in~cond; {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:23,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {1067#(<= ~counter~0 1)} assume !(0 == ~cond); {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:23,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {1067#(<= ~counter~0 1)} assume true; {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:23,396 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1067#(<= ~counter~0 1)} {1067#(<= ~counter~0 1)} #54#return; {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:23,396 INFO L272 TraceCheckUtils]: 13: Hoare triple {1067#(<= ~counter~0 1)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:23,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {1067#(<= ~counter~0 1)} ~cond := #in~cond; {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:23,397 INFO L290 TraceCheckUtils]: 15: Hoare triple {1067#(<= ~counter~0 1)} assume !(0 == ~cond); {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:23,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {1067#(<= ~counter~0 1)} assume true; {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:23,397 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1067#(<= ~counter~0 1)} {1067#(<= ~counter~0 1)} #56#return; {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:23,399 INFO L272 TraceCheckUtils]: 18: Hoare triple {1067#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:23,400 INFO L290 TraceCheckUtils]: 19: Hoare triple {1067#(<= ~counter~0 1)} ~cond := #in~cond; {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:23,400 INFO L290 TraceCheckUtils]: 20: Hoare triple {1067#(<= ~counter~0 1)} assume !(0 == ~cond); {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:23,400 INFO L290 TraceCheckUtils]: 21: Hoare triple {1067#(<= ~counter~0 1)} assume true; {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:23,400 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1067#(<= ~counter~0 1)} {1067#(<= ~counter~0 1)} #58#return; {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:23,401 INFO L290 TraceCheckUtils]: 23: Hoare triple {1067#(<= ~counter~0 1)} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:23,401 INFO L290 TraceCheckUtils]: 24: Hoare triple {1067#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1122#(<= |main_#t~post5| 1)} is VALID [2022-04-27 14:55:23,401 INFO L290 TraceCheckUtils]: 25: Hoare triple {1122#(<= |main_#t~post5| 1)} assume !(#t~post5 < 2);havoc #t~post5; {1044#false} is VALID [2022-04-27 14:55:23,402 INFO L272 TraceCheckUtils]: 26: Hoare triple {1044#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1044#false} is VALID [2022-04-27 14:55:23,402 INFO L290 TraceCheckUtils]: 27: Hoare triple {1044#false} ~cond := #in~cond; {1044#false} is VALID [2022-04-27 14:55:23,402 INFO L290 TraceCheckUtils]: 28: Hoare triple {1044#false} assume 0 == ~cond; {1044#false} is VALID [2022-04-27 14:55:23,402 INFO L290 TraceCheckUtils]: 29: Hoare triple {1044#false} assume !false; {1044#false} is VALID [2022-04-27 14:55:23,402 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:55:23,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:55:23,524 INFO L290 TraceCheckUtils]: 29: Hoare triple {1044#false} assume !false; {1044#false} is VALID [2022-04-27 14:55:23,525 INFO L290 TraceCheckUtils]: 28: Hoare triple {1044#false} assume 0 == ~cond; {1044#false} is VALID [2022-04-27 14:55:23,525 INFO L290 TraceCheckUtils]: 27: Hoare triple {1044#false} ~cond := #in~cond; {1044#false} is VALID [2022-04-27 14:55:23,525 INFO L272 TraceCheckUtils]: 26: Hoare triple {1044#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1044#false} is VALID [2022-04-27 14:55:23,525 INFO L290 TraceCheckUtils]: 25: Hoare triple {1122#(<= |main_#t~post5| 1)} assume !(#t~post5 < 2);havoc #t~post5; {1044#false} is VALID [2022-04-27 14:55:23,527 INFO L290 TraceCheckUtils]: 24: Hoare triple {1067#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1122#(<= |main_#t~post5| 1)} is VALID [2022-04-27 14:55:23,527 INFO L290 TraceCheckUtils]: 23: Hoare triple {1067#(<= ~counter~0 1)} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:23,532 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1043#true} {1067#(<= ~counter~0 1)} #58#return; {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:23,532 INFO L290 TraceCheckUtils]: 21: Hoare triple {1043#true} assume true; {1043#true} is VALID [2022-04-27 14:55:23,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {1043#true} assume !(0 == ~cond); {1043#true} is VALID [2022-04-27 14:55:23,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {1043#true} ~cond := #in~cond; {1043#true} is VALID [2022-04-27 14:55:23,532 INFO L272 TraceCheckUtils]: 18: Hoare triple {1067#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1043#true} is VALID [2022-04-27 14:55:23,533 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1043#true} {1067#(<= ~counter~0 1)} #56#return; {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:23,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {1043#true} assume true; {1043#true} is VALID [2022-04-27 14:55:23,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {1043#true} assume !(0 == ~cond); {1043#true} is VALID [2022-04-27 14:55:23,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {1043#true} ~cond := #in~cond; {1043#true} is VALID [2022-04-27 14:55:23,533 INFO L272 TraceCheckUtils]: 13: Hoare triple {1067#(<= ~counter~0 1)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1043#true} is VALID [2022-04-27 14:55:23,539 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1043#true} {1067#(<= ~counter~0 1)} #54#return; {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:23,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {1043#true} assume true; {1043#true} is VALID [2022-04-27 14:55:23,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {1043#true} assume !(0 == ~cond); {1043#true} is VALID [2022-04-27 14:55:23,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {1043#true} ~cond := #in~cond; {1043#true} is VALID [2022-04-27 14:55:23,540 INFO L272 TraceCheckUtils]: 8: Hoare triple {1067#(<= ~counter~0 1)} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1043#true} is VALID [2022-04-27 14:55:23,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {1067#(<= ~counter~0 1)} assume !!(#t~post5 < 2);havoc #t~post5; {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:23,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {1051#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1067#(<= ~counter~0 1)} is VALID [2022-04-27 14:55:23,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {1051#(<= ~counter~0 0)} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {1051#(<= ~counter~0 0)} is VALID [2022-04-27 14:55:23,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {1051#(<= ~counter~0 0)} call #t~ret6 := main(); {1051#(<= ~counter~0 0)} is VALID [2022-04-27 14:55:23,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1051#(<= ~counter~0 0)} {1043#true} #66#return; {1051#(<= ~counter~0 0)} is VALID [2022-04-27 14:55:23,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {1051#(<= ~counter~0 0)} assume true; {1051#(<= ~counter~0 0)} is VALID [2022-04-27 14:55:23,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {1043#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1051#(<= ~counter~0 0)} is VALID [2022-04-27 14:55:23,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {1043#true} call ULTIMATE.init(); {1043#true} is VALID [2022-04-27 14:55:23,543 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:55:23,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:23,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115654976] [2022-04-27 14:55:23,543 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:55:23,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753519654] [2022-04-27 14:55:23,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753519654] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:55:23,543 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:55:23,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-27 14:55:23,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373858947] [2022-04-27 14:55:23,543 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:55:23,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 30 [2022-04-27 14:55:23,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:23,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 14:55:23,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:23,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:55:23,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:23,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:55:23,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 14:55:23,563 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 14:55:23,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:23,652 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-04-27 14:55:23,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 14:55:23,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 30 [2022-04-27 14:55:23,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:23,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 14:55:23,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2022-04-27 14:55:23,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 14:55:23,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2022-04-27 14:55:23,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 52 transitions. [2022-04-27 14:55:23,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:23,690 INFO L225 Difference]: With dead ends: 50 [2022-04-27 14:55:23,690 INFO L226 Difference]: Without dead ends: 41 [2022-04-27 14:55:23,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-27 14:55:23,690 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:23,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 92 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 14:55:23,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-27 14:55:23,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-27 14:55:23,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:23,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:55:23,700 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:55:23,701 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:55:23,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:23,702 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-04-27 14:55:23,702 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-04-27 14:55:23,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:23,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:23,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 41 states. [2022-04-27 14:55:23,702 INFO L87 Difference]: Start difference. First operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 41 states. [2022-04-27 14:55:23,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:23,703 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-04-27 14:55:23,704 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-04-27 14:55:23,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:23,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:23,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:23,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:23,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:55:23,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-04-27 14:55:23,705 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 30 [2022-04-27 14:55:23,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:23,705 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-04-27 14:55:23,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 14:55:23,705 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-04-27 14:55:23,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 14:55:23,706 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:23,706 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:23,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 14:55:23,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:23,916 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:23,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:23,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1324865054, now seen corresponding path program 1 times [2022-04-27 14:55:23,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:23,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164010495] [2022-04-27 14:55:23,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:23,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:23,923 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:55:23,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [101944198] [2022-04-27 14:55:23,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:23,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:23,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:55:23,925 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:55:23,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 14:55:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:23,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 14:55:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:23,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:55:24,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {1446#true} call ULTIMATE.init(); {1446#true} is VALID [2022-04-27 14:55:24,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {1446#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1446#true} is VALID [2022-04-27 14:55:24,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {1446#true} assume true; {1446#true} is VALID [2022-04-27 14:55:24,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1446#true} {1446#true} #66#return; {1446#true} is VALID [2022-04-27 14:55:24,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {1446#true} call #t~ret6 := main(); {1446#true} is VALID [2022-04-27 14:55:24,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {1446#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {1466#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 14:55:24,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {1466#(and (= main_~a~0 0) (= main_~t~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1466#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 14:55:24,098 INFO L290 TraceCheckUtils]: 7: Hoare triple {1466#(and (= main_~a~0 0) (= main_~t~0 1))} assume !!(#t~post5 < 2);havoc #t~post5; {1466#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 14:55:24,098 INFO L272 TraceCheckUtils]: 8: Hoare triple {1466#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1446#true} is VALID [2022-04-27 14:55:24,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {1446#true} ~cond := #in~cond; {1446#true} is VALID [2022-04-27 14:55:24,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {1446#true} assume !(0 == ~cond); {1446#true} is VALID [2022-04-27 14:55:24,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {1446#true} assume true; {1446#true} is VALID [2022-04-27 14:55:24,098 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1446#true} {1466#(and (= main_~a~0 0) (= main_~t~0 1))} #54#return; {1466#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 14:55:24,099 INFO L272 TraceCheckUtils]: 13: Hoare triple {1466#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1446#true} is VALID [2022-04-27 14:55:24,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {1446#true} ~cond := #in~cond; {1446#true} is VALID [2022-04-27 14:55:24,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {1446#true} assume !(0 == ~cond); {1446#true} is VALID [2022-04-27 14:55:24,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {1446#true} assume true; {1446#true} is VALID [2022-04-27 14:55:24,099 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1446#true} {1466#(and (= main_~a~0 0) (= main_~t~0 1))} #56#return; {1466#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 14:55:24,099 INFO L272 TraceCheckUtils]: 18: Hoare triple {1466#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1446#true} is VALID [2022-04-27 14:55:24,099 INFO L290 TraceCheckUtils]: 19: Hoare triple {1446#true} ~cond := #in~cond; {1446#true} is VALID [2022-04-27 14:55:24,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {1446#true} assume !(0 == ~cond); {1446#true} is VALID [2022-04-27 14:55:24,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {1446#true} assume true; {1446#true} is VALID [2022-04-27 14:55:24,100 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1446#true} {1466#(and (= main_~a~0 0) (= main_~t~0 1))} #58#return; {1466#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-27 14:55:24,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {1466#(and (= main_~a~0 0) (= main_~t~0 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1521#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-27 14:55:24,101 INFO L290 TraceCheckUtils]: 24: Hoare triple {1521#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1521#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-27 14:55:24,101 INFO L290 TraceCheckUtils]: 25: Hoare triple {1521#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} assume !!(#t~post5 < 2);havoc #t~post5; {1521#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-27 14:55:24,102 INFO L272 TraceCheckUtils]: 26: Hoare triple {1521#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1531#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:55:24,102 INFO L290 TraceCheckUtils]: 27: Hoare triple {1531#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1535#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:55:24,102 INFO L290 TraceCheckUtils]: 28: Hoare triple {1535#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1447#false} is VALID [2022-04-27 14:55:24,102 INFO L290 TraceCheckUtils]: 29: Hoare triple {1447#false} assume !false; {1447#false} is VALID [2022-04-27 14:55:24,103 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 14:55:24,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:55:24,211 INFO L290 TraceCheckUtils]: 29: Hoare triple {1447#false} assume !false; {1447#false} is VALID [2022-04-27 14:55:24,212 INFO L290 TraceCheckUtils]: 28: Hoare triple {1535#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1447#false} is VALID [2022-04-27 14:55:24,212 INFO L290 TraceCheckUtils]: 27: Hoare triple {1531#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1535#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:55:24,213 INFO L272 TraceCheckUtils]: 26: Hoare triple {1551#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1531#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:55:24,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {1551#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !!(#t~post5 < 2);havoc #t~post5; {1551#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:55:24,214 INFO L290 TraceCheckUtils]: 24: Hoare triple {1551#(= main_~t~0 (+ (* main_~a~0 2) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1551#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:55:24,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {1551#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1551#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:55:24,215 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1446#true} {1551#(= main_~t~0 (+ (* main_~a~0 2) 1))} #58#return; {1551#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:55:24,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {1446#true} assume true; {1446#true} is VALID [2022-04-27 14:55:24,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {1446#true} assume !(0 == ~cond); {1446#true} is VALID [2022-04-27 14:55:24,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {1446#true} ~cond := #in~cond; {1446#true} is VALID [2022-04-27 14:55:24,215 INFO L272 TraceCheckUtils]: 18: Hoare triple {1551#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1446#true} is VALID [2022-04-27 14:55:24,218 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1446#true} {1551#(= main_~t~0 (+ (* main_~a~0 2) 1))} #56#return; {1551#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:55:24,218 INFO L290 TraceCheckUtils]: 16: Hoare triple {1446#true} assume true; {1446#true} is VALID [2022-04-27 14:55:24,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {1446#true} assume !(0 == ~cond); {1446#true} is VALID [2022-04-27 14:55:24,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {1446#true} ~cond := #in~cond; {1446#true} is VALID [2022-04-27 14:55:24,219 INFO L272 TraceCheckUtils]: 13: Hoare triple {1551#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1446#true} is VALID [2022-04-27 14:55:24,219 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1446#true} {1551#(= main_~t~0 (+ (* main_~a~0 2) 1))} #54#return; {1551#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:55:24,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {1446#true} assume true; {1446#true} is VALID [2022-04-27 14:55:24,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {1446#true} assume !(0 == ~cond); {1446#true} is VALID [2022-04-27 14:55:24,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {1446#true} ~cond := #in~cond; {1446#true} is VALID [2022-04-27 14:55:24,219 INFO L272 TraceCheckUtils]: 8: Hoare triple {1551#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1446#true} is VALID [2022-04-27 14:55:24,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {1551#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !!(#t~post5 < 2);havoc #t~post5; {1551#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:55:24,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {1551#(= main_~t~0 (+ (* main_~a~0 2) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1551#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:55:24,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {1446#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {1551#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-27 14:55:24,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {1446#true} call #t~ret6 := main(); {1446#true} is VALID [2022-04-27 14:55:24,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1446#true} {1446#true} #66#return; {1446#true} is VALID [2022-04-27 14:55:24,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {1446#true} assume true; {1446#true} is VALID [2022-04-27 14:55:24,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {1446#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1446#true} is VALID [2022-04-27 14:55:24,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {1446#true} call ULTIMATE.init(); {1446#true} is VALID [2022-04-27 14:55:24,221 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 14:55:24,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:24,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164010495] [2022-04-27 14:55:24,221 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:55:24,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101944198] [2022-04-27 14:55:24,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101944198] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 14:55:24,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 14:55:24,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-27 14:55:24,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374718501] [2022-04-27 14:55:24,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 14:55:24,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-27 14:55:24,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:24,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:55:24,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:24,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 14:55:24,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:24,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 14:55:24,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 14:55:24,237 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:55:31,125 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.78s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 14:55:31,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:31,126 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-04-27 14:55:31,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 14:55:31,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-27 14:55:31,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:31,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:55:31,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 14:55:31,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:55:31,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 14:55:31,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-27 14:55:31,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:31,184 INFO L225 Difference]: With dead ends: 47 [2022-04-27 14:55:31,184 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 14:55:31,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:55:31,184 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:31,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 62 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 1 Unknown, 0 Unchecked, 6.8s Time] [2022-04-27 14:55:31,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 14:55:31,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-27 14:55:31,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:31,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:55:31,195 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:55:31,195 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:55:31,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:31,196 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-27 14:55:31,196 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-04-27 14:55:31,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:31,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:31,196 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 45 states. [2022-04-27 14:55:31,196 INFO L87 Difference]: Start difference. First operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 45 states. [2022-04-27 14:55:31,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:31,197 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-27 14:55:31,197 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-04-27 14:55:31,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:31,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:31,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:31,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:31,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 14:55:31,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2022-04-27 14:55:31,199 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 30 [2022-04-27 14:55:31,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:31,199 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2022-04-27 14:55:31,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 14:55:31,199 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-04-27 14:55:31,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 14:55:31,200 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 14:55:31,200 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:31,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 14:55:31,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:31,411 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 14:55:31,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 14:55:31,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1080733609, now seen corresponding path program 2 times [2022-04-27 14:55:31,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 14:55:31,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938987498] [2022-04-27 14:55:31,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 14:55:31,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 14:55:31,420 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 14:55:31,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [767881126] [2022-04-27 14:55:31,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 14:55:31,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:31,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 14:55:31,428 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 14:55:31,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 14:55:31,461 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 14:55:31,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 14:55:31,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 14:55:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 14:55:31,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 14:55:31,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {1858#true} call ULTIMATE.init(); {1858#true} is VALID [2022-04-27 14:55:31,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {1858#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1858#true} is VALID [2022-04-27 14:55:31,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {1858#true} assume true; {1858#true} is VALID [2022-04-27 14:55:31,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1858#true} {1858#true} #66#return; {1858#true} is VALID [2022-04-27 14:55:31,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {1858#true} call #t~ret6 := main(); {1858#true} is VALID [2022-04-27 14:55:31,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {1858#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {1878#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:55:31,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {1878#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1878#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:55:31,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {1878#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !!(#t~post5 < 2);havoc #t~post5; {1878#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:55:31,604 INFO L272 TraceCheckUtils]: 8: Hoare triple {1878#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1858#true} is VALID [2022-04-27 14:55:31,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {1858#true} ~cond := #in~cond; {1858#true} is VALID [2022-04-27 14:55:31,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {1858#true} assume !(0 == ~cond); {1858#true} is VALID [2022-04-27 14:55:31,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {1858#true} assume true; {1858#true} is VALID [2022-04-27 14:55:31,604 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1858#true} {1878#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #54#return; {1878#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:55:31,604 INFO L272 TraceCheckUtils]: 13: Hoare triple {1878#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1858#true} is VALID [2022-04-27 14:55:31,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {1858#true} ~cond := #in~cond; {1858#true} is VALID [2022-04-27 14:55:31,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {1858#true} assume !(0 == ~cond); {1858#true} is VALID [2022-04-27 14:55:31,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {1858#true} assume true; {1858#true} is VALID [2022-04-27 14:55:31,605 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1858#true} {1878#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #56#return; {1878#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:55:31,605 INFO L272 TraceCheckUtils]: 18: Hoare triple {1878#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1858#true} is VALID [2022-04-27 14:55:31,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {1858#true} ~cond := #in~cond; {1858#true} is VALID [2022-04-27 14:55:31,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {1858#true} assume !(0 == ~cond); {1858#true} is VALID [2022-04-27 14:55:31,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {1858#true} assume true; {1858#true} is VALID [2022-04-27 14:55:31,606 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1858#true} {1878#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #58#return; {1878#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-27 14:55:31,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {1878#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1933#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} is VALID [2022-04-27 14:55:31,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {1933#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1933#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} is VALID [2022-04-27 14:55:31,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {1933#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} assume !!(#t~post5 < 2);havoc #t~post5; {1933#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} is VALID [2022-04-27 14:55:31,607 INFO L272 TraceCheckUtils]: 26: Hoare triple {1933#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1858#true} is VALID [2022-04-27 14:55:31,607 INFO L290 TraceCheckUtils]: 27: Hoare triple {1858#true} ~cond := #in~cond; {1858#true} is VALID [2022-04-27 14:55:31,607 INFO L290 TraceCheckUtils]: 28: Hoare triple {1858#true} assume !(0 == ~cond); {1858#true} is VALID [2022-04-27 14:55:31,607 INFO L290 TraceCheckUtils]: 29: Hoare triple {1858#true} assume true; {1858#true} is VALID [2022-04-27 14:55:31,608 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1858#true} {1933#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} #54#return; {1933#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} is VALID [2022-04-27 14:55:31,608 INFO L272 TraceCheckUtils]: 31: Hoare triple {1933#(and (= (+ (- 1) main_~a~0) 0) (= main_~s~0 4))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1958#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:55:31,609 INFO L290 TraceCheckUtils]: 32: Hoare triple {1958#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1962#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:55:31,609 INFO L290 TraceCheckUtils]: 33: Hoare triple {1962#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1859#false} is VALID [2022-04-27 14:55:31,609 INFO L290 TraceCheckUtils]: 34: Hoare triple {1859#false} assume !false; {1859#false} is VALID [2022-04-27 14:55:31,609 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:55:31,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 14:55:31,735 INFO L290 TraceCheckUtils]: 34: Hoare triple {1859#false} assume !false; {1859#false} is VALID [2022-04-27 14:55:31,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {1962#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1859#false} is VALID [2022-04-27 14:55:31,736 INFO L290 TraceCheckUtils]: 32: Hoare triple {1958#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1962#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 14:55:31,736 INFO L272 TraceCheckUtils]: 31: Hoare triple {1978#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1958#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 14:55:31,737 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1858#true} {1978#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #54#return; {1978#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-27 14:55:31,737 INFO L290 TraceCheckUtils]: 29: Hoare triple {1858#true} assume true; {1858#true} is VALID [2022-04-27 14:55:31,737 INFO L290 TraceCheckUtils]: 28: Hoare triple {1858#true} assume !(0 == ~cond); {1858#true} is VALID [2022-04-27 14:55:31,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {1858#true} ~cond := #in~cond; {1858#true} is VALID [2022-04-27 14:55:31,737 INFO L272 TraceCheckUtils]: 26: Hoare triple {1978#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1858#true} is VALID [2022-04-27 14:55:31,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {1978#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} assume !!(#t~post5 < 2);havoc #t~post5; {1978#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-27 14:55:31,738 INFO L290 TraceCheckUtils]: 24: Hoare triple {1978#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1978#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-27 14:55:31,751 INFO L290 TraceCheckUtils]: 23: Hoare triple {2003#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !!(~s~0 <= ~n~0);~a~0 := 1 + ~a~0;~t~0 := 2 + ~t~0;~s~0 := ~s~0 + ~t~0; {1978#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-27 14:55:31,752 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1858#true} {2003#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #58#return; {2003#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-27 14:55:31,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {1858#true} assume true; {1858#true} is VALID [2022-04-27 14:55:31,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {1858#true} assume !(0 == ~cond); {1858#true} is VALID [2022-04-27 14:55:31,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {1858#true} ~cond := #in~cond; {1858#true} is VALID [2022-04-27 14:55:31,753 INFO L272 TraceCheckUtils]: 18: Hoare triple {2003#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {1858#true} is VALID [2022-04-27 14:55:31,753 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1858#true} {2003#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #56#return; {2003#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-27 14:55:31,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {1858#true} assume true; {1858#true} is VALID [2022-04-27 14:55:31,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {1858#true} assume !(0 == ~cond); {1858#true} is VALID [2022-04-27 14:55:31,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {1858#true} ~cond := #in~cond; {1858#true} is VALID [2022-04-27 14:55:31,753 INFO L272 TraceCheckUtils]: 13: Hoare triple {2003#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1858#true} is VALID [2022-04-27 14:55:31,754 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1858#true} {2003#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #54#return; {2003#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-27 14:55:31,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {1858#true} assume true; {1858#true} is VALID [2022-04-27 14:55:31,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {1858#true} assume !(0 == ~cond); {1858#true} is VALID [2022-04-27 14:55:31,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {1858#true} ~cond := #in~cond; {1858#true} is VALID [2022-04-27 14:55:31,754 INFO L272 TraceCheckUtils]: 8: Hoare triple {2003#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1858#true} is VALID [2022-04-27 14:55:31,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {2003#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !!(#t~post5 < 2);havoc #t~post5; {2003#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-27 14:55:31,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {2003#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2003#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-27 14:55:31,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {1858#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {2003#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-27 14:55:31,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {1858#true} call #t~ret6 := main(); {1858#true} is VALID [2022-04-27 14:55:31,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1858#true} {1858#true} #66#return; {1858#true} is VALID [2022-04-27 14:55:31,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {1858#true} assume true; {1858#true} is VALID [2022-04-27 14:55:31,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {1858#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1858#true} is VALID [2022-04-27 14:55:31,756 INFO L272 TraceCheckUtils]: 0: Hoare triple {1858#true} call ULTIMATE.init(); {1858#true} is VALID [2022-04-27 14:55:31,756 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 14:55:31,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 14:55:31,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938987498] [2022-04-27 14:55:31,757 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 14:55:31,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767881126] [2022-04-27 14:55:31,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767881126] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 14:55:31,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 14:55:31,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-27 14:55:31,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689082090] [2022-04-27 14:55:31,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 14:55:31,757 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 35 [2022-04-27 14:55:31,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 14:55:31,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 14:55:31,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:31,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 14:55:31,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 14:55:31,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 14:55:31,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-27 14:55:31,793 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 14:55:32,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:32,164 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-04-27 14:55:32,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 14:55:32,165 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 35 [2022-04-27 14:55:32,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 14:55:32,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 14:55:32,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-04-27 14:55:32,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 14:55:32,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 51 transitions. [2022-04-27 14:55:32,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 51 transitions. [2022-04-27 14:55:32,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 14:55:32,218 INFO L225 Difference]: With dead ends: 52 [2022-04-27 14:55:32,218 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 14:55:32,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-27 14:55:32,219 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 14:55:32,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 62 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 14:55:32,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 14:55:32,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 14:55:32,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 14:55:32,220 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 14:55:32,220 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 14:55:32,220 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 14:55:32,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:32,220 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:55:32,220 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:55:32,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:32,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:32,220 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 14:55:32,220 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 14:55:32,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 14:55:32,220 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 14:55:32,220 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:55:32,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:32,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 14:55:32,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 14:55:32,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 14:55:32,221 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 14:55:32,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 14:55:32,221 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2022-04-27 14:55:32,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 14:55:32,221 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 14:55:32,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-27 14:55:32,221 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 14:55:32,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 14:55:32,223 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 14:55:32,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 14:55:32,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 14:55:32,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 14:55:32,611 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-27 14:55:32,611 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-27 14:55:32,611 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-27 14:55:32,611 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 8 10) no Hoare annotation was computed. [2022-04-27 14:55:32,611 INFO L899 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-04-27 14:55:32,611 INFO L899 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-04-27 14:55:32,611 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-04-27 14:55:32,611 INFO L899 garLoopResultBuilder]: For program point L33(lines 30 42) no Hoare annotation was computed. [2022-04-27 14:55:32,611 INFO L895 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (or (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-27 14:55:32,611 INFO L895 garLoopResultBuilder]: At program point L31-1(line 31) the Hoare annotation is: (or (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-27 14:55:32,612 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 21 49) no Hoare annotation was computed. [2022-04-27 14:55:32,612 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-04-27 14:55:32,612 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 21 49) no Hoare annotation was computed. [2022-04-27 14:55:32,612 INFO L895 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (or (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-27 14:55:32,612 INFO L895 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (or (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-27 14:55:32,612 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 21 49) the Hoare annotation is: (or (= ~counter~0 0) (not (= |old(~counter~0)| 0))) [2022-04-27 14:55:32,612 INFO L899 garLoopResultBuilder]: For program point L30-1(lines 30 42) no Hoare annotation was computed. [2022-04-27 14:55:32,612 INFO L895 garLoopResultBuilder]: At program point L30-3(lines 30 42) the Hoare annotation is: (or (let ((.cse0 (* main_~a~0 2))) (and (= (+ .cse0 (* main_~a~0 main_~a~0) 1) main_~s~0) (= main_~t~0 (+ .cse0 1)))) (not (= |old(~counter~0)| 0))) [2022-04-27 14:55:32,612 INFO L895 garLoopResultBuilder]: At program point L30-4(lines 30 42) the Hoare annotation is: (or (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (not (= |old(~counter~0)| 0))) [2022-04-27 14:55:32,612 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (or (and (= (+ main_~t~0 main_~s~0) (+ (* main_~a~0 4) 2 (* main_~a~0 main_~a~0))) (= main_~t~0 (+ (* main_~a~0 2) 1))) (and (= main_~t~0 1) (= main_~s~0 1)) (not (= |old(~counter~0)| 0))) [2022-04-27 14:55:32,612 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:55:32,612 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 14:55:32,612 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:55:32,612 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 14:55:32,612 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (= ~counter~0 0) [2022-04-27 14:55:32,612 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 14:55:32,612 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 14:55:32,613 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-27 14:55:32,613 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-04-27 14:55:32,613 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-04-27 14:55:32,613 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-04-27 14:55:32,613 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-04-27 14:55:32,613 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-04-27 14:55:32,615 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-04-27 14:55:32,616 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 14:55:32,618 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 14:55:32,618 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:55:32,619 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 14:55:32,620 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 14:55:32,620 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 14:55:32,620 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 14:55:32,620 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:55:32,620 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 14:55:32,620 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-27 14:55:32,621 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-27 14:55:32,621 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 14:55:32,621 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 14:55:32,621 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 14:55:32,621 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 14:55:32,621 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-27 14:55:32,621 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-27 14:55:32,621 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-27 14:55:32,621 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:55:32,621 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-27 14:55:32,621 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 14:55:32,621 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:55:32,621 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:55:32,621 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:55:32,621 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:55:32,621 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:55:32,621 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 14:55:32,621 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 14:55:32,621 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 14:55:32,621 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 14:55:32,621 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 14:55:32,621 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 14:55:32,621 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 14:55:32,621 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 14:55:32,622 INFO L163 areAnnotationChecker]: CFG has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 14:55:32,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 02:55:32 BoogieIcfgContainer [2022-04-27 14:55:32,628 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 14:55:32,628 INFO L158 Benchmark]: Toolchain (without parser) took 12583.78ms. Allocated memory was 191.9MB in the beginning and 274.7MB in the end (delta: 82.8MB). Free memory was 140.6MB in the beginning and 104.5MB in the end (delta: 36.0MB). Peak memory consumption was 120.3MB. Max. memory is 8.0GB. [2022-04-27 14:55:32,629 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 191.9MB. Free memory is still 157.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 14:55:32,629 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.52ms. Allocated memory is still 191.9MB. Free memory was 140.3MB in the beginning and 166.9MB in the end (delta: -26.6MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. [2022-04-27 14:55:32,629 INFO L158 Benchmark]: Boogie Preprocessor took 28.94ms. Allocated memory is still 191.9MB. Free memory was 166.9MB in the beginning and 165.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 14:55:32,629 INFO L158 Benchmark]: RCFGBuilder took 235.55ms. Allocated memory is still 191.9MB. Free memory was 165.4MB in the beginning and 153.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 14:55:32,629 INFO L158 Benchmark]: TraceAbstraction took 12083.05ms. Allocated memory was 191.9MB in the beginning and 274.7MB in the end (delta: 82.8MB). Free memory was 153.3MB in the beginning and 104.5MB in the end (delta: 48.8MB). Peak memory consumption was 132.6MB. Max. memory is 8.0GB. [2022-04-27 14:55:32,630 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.09ms. Allocated memory is still 191.9MB. Free memory is still 157.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 231.52ms. Allocated memory is still 191.9MB. Free memory was 140.3MB in the beginning and 166.9MB in the end (delta: -26.6MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.94ms. Allocated memory is still 191.9MB. Free memory was 166.9MB in the beginning and 165.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 235.55ms. Allocated memory is still 191.9MB. Free memory was 165.4MB in the beginning and 153.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 12083.05ms. Allocated memory was 191.9MB in the beginning and 274.7MB in the end (delta: 82.8MB). Free memory was 153.3MB in the beginning and 104.5MB in the end (delta: 48.8MB). Peak memory consumption was 132.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: 14]: 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 6 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.0s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 75 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 61 mSDsluCounter, 536 SdHoareTripleChecker+Invalid, 7.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 321 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 375 IncrementalHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 215 mSDtfsCounter, 375 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 253 GetRequests, 209 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=7, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 41 PreInvPairs, 62 NumberOfFragments, 203 HoareAnnotationTreeSize, 41 FomulaSimplifications, 26 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 535 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 253 ConstructedInterpolants, 0 QuantifiedInterpolants, 822 SizeOfPredicates, 7 NumberOfNonLiveVariables, 508 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 149/164 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: 30]: Loop Invariant Derived loop invariant: (a * 2 + a * a + 1 == s && t == a * 2 + 1) || !(\old(counter) == 0) RESULT: Ultimate proved your program to be correct! [2022-04-27 14:55:32,643 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...