/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/sqrt1-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 12:44:41,351 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 12:44:41,353 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 12:44:41,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 12:44:41,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 12:44:41,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 12:44:41,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 12:44:41,381 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 12:44:41,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 12:44:41,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 12:44:41,383 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 12:44:41,384 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 12:44:41,384 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 12:44:41,385 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 12:44:41,386 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 12:44:41,387 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 12:44:41,388 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 12:44:41,388 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 12:44:41,390 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 12:44:41,391 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 12:44:41,392 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 12:44:41,393 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 12:44:41,394 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 12:44:41,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 12:44:41,395 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 12:44:41,398 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 12:44:41,398 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 12:44:41,398 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 12:44:41,399 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 12:44:41,399 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 12:44:41,400 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 12:44:41,400 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 12:44:41,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 12:44:41,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 12:44:41,402 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 12:44:41,403 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 12:44:41,403 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 12:44:41,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 12:44:41,404 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 12:44:41,404 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 12:44:41,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 12:44:41,405 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 12:44:41,406 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-07 12:44:41,425 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 12:44:41,425 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 12:44:41,425 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 12:44:41,426 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 12:44:41,426 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 12:44:41,426 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 12:44:41,427 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 12:44:41,427 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 12:44:41,427 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 12:44:41,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 12:44:41,428 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 12:44:41,428 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 12:44:41,428 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 12:44:41,428 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 12:44:41,428 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 12:44:41,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 12:44:41,429 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 12:44:41,429 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 12:44:41,429 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 12:44:41,429 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 12:44:41,429 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 12:44:41,430 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 12:44:41,430 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 12:44:41,430 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 12:44:41,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 12:44:41,430 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 12:44:41,431 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 12:44:41,431 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 12:44:41,433 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 12:44:41,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 12:44:41,434 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 12:44:41,434 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 12:44:41,434 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 12:44:41,434 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-07 12:44:41,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 12:44:41,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 12:44:41,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 12:44:41,709 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 12:44:41,710 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 12:44:41,711 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/sqrt1-ll.c [2022-04-07 12:44:41,771 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/323565512/ef9388b67da847a1a93a05f11c85f89b/FLAG3f15f9d09 [2022-04-07 12:44:42,204 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 12:44:42,205 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/sqrt1-ll.c [2022-04-07 12:44:42,213 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/323565512/ef9388b67da847a1a93a05f11c85f89b/FLAG3f15f9d09 [2022-04-07 12:44:42,613 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/323565512/ef9388b67da847a1a93a05f11c85f89b [2022-04-07 12:44:42,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 12:44:42,618 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 12:44:42,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 12:44:42,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 12:44:42,625 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 12:44:42,626 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:44:42" (1/1) ... [2022-04-07 12:44:42,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39ac1c49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:44:42, skipping insertion in model container [2022-04-07 12:44:42,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:44:42" (1/1) ... [2022-04-07 12:44:42,634 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 12:44:42,650 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 12:44:42,805 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/sqrt1-ll.c[520,533] [2022-04-07 12:44:42,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 12:44:42,844 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 12:44:42,867 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/sqrt1-ll.c[520,533] [2022-04-07 12:44:42,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 12:44:42,888 INFO L208 MainTranslator]: Completed translation [2022-04-07 12:44:42,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:44:42 WrapperNode [2022-04-07 12:44:42,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 12:44:42,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 12:44:42,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 12:44:42,890 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 12:44:42,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:44:42" (1/1) ... [2022-04-07 12:44:42,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:44:42" (1/1) ... [2022-04-07 12:44:42,905 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:44:42" (1/1) ... [2022-04-07 12:44:42,905 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:44:42" (1/1) ... [2022-04-07 12:44:42,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:44:42" (1/1) ... [2022-04-07 12:44:42,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:44:42" (1/1) ... [2022-04-07 12:44:42,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:44:42" (1/1) ... [2022-04-07 12:44:42,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 12:44:42,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 12:44:42,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 12:44:42,933 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 12:44:42,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:44:42" (1/1) ... [2022-04-07 12:44:42,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 12:44:42,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:44:42,964 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-07 12:44:42,976 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-07 12:44:43,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 12:44:43,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 12:44:43,004 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 12:44:43,004 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 12:44:43,005 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 12:44:43,005 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 12:44:43,005 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 12:44:43,005 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 12:44:43,006 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 12:44:43,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 12:44:43,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 12:44:43,006 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 12:44:43,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 12:44:43,006 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 12:44:43,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 12:44:43,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 12:44:43,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 12:44:43,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 12:44:43,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 12:44:43,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 12:44:43,064 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 12:44:43,066 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 12:44:43,227 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 12:44:43,233 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 12:44:43,233 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 12:44:43,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:44:43 BoogieIcfgContainer [2022-04-07 12:44:43,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 12:44:43,253 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 12:44:43,253 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 12:44:43,270 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 12:44:43,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 12:44:42" (1/3) ... [2022-04-07 12:44:43,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ccc6279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:44:43, skipping insertion in model container [2022-04-07 12:44:43,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:44:42" (2/3) ... [2022-04-07 12:44:43,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ccc6279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:44:43, skipping insertion in model container [2022-04-07 12:44:43,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:44:43" (3/3) ... [2022-04-07 12:44:43,272 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll.c [2022-04-07 12:44:43,277 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 12:44:43,277 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 12:44:43,316 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 12:44:43,321 INFO L340 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 [2022-04-07 12:44:43,322 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 12:44:43,340 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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-07 12:44:43,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 12:44:43,344 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:44:43,344 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:44:43,345 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:44:43,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:44:43,353 INFO L85 PathProgramCache]: Analyzing trace with hash 515438393, now seen corresponding path program 1 times [2022-04-07 12:44:43,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:44:43,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380454864] [2022-04-07 12:44:43,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:44:43,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:44:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:44:43,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:44:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:44:43,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {28#true} is VALID [2022-04-07 12:44:43,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-07 12:44:43,542 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #65#return; {28#true} is VALID [2022-04-07 12:44:43,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:44:43,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {28#true} is VALID [2022-04-07 12:44:43,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-07 12:44:43,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #65#return; {28#true} is VALID [2022-04-07 12:44:43,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret5 := main(); {28#true} is VALID [2022-04-07 12:44:43,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#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; {28#true} is VALID [2022-04-07 12:44:43,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} assume false; {29#false} is VALID [2022-04-07 12:44:43,549 INFO L272 TraceCheckUtils]: 7: Hoare triple {29#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {29#false} is VALID [2022-04-07 12:44:43,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-07 12:44:43,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-07 12:44:43,550 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-07 12:44:43,550 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-07 12:44:43,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:44:43,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380454864] [2022-04-07 12:44:43,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380454864] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:44:43,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:44:43,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 12:44:43,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451428424] [2022-04-07 12:44:43,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:44:43,560 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-07 12:44:43,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:44:43,565 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-07 12:44:43,589 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-07 12:44:43,589 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 12:44:43,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:44:43,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 12:44:43,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 12:44:43,613 INFO L87 Difference]: Start difference. First operand has 25 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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-07 12:44:43,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:44:43,723 INFO L93 Difference]: Finished difference Result 44 states and 66 transitions. [2022-04-07 12:44:43,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 12:44:43,723 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-07 12:44:43,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:44:43,725 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-07 12:44:43,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-07 12:44:43,736 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-07 12:44:43,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-07 12:44:43,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2022-04-07 12:44:43,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:44:43,849 INFO L225 Difference]: With dead ends: 44 [2022-04-07 12:44:43,849 INFO L226 Difference]: Without dead ends: 20 [2022-04-07 12:44:43,852 INFO L912 BasicCegarLoop]: 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-07 12:44:43,855 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 12:44:43,856 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 27 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 12:44:43,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-07 12:44:43,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-07 12:44:43,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:44:43,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 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-07 12:44:43,884 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 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-07 12:44:43,884 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 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-07 12:44:43,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:44:43,889 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-04-07 12:44:43,889 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-07 12:44:43,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:44:43,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:44:43,891 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 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 20 states. [2022-04-07 12:44:43,891 INFO L87 Difference]: Start difference. First operand has 20 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 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 20 states. [2022-04-07 12:44:43,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:44:43,894 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-04-07 12:44:43,895 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-07 12:44:43,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:44:43,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:44:43,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:44:43,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:44:43,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 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-07 12:44:43,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-04-07 12:44:43,900 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 11 [2022-04-07 12:44:43,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:44:43,901 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-04-07 12:44:43,901 INFO L479 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-07 12:44:43,901 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-07 12:44:43,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-07 12:44:43,902 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:44:43,902 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:44:43,903 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 12:44:43,903 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:44:43,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:44:43,904 INFO L85 PathProgramCache]: Analyzing trace with hash 517106689, now seen corresponding path program 1 times [2022-04-07 12:44:43,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:44:43,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553083069] [2022-04-07 12:44:43,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:44:43,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:44:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:44:44,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:44:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:44:44,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {180#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {172#true} is VALID [2022-04-07 12:44:44,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#true} assume true; {172#true} is VALID [2022-04-07 12:44:44,031 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {172#true} {172#true} #65#return; {172#true} is VALID [2022-04-07 12:44:44,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {172#true} call ULTIMATE.init(); {180#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:44:44,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {172#true} is VALID [2022-04-07 12:44:44,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {172#true} assume true; {172#true} is VALID [2022-04-07 12:44:44,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {172#true} {172#true} #65#return; {172#true} is VALID [2022-04-07 12:44:44,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {172#true} call #t~ret5 := main(); {172#true} is VALID [2022-04-07 12:44:44,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {172#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; {177#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-07 12:44:44,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {177#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} assume !false; {177#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-07 12:44:44,044 INFO L272 TraceCheckUtils]: 7: Hoare triple {177#(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)); {178#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:44:44,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {178#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {179#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 12:44:44,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {179#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {173#false} is VALID [2022-04-07 12:44:44,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {173#false} assume !false; {173#false} is VALID [2022-04-07 12:44:44,045 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-07 12:44:44,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:44:44,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553083069] [2022-04-07 12:44:44,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553083069] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:44:44,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:44:44,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 12:44:44,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239833329] [2022-04-07 12:44:44,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:44:44,048 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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-07 12:44:44,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:44:44,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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-07 12:44:44,059 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-07 12:44:44,059 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:44:44,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:44:44,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:44:44,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 12:44:44,060 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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-07 12:44:44,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:44:44,414 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-07 12:44:44,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 12:44:44,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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-07 12:44:44,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:44:44,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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-07 12:44:44,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-07 12:44:44,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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-07 12:44:44,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-07 12:44:44,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-04-07 12:44:44,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:44:44,478 INFO L225 Difference]: With dead ends: 34 [2022-04-07 12:44:44,478 INFO L226 Difference]: Without dead ends: 32 [2022-04-07 12:44:44,479 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-07 12:44:44,480 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:44:44,480 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 34 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 12:44:44,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-07 12:44:44,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2022-04-07 12:44:44,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:44:44,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 30 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 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-07 12:44:44,499 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 30 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 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-07 12:44:44,500 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 30 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 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-07 12:44:44,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:44:44,508 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-07 12:44:44,508 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-07 12:44:44,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:44:44,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:44:44,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 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 32 states. [2022-04-07 12:44:44,510 INFO L87 Difference]: Start difference. First operand has 30 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 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 32 states. [2022-04-07 12:44:44,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:44:44,512 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-07 12:44:44,512 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-07 12:44:44,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:44:44,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:44:44,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:44:44,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:44:44,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 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-07 12:44:44,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-04-07 12:44:44,518 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 11 [2022-04-07 12:44:44,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:44:44,519 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-04-07 12:44:44,519 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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-07 12:44:44,519 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-04-07 12:44:44,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-07 12:44:44,520 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:44:44,520 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:44:44,520 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 12:44:44,521 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:44:44,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:44:44,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1248765655, now seen corresponding path program 1 times [2022-04-07 12:44:44,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:44:44,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542962666] [2022-04-07 12:44:44,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:44:44,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:44:44,548 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:44:44,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2080215054] [2022-04-07 12:44:44,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:44:44,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:44:44,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:44:44,556 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-07 12:44:44,559 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-07 12:44:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:44:44,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 12:44:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:44:44,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:44:44,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {357#true} call ULTIMATE.init(); {357#true} is VALID [2022-04-07 12:44:44,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {357#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); {357#true} is VALID [2022-04-07 12:44:44,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {357#true} assume true; {357#true} is VALID [2022-04-07 12:44:44,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {357#true} {357#true} #65#return; {357#true} is VALID [2022-04-07 12:44:44,808 INFO L272 TraceCheckUtils]: 4: Hoare triple {357#true} call #t~ret5 := main(); {357#true} is VALID [2022-04-07 12:44:44,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {357#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; {377#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-07 12:44:44,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {377#(and (= main_~a~0 0) (= main_~s~0 1))} assume !false; {377#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-07 12:44:44,810 INFO L272 TraceCheckUtils]: 7: Hoare triple {377#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {357#true} is VALID [2022-04-07 12:44:44,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {357#true} ~cond := #in~cond; {357#true} is VALID [2022-04-07 12:44:44,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {357#true} assume !(0 == ~cond); {357#true} is VALID [2022-04-07 12:44:44,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {357#true} assume true; {357#true} is VALID [2022-04-07 12:44:44,811 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {357#true} {377#(and (= main_~a~0 0) (= main_~s~0 1))} #53#return; {377#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-07 12:44:44,812 INFO L272 TraceCheckUtils]: 12: Hoare triple {377#(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)); {399#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:44:44,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {399#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {403#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:44:44,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {403#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {358#false} is VALID [2022-04-07 12:44:44,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {358#false} assume !false; {358#false} is VALID [2022-04-07 12:44:44,814 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-07 12:44:44,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 12:44:44,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:44:44,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542962666] [2022-04-07 12:44:44,817 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:44:44,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080215054] [2022-04-07 12:44:44,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080215054] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:44:44,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:44:44,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 12:44:44,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579830935] [2022-04-07 12:44:44,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:44:44,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 16 [2022-04-07 12:44:44,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:44:44,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-07 12:44:44,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:44:44,848 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 12:44:44,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:44:44,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 12:44:44,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 12:44:44,850 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-07 12:44:45,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:44:45,014 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-07 12:44:45,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 12:44:45,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 16 [2022-04-07 12:44:45,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:44:45,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-07 12:44:45,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-07 12:44:45,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-07 12:44:45,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-07 12:44:45,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 44 transitions. [2022-04-07 12:44:45,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:44:45,063 INFO L225 Difference]: With dead ends: 38 [2022-04-07 12:44:45,063 INFO L226 Difference]: Without dead ends: 36 [2022-04-07 12:44:45,064 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 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-07 12:44:45,066 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 80 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-07 12:44:45,067 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 80 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 12:44:45,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-07 12:44:45,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-07 12:44:45,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:44:45,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 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-07 12:44:45,081 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 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-07 12:44:45,082 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 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-07 12:44:45,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:44:45,088 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-04-07 12:44:45,088 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-07 12:44:45,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:44:45,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:44:45,095 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 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 36 states. [2022-04-07 12:44:45,095 INFO L87 Difference]: Start difference. First operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 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 36 states. [2022-04-07 12:44:45,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:44:45,101 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-04-07 12:44:45,101 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-07 12:44:45,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:44:45,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:44:45,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:44:45,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:44:45,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 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-07 12:44:45,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-07 12:44:45,108 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 16 [2022-04-07 12:44:45,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:44:45,109 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-07 12:44:45,109 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-07 12:44:45,109 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-07 12:44:45,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 12:44:45,110 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:44:45,110 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:44:45,138 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-07 12:44:45,323 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:44:45,324 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:44:45,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:44:45,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1451064513, now seen corresponding path program 1 times [2022-04-07 12:44:45,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:44:45,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915786681] [2022-04-07 12:44:45,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:44:45,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:44:45,335 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:44:45,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1594500196] [2022-04-07 12:44:45,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:44:45,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:44:45,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:44:45,338 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-07 12:44:45,339 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-07 12:44:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:44:45,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 12:44:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:44:45,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:44:45,503 INFO L272 TraceCheckUtils]: 0: Hoare triple {597#true} call ULTIMATE.init(); {597#true} is VALID [2022-04-07 12:44:45,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {597#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); {597#true} is VALID [2022-04-07 12:44:45,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {597#true} assume true; {597#true} is VALID [2022-04-07 12:44:45,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {597#true} {597#true} #65#return; {597#true} is VALID [2022-04-07 12:44:45,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {597#true} call #t~ret5 := main(); {597#true} is VALID [2022-04-07 12:44:45,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {597#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; {617#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-07 12:44:45,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {617#(and (= main_~t~0 1) (= main_~s~0 1))} assume !false; {617#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-07 12:44:45,505 INFO L272 TraceCheckUtils]: 7: Hoare triple {617#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {597#true} is VALID [2022-04-07 12:44:45,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {597#true} ~cond := #in~cond; {597#true} is VALID [2022-04-07 12:44:45,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {597#true} assume !(0 == ~cond); {597#true} is VALID [2022-04-07 12:44:45,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {597#true} assume true; {597#true} is VALID [2022-04-07 12:44:45,507 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {597#true} {617#(and (= main_~t~0 1) (= main_~s~0 1))} #53#return; {617#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-07 12:44:45,507 INFO L272 TraceCheckUtils]: 12: Hoare triple {617#(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)); {597#true} is VALID [2022-04-07 12:44:45,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {597#true} ~cond := #in~cond; {597#true} is VALID [2022-04-07 12:44:45,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {597#true} assume !(0 == ~cond); {597#true} is VALID [2022-04-07 12:44:45,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {597#true} assume true; {597#true} is VALID [2022-04-07 12:44:45,508 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {597#true} {617#(and (= main_~t~0 1) (= main_~s~0 1))} #55#return; {617#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-07 12:44:45,509 INFO L272 TraceCheckUtils]: 17: Hoare triple {617#(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)); {654#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:44:45,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {654#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {658#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:44:45,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {658#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {598#false} is VALID [2022-04-07 12:44:45,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {598#false} assume !false; {598#false} is VALID [2022-04-07 12:44:45,510 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-07 12:44:45,510 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 12:44:45,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:44:45,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915786681] [2022-04-07 12:44:45,510 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:44:45,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594500196] [2022-04-07 12:44:45,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594500196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:44:45,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:44:45,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 12:44:45,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735909662] [2022-04-07 12:44:45,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:44:45,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 21 [2022-04-07 12:44:45,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:44:45,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-07 12:44:45,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:44:45,528 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 12:44:45,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:44:45,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 12:44:45,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 12:44:45,529 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-07 12:44:45,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:44:45,656 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2022-04-07 12:44:45,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 12:44:45,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 21 [2022-04-07 12:44:45,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:44:45,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-07 12:44:45,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-07 12:44:45,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-07 12:44:45,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-07 12:44:45,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 44 transitions. [2022-04-07 12:44:45,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:44:45,700 INFO L225 Difference]: With dead ends: 42 [2022-04-07 12:44:45,700 INFO L226 Difference]: Without dead ends: 37 [2022-04-07 12:44:45,701 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 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-07 12:44:45,702 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 12:44:45,702 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 83 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 12:44:45,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-07 12:44:45,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-07 12:44:45,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:44:45,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 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-07 12:44:45,709 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 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-07 12:44:45,709 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 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-07 12:44:45,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:44:45,711 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-07 12:44:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-07 12:44:45,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:44:45,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:44:45,712 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 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 37 states. [2022-04-07 12:44:45,712 INFO L87 Difference]: Start difference. First operand has 37 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 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 37 states. [2022-04-07 12:44:45,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:44:45,714 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-07 12:44:45,714 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-07 12:44:45,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:44:45,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:44:45,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:44:45,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:44:45,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 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-07 12:44:45,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-04-07 12:44:45,717 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 21 [2022-04-07 12:44:45,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:44:45,717 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-04-07 12:44:45,717 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-07 12:44:45,717 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-07 12:44:45,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 12:44:45,718 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:44:45,718 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:44:45,742 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-07 12:44:45,941 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-07 12:44:45,941 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:44:45,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:44:45,942 INFO L85 PathProgramCache]: Analyzing trace with hash 412610311, now seen corresponding path program 1 times [2022-04-07 12:44:45,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:44:45,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145721270] [2022-04-07 12:44:45,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:44:45,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:44:45,956 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:44:45,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1844616282] [2022-04-07 12:44:45,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:44:45,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:44:45,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:44:45,957 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-07 12:44:45,975 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-07 12:44:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:44:46,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-07 12:44:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:44:46,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:44:46,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {860#true} call ULTIMATE.init(); {860#true} is VALID [2022-04-07 12:44:46,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {860#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); {860#true} is VALID [2022-04-07 12:44:46,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {860#true} assume true; {860#true} is VALID [2022-04-07 12:44:46,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {860#true} {860#true} #65#return; {860#true} is VALID [2022-04-07 12:44:46,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {860#true} call #t~ret5 := main(); {860#true} is VALID [2022-04-07 12:44:46,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {860#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; {880#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-07 12:44:46,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {880#(and (= main_~a~0 0) (= main_~t~0 1))} assume !false; {880#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-07 12:44:46,230 INFO L272 TraceCheckUtils]: 7: Hoare triple {880#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {860#true} is VALID [2022-04-07 12:44:46,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {860#true} ~cond := #in~cond; {860#true} is VALID [2022-04-07 12:44:46,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {860#true} assume !(0 == ~cond); {860#true} is VALID [2022-04-07 12:44:46,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {860#true} assume true; {860#true} is VALID [2022-04-07 12:44:46,231 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {860#true} {880#(and (= main_~a~0 0) (= main_~t~0 1))} #53#return; {880#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-07 12:44:46,231 INFO L272 TraceCheckUtils]: 12: Hoare triple {880#(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)); {860#true} is VALID [2022-04-07 12:44:46,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {860#true} ~cond := #in~cond; {860#true} is VALID [2022-04-07 12:44:46,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {860#true} assume !(0 == ~cond); {860#true} is VALID [2022-04-07 12:44:46,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {860#true} assume true; {860#true} is VALID [2022-04-07 12:44:46,232 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {860#true} {880#(and (= main_~a~0 0) (= main_~t~0 1))} #55#return; {880#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-07 12:44:46,232 INFO L272 TraceCheckUtils]: 17: Hoare triple {880#(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)); {860#true} is VALID [2022-04-07 12:44:46,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {860#true} ~cond := #in~cond; {860#true} is VALID [2022-04-07 12:44:46,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {860#true} assume !(0 == ~cond); {860#true} is VALID [2022-04-07 12:44:46,233 INFO L290 TraceCheckUtils]: 20: Hoare triple {860#true} assume true; {860#true} is VALID [2022-04-07 12:44:46,235 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {860#true} {880#(and (= main_~a~0 0) (= main_~t~0 1))} #57#return; {880#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-07 12:44:46,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {880#(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; {932#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-07 12:44:46,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {932#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} assume !false; {932#(and (= (+ (- 2) main_~t~0) 1) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-07 12:44:46,238 INFO L272 TraceCheckUtils]: 24: Hoare triple {932#(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)); {939#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:44:46,238 INFO L290 TraceCheckUtils]: 25: Hoare triple {939#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {943#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:44:46,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {943#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {861#false} is VALID [2022-04-07 12:44:46,239 INFO L290 TraceCheckUtils]: 27: Hoare triple {861#false} assume !false; {861#false} is VALID [2022-04-07 12:44:46,239 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-07 12:44:46,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:44:46,409 INFO L290 TraceCheckUtils]: 27: Hoare triple {861#false} assume !false; {861#false} is VALID [2022-04-07 12:44:46,410 INFO L290 TraceCheckUtils]: 26: Hoare triple {943#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {861#false} is VALID [2022-04-07 12:44:46,410 INFO L290 TraceCheckUtils]: 25: Hoare triple {939#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {943#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:44:46,411 INFO L272 TraceCheckUtils]: 24: Hoare triple {959#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {939#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:44:46,411 INFO L290 TraceCheckUtils]: 23: Hoare triple {959#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !false; {959#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-07 12:44:46,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {959#(= 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; {959#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-07 12:44:46,413 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {860#true} {959#(= main_~t~0 (+ (* main_~a~0 2) 1))} #57#return; {959#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-07 12:44:46,413 INFO L290 TraceCheckUtils]: 20: Hoare triple {860#true} assume true; {860#true} is VALID [2022-04-07 12:44:46,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {860#true} assume !(0 == ~cond); {860#true} is VALID [2022-04-07 12:44:46,416 INFO L290 TraceCheckUtils]: 18: Hoare triple {860#true} ~cond := #in~cond; {860#true} is VALID [2022-04-07 12:44:46,416 INFO L272 TraceCheckUtils]: 17: Hoare triple {959#(= 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)); {860#true} is VALID [2022-04-07 12:44:46,417 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {860#true} {959#(= main_~t~0 (+ (* main_~a~0 2) 1))} #55#return; {959#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-07 12:44:46,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {860#true} assume true; {860#true} is VALID [2022-04-07 12:44:46,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {860#true} assume !(0 == ~cond); {860#true} is VALID [2022-04-07 12:44:46,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {860#true} ~cond := #in~cond; {860#true} is VALID [2022-04-07 12:44:46,417 INFO L272 TraceCheckUtils]: 12: Hoare triple {959#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {860#true} is VALID [2022-04-07 12:44:46,418 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {860#true} {959#(= main_~t~0 (+ (* main_~a~0 2) 1))} #53#return; {959#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-07 12:44:46,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {860#true} assume true; {860#true} is VALID [2022-04-07 12:44:46,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {860#true} assume !(0 == ~cond); {860#true} is VALID [2022-04-07 12:44:46,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {860#true} ~cond := #in~cond; {860#true} is VALID [2022-04-07 12:44:46,420 INFO L272 TraceCheckUtils]: 7: Hoare triple {959#(= main_~t~0 (+ (* main_~a~0 2) 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {860#true} is VALID [2022-04-07 12:44:46,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {959#(= main_~t~0 (+ (* main_~a~0 2) 1))} assume !false; {959#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-07 12:44:46,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {860#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; {959#(= main_~t~0 (+ (* main_~a~0 2) 1))} is VALID [2022-04-07 12:44:46,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {860#true} call #t~ret5 := main(); {860#true} is VALID [2022-04-07 12:44:46,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {860#true} {860#true} #65#return; {860#true} is VALID [2022-04-07 12:44:46,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {860#true} assume true; {860#true} is VALID [2022-04-07 12:44:46,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {860#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); {860#true} is VALID [2022-04-07 12:44:46,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {860#true} call ULTIMATE.init(); {860#true} is VALID [2022-04-07 12:44:46,433 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-07 12:44:46,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:44:46,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145721270] [2022-04-07 12:44:46,434 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:44:46,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844616282] [2022-04-07 12:44:46,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844616282] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 12:44:46,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 12:44:46,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-07 12:44:46,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388669616] [2022-04-07 12:44:46,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:44:46,435 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, (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 28 [2022-04-07 12:44:46,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:44:46,435 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, (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-07 12:44:46,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:44:46,455 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 12:44:46,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:44:46,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 12:44:46,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-07 12:44:46,456 INFO L87 Difference]: Start difference. First operand 37 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, (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-07 12:44:46,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:44:46,601 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-07 12:44:46,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 12:44:46,601 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, (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 28 [2022-04-07 12:44:46,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:44:46,602 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, (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-07 12:44:46,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-07 12:44:46,604 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, (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-07 12:44:46,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-07 12:44:46,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-07 12:44:46,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:44:46,634 INFO L225 Difference]: With dead ends: 43 [2022-04-07 12:44:46,634 INFO L226 Difference]: Without dead ends: 41 [2022-04-07 12:44:46,635 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 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-07 12:44:46,635 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:44:46,636 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 56 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 12:44:46,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-07 12:44:46,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-07 12:44:46,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:44:46,651 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 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-07 12:44:46,651 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 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-07 12:44:46,652 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 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-07 12:44:46,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:44:46,654 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-04-07 12:44:46,654 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-07 12:44:46,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:44:46,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:44:46,654 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 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 41 states. [2022-04-07 12:44:46,655 INFO L87 Difference]: Start difference. First operand has 41 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 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 41 states. [2022-04-07 12:44:46,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:44:46,657 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-04-07 12:44:46,657 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-07 12:44:46,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:44:46,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:44:46,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:44:46,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:44:46,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 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-07 12:44:46,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-04-07 12:44:46,659 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 28 [2022-04-07 12:44:46,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:44:46,659 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-04-07 12:44:46,659 INFO L479 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, (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-07 12:44:46,660 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-07 12:44:46,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-07 12:44:46,660 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:44:46,660 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:44:46,688 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-07 12:44:46,875 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:44:46,876 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:44:46,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:44:46,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1543321117, now seen corresponding path program 2 times [2022-04-07 12:44:46,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:44:46,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050980745] [2022-04-07 12:44:46,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:44:46,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:44:46,888 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:44:46,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [68044027] [2022-04-07 12:44:46,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 12:44:46,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:44:46,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:44:46,890 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-07 12:44:46,893 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-07 12:44:46,940 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 12:44:46,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 12:44:46,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-07 12:44:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:44:46,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:44:47,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {1242#true} call ULTIMATE.init(); {1242#true} is VALID [2022-04-07 12:44:47,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {1242#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); {1242#true} is VALID [2022-04-07 12:44:47,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {1242#true} assume true; {1242#true} is VALID [2022-04-07 12:44:47,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1242#true} {1242#true} #65#return; {1242#true} is VALID [2022-04-07 12:44:47,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {1242#true} call #t~ret5 := main(); {1242#true} is VALID [2022-04-07 12:44:47,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {1242#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; {1262#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-07 12:44:47,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {1262#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} assume !false; {1262#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-07 12:44:47,142 INFO L272 TraceCheckUtils]: 7: Hoare triple {1262#(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)); {1242#true} is VALID [2022-04-07 12:44:47,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {1242#true} ~cond := #in~cond; {1242#true} is VALID [2022-04-07 12:44:47,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {1242#true} assume !(0 == ~cond); {1242#true} is VALID [2022-04-07 12:44:47,142 INFO L290 TraceCheckUtils]: 10: Hoare triple {1242#true} assume true; {1242#true} is VALID [2022-04-07 12:44:47,143 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1242#true} {1262#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #53#return; {1262#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-07 12:44:47,143 INFO L272 TraceCheckUtils]: 12: Hoare triple {1262#(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)); {1242#true} is VALID [2022-04-07 12:44:47,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {1242#true} ~cond := #in~cond; {1242#true} is VALID [2022-04-07 12:44:47,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {1242#true} assume !(0 == ~cond); {1242#true} is VALID [2022-04-07 12:44:47,143 INFO L290 TraceCheckUtils]: 15: Hoare triple {1242#true} assume true; {1242#true} is VALID [2022-04-07 12:44:47,144 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1242#true} {1262#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #55#return; {1262#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-07 12:44:47,144 INFO L272 TraceCheckUtils]: 17: Hoare triple {1262#(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)); {1242#true} is VALID [2022-04-07 12:44:47,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {1242#true} ~cond := #in~cond; {1242#true} is VALID [2022-04-07 12:44:47,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {1242#true} assume !(0 == ~cond); {1242#true} is VALID [2022-04-07 12:44:47,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {1242#true} assume true; {1242#true} is VALID [2022-04-07 12:44:47,145 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1242#true} {1262#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} #57#return; {1262#(and (= main_~a~0 0) (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-07 12:44:47,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {1262#(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; {1314#(and (= 3 (+ (- 1) main_~s~0)) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-07 12:44:47,146 INFO L290 TraceCheckUtils]: 23: Hoare triple {1314#(and (= 3 (+ (- 1) main_~s~0)) (= (+ (- 1) main_~a~0) 0))} assume !false; {1314#(and (= 3 (+ (- 1) main_~s~0)) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-07 12:44:47,146 INFO L272 TraceCheckUtils]: 24: Hoare triple {1314#(and (= 3 (+ (- 1) main_~s~0)) (= (+ (- 1) main_~a~0) 0))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1242#true} is VALID [2022-04-07 12:44:47,147 INFO L290 TraceCheckUtils]: 25: Hoare triple {1242#true} ~cond := #in~cond; {1242#true} is VALID [2022-04-07 12:44:47,147 INFO L290 TraceCheckUtils]: 26: Hoare triple {1242#true} assume !(0 == ~cond); {1242#true} is VALID [2022-04-07 12:44:47,147 INFO L290 TraceCheckUtils]: 27: Hoare triple {1242#true} assume true; {1242#true} is VALID [2022-04-07 12:44:47,148 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1242#true} {1314#(and (= 3 (+ (- 1) main_~s~0)) (= (+ (- 1) main_~a~0) 0))} #53#return; {1314#(and (= 3 (+ (- 1) main_~s~0)) (= (+ (- 1) main_~a~0) 0))} is VALID [2022-04-07 12:44:47,148 INFO L272 TraceCheckUtils]: 29: Hoare triple {1314#(and (= 3 (+ (- 1) main_~s~0)) (= (+ (- 1) main_~a~0) 0))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {1336#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:44:47,149 INFO L290 TraceCheckUtils]: 30: Hoare triple {1336#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1340#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:44:47,149 INFO L290 TraceCheckUtils]: 31: Hoare triple {1340#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1243#false} is VALID [2022-04-07 12:44:47,150 INFO L290 TraceCheckUtils]: 32: Hoare triple {1243#false} assume !false; {1243#false} is VALID [2022-04-07 12:44:47,150 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-07 12:44:47,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:44:47,331 INFO L290 TraceCheckUtils]: 32: Hoare triple {1243#false} assume !false; {1243#false} is VALID [2022-04-07 12:44:47,331 INFO L290 TraceCheckUtils]: 31: Hoare triple {1340#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1243#false} is VALID [2022-04-07 12:44:47,332 INFO L290 TraceCheckUtils]: 30: Hoare triple {1336#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1340#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:44:47,332 INFO L272 TraceCheckUtils]: 29: Hoare triple {1356#(= (+ (* 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)); {1336#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:44:47,333 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1242#true} {1356#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} #53#return; {1356#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-07 12:44:47,333 INFO L290 TraceCheckUtils]: 27: Hoare triple {1242#true} assume true; {1242#true} is VALID [2022-04-07 12:44:47,333 INFO L290 TraceCheckUtils]: 26: Hoare triple {1242#true} assume !(0 == ~cond); {1242#true} is VALID [2022-04-07 12:44:47,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {1242#true} ~cond := #in~cond; {1242#true} is VALID [2022-04-07 12:44:47,333 INFO L272 TraceCheckUtils]: 24: Hoare triple {1356#(= (+ (* 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)); {1242#true} is VALID [2022-04-07 12:44:47,334 INFO L290 TraceCheckUtils]: 23: Hoare triple {1356#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} assume !false; {1356#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-07 12:44:47,382 INFO L290 TraceCheckUtils]: 22: Hoare triple {1378#(= (+ (* (+ 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; {1356#(= (+ (* main_~a~0 2) (* main_~a~0 main_~a~0) 1) main_~s~0)} is VALID [2022-04-07 12:44:47,383 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1242#true} {1378#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #57#return; {1378#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-07 12:44:47,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {1242#true} assume true; {1242#true} is VALID [2022-04-07 12:44:47,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {1242#true} assume !(0 == ~cond); {1242#true} is VALID [2022-04-07 12:44:47,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {1242#true} ~cond := #in~cond; {1242#true} is VALID [2022-04-07 12:44:47,384 INFO L272 TraceCheckUtils]: 17: Hoare triple {1378#(= (+ (* (+ 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)); {1242#true} is VALID [2022-04-07 12:44:47,384 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1242#true} {1378#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #55#return; {1378#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-07 12:44:47,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {1242#true} assume true; {1242#true} is VALID [2022-04-07 12:44:47,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {1242#true} assume !(0 == ~cond); {1242#true} is VALID [2022-04-07 12:44:47,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {1242#true} ~cond := #in~cond; {1242#true} is VALID [2022-04-07 12:44:47,385 INFO L272 TraceCheckUtils]: 12: Hoare triple {1378#(= (+ (* (+ 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)); {1242#true} is VALID [2022-04-07 12:44:47,385 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1242#true} {1378#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} #53#return; {1378#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-07 12:44:47,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {1242#true} assume true; {1242#true} is VALID [2022-04-07 12:44:47,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {1242#true} assume !(0 == ~cond); {1242#true} is VALID [2022-04-07 12:44:47,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {1242#true} ~cond := #in~cond; {1242#true} is VALID [2022-04-07 12:44:47,386 INFO L272 TraceCheckUtils]: 7: Hoare triple {1378#(= (+ (* (+ 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)); {1242#true} is VALID [2022-04-07 12:44:47,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {1378#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} assume !false; {1378#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-07 12:44:47,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {1242#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; {1378#(= (+ (* (+ main_~a~0 1) (+ main_~a~0 1)) (* main_~a~0 2) 3) (+ main_~t~0 main_~s~0 2))} is VALID [2022-04-07 12:44:47,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {1242#true} call #t~ret5 := main(); {1242#true} is VALID [2022-04-07 12:44:47,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1242#true} {1242#true} #65#return; {1242#true} is VALID [2022-04-07 12:44:47,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {1242#true} assume true; {1242#true} is VALID [2022-04-07 12:44:47,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {1242#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); {1242#true} is VALID [2022-04-07 12:44:47,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {1242#true} call ULTIMATE.init(); {1242#true} is VALID [2022-04-07 12:44:47,388 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-07 12:44:47,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:44:47,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050980745] [2022-04-07 12:44:47,388 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:44:47,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68044027] [2022-04-07 12:44:47,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68044027] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:44:47,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:44:47,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-07 12:44:47,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788904949] [2022-04-07 12:44:47,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:44:47,389 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 33 [2022-04-07 12:44:47,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:44:47,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-07 12:44:47,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:44:47,427 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 12:44:47,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:44:47,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 12:44:47,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-07 12:44:47,428 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-07 12:44:47,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:44:47,876 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-04-07 12:44:47,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 12:44:47,876 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 33 [2022-04-07 12:44:47,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:44:47,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-07 12:44:47,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-07 12:44:47,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-07 12:44:47,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-07 12:44:47,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2022-04-07 12:44:47,946 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-07 12:44:47,946 INFO L225 Difference]: With dead ends: 49 [2022-04-07 12:44:47,947 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 12:44:47,947 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-07 12:44:47,948 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 9 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 12:44:47,948 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 60 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 12:44:47,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 12:44:47,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 12:44:47,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:44:47,949 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-07 12:44:47,949 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-07 12:44:47,949 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-07 12:44:47,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:44:47,949 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 12:44:47,949 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 12:44:47,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:44:47,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:44:47,949 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-07 12:44:47,950 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-07 12:44:47,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:44:47,950 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 12:44:47,950 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 12:44:47,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:44:47,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:44:47,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:44:47,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:44:47,950 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-07 12:44:47,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 12:44:47,950 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2022-04-07 12:44:47,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:44:47,951 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 12:44:47,951 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-07 12:44:47,951 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 12:44:47,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:44:47,953 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 12:44:47,983 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-07 12:44:48,166 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:44:48,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 12:44:48,356 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-07 12:44:48,356 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-07 12:44:48,356 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-07 12:44:48,356 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 8 10) no Hoare annotation was computed. [2022-04-07 12:44:48,356 INFO L882 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-04-07 12:44:48,356 INFO L882 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-04-07 12:44:48,356 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-04-07 12:44:48,356 INFO L882 garLoopResultBuilder]: For program point L32(lines 29 41) no Hoare annotation was computed. [2022-04-07 12:44:48,356 INFO L878 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (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))) [2022-04-07 12:44:48,357 INFO L878 garLoopResultBuilder]: At program point L30(line 30) the Hoare annotation is: (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))) [2022-04-07 12:44:48,357 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 20 48) the Hoare annotation is: true [2022-04-07 12:44:48,357 INFO L878 garLoopResultBuilder]: At program point L30-1(line 30) the Hoare annotation is: (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))) [2022-04-07 12:44:48,357 INFO L878 garLoopResultBuilder]: At program point L29-2(lines 29 41) the Hoare annotation is: (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))) [2022-04-07 12:44:48,357 INFO L878 garLoopResultBuilder]: At program point L29-3(lines 29 41) the Hoare annotation is: (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))) [2022-04-07 12:44:48,357 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 20 48) no Hoare annotation was computed. [2022-04-07 12:44:48,357 INFO L882 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2022-04-07 12:44:48,357 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 20 48) no Hoare annotation was computed. [2022-04-07 12:44:48,357 INFO L878 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))) (and (= main_~t~0 1) (= main_~s~0 1))) [2022-04-07 12:44:48,357 INFO L878 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: (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))) [2022-04-07 12:44:48,357 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 12:44:48,357 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-07 12:44:48,357 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 12:44:48,357 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 12:44:48,357 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 12:44:48,357 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 12:44:48,358 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 12:44:48,358 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-07 12:44:48,358 INFO L882 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-04-07 12:44:48,358 INFO L882 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-04-07 12:44:48,358 INFO L882 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-04-07 12:44:48,358 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-04-07 12:44:48,358 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-04-07 12:44:48,360 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-04-07 12:44:48,361 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 12:44:48,370 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-07 12:44:48,370 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 12:44:48,371 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-07 12:44:48,373 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-07 12:44:48,373 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-07 12:44:48,373 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 12:44:48,373 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 12:44:48,373 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-07 12:44:48,373 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-07 12:44:48,374 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-07 12:44:48,374 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-07 12:44:48,374 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 12:44:48,374 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 12:44:48,374 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-07 12:44:48,374 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-07 12:44:48,375 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-07 12:44:48,375 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-07 12:44:48,375 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:44:48,375 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:44:48,375 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:44:48,375 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:44:48,375 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:44:48,375 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:44:48,375 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-07 12:44:48,375 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-07 12:44:48,375 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-07 12:44:48,375 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-07 12:44:48,375 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-07 12:44:48,375 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 12:44:48,375 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 12:44:48,375 INFO L163 areAnnotationChecker]: CFG has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-07 12:44:48,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 12:44:48 BoogieIcfgContainer [2022-04-07 12:44:48,382 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 12:44:48,383 INFO L158 Benchmark]: Toolchain (without parser) took 5765.51ms. Allocated memory was 177.2MB in the beginning and 251.7MB in the end (delta: 74.4MB). Free memory was 117.3MB in the beginning and 144.5MB in the end (delta: -27.2MB). Peak memory consumption was 48.2MB. Max. memory is 8.0GB. [2022-04-07 12:44:48,384 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 177.2MB. Free memory is still 133.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 12:44:48,384 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.83ms. Allocated memory was 177.2MB in the beginning and 251.7MB in the end (delta: 74.4MB). Free memory was 117.0MB in the beginning and 222.5MB in the end (delta: -105.5MB). Peak memory consumption was 12.8MB. Max. memory is 8.0GB. [2022-04-07 12:44:48,384 INFO L158 Benchmark]: Boogie Preprocessor took 41.95ms. Allocated memory is still 251.7MB. Free memory was 222.5MB in the beginning and 220.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 12:44:48,384 INFO L158 Benchmark]: RCFGBuilder took 319.17ms. Allocated memory is still 251.7MB. Free memory was 220.9MB in the beginning and 209.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 12:44:48,385 INFO L158 Benchmark]: TraceAbstraction took 5129.52ms. Allocated memory is still 251.7MB. Free memory was 208.8MB in the beginning and 144.5MB in the end (delta: 64.4MB). Peak memory consumption was 65.4MB. Max. memory is 8.0GB. [2022-04-07 12:44:48,386 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 177.2MB. Free memory is still 133.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 269.83ms. Allocated memory was 177.2MB in the beginning and 251.7MB in the end (delta: 74.4MB). Free memory was 117.0MB in the beginning and 222.5MB in the end (delta: -105.5MB). Peak memory consumption was 12.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.95ms. Allocated memory is still 251.7MB. Free memory was 222.5MB in the beginning and 220.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 319.17ms. Allocated memory is still 251.7MB. Free memory was 220.9MB in the beginning and 209.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5129.52ms. Allocated memory is still 251.7MB. Free memory was 208.8MB in the beginning and 144.5MB in the end (delta: 64.4MB). Peak memory consumption was 65.4MB. 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, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 79 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59 mSDsluCounter, 340 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 206 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 326 IncrementalHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 134 mSDtfsCounter, 326 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 141 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=5, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 35 PreInvPairs, 56 NumberOfFragments, 159 HoareAnnotationTreeSize, 35 FomulaSimplifications, 4 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 476 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 173 ConstructedInterpolants, 0 QuantifiedInterpolants, 555 SizeOfPredicates, 5 NumberOfNonLiveVariables, 342 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 112/120 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: 29]: Loop Invariant Derived loop invariant: t + s == a * 4 + 2 + a * a && t == a * 2 + 1 RESULT: Ultimate proved your program to be correct! [2022-04-07 12:44:48,404 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...