/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:15:18,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:15:18,276 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:15:18,340 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:15:18,341 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:15:18,341 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:15:18,345 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:15:18,348 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:15:18,350 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:15:18,353 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:15:18,354 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:15:18,355 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:15:18,355 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:15:18,357 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:15:18,358 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:15:18,360 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:15:18,361 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:15:18,361 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:15:18,363 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:15:18,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:15:18,368 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:15:18,369 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:15:18,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:15:18,370 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:15:18,371 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:15:18,376 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:15:18,376 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:15:18,376 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:15:18,377 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:15:18,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:15:18,378 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:15:18,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:15:18,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:15:18,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:15:18,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:15:18,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:15:18,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:15:18,381 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:15:18,382 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:15:18,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:15:18,382 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:15:18,384 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:15:18,384 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 12:15:18,399 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:15:18,400 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:15:18,400 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:15:18,400 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:15:18,400 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:15:18,400 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:15:18,401 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:15:18,401 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:15:18,401 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:15:18,401 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:15:18,401 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:15:18,401 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:15:18,401 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:15:18,402 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:15:18,402 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:15:18,402 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:15:18,402 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:15:18,402 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:15:18,402 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:15:18,402 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:15:18,402 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:15:18,402 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:15:18,403 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:15:18,403 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:15:18,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:15:18,403 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:15:18,403 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:15:18,403 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:15:18,403 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:15:18,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:15:18,403 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:15:18,403 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:15:18,404 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:15:18,404 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 12:15:18,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:15:18,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:15:18,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:15:18,617 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:15:18,617 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:15:18,618 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound1.c [2022-04-27 12:15:18,660 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ca47a01e/5441fe29da674be7930a570f6cbc1c58/FLAGd7101754b [2022-04-27 12:15:18,983 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:15:18,983 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound1.c [2022-04-27 12:15:18,988 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ca47a01e/5441fe29da674be7930a570f6cbc1c58/FLAGd7101754b [2022-04-27 12:15:19,399 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ca47a01e/5441fe29da674be7930a570f6cbc1c58 [2022-04-27 12:15:19,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:15:19,403 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:15:19,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:15:19,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:15:19,406 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:15:19,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:15:19" (1/1) ... [2022-04-27 12:15:19,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56da390c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:15:19, skipping insertion in model container [2022-04-27 12:15:19,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:15:19" (1/1) ... [2022-04-27 12:15:19,412 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:15:19,423 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:15:19,536 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound1.c[576,589] [2022-04-27 12:15:19,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:15:19,563 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:15:19,579 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound1.c[576,589] [2022-04-27 12:15:19,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:15:19,599 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:15:19,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:15:19 WrapperNode [2022-04-27 12:15:19,599 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:15:19,600 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:15:19,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:15:19,600 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:15:19,606 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:15:19" (1/1) ... [2022-04-27 12:15:19,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:15:19" (1/1) ... [2022-04-27 12:15:19,609 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:15:19" (1/1) ... [2022-04-27 12:15:19,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:15:19" (1/1) ... [2022-04-27 12:15:19,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:15:19" (1/1) ... [2022-04-27 12:15:19,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:15:19" (1/1) ... [2022-04-27 12:15:19,616 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:15:19" (1/1) ... [2022-04-27 12:15:19,618 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:15:19,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:15:19,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:15:19,618 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:15:19,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:15:19" (1/1) ... [2022-04-27 12:15:19,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:15:19,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:15:19,643 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 12:15:19,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 12:15:19,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:15:19,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:15:19,677 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:15:19,678 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:15:19,678 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:15:19,678 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:15:19,678 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:15:19,678 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:15:19,678 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:15:19,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:15:19,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 12:15:19,678 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:15:19,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:15:19,678 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:15:19,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:15:19,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:15:19,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:15:19,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:15:19,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:15:19,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:15:19,720 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:15:19,721 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:15:19,898 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:15:19,916 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:15:19,916 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 12:15:19,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:15:19 BoogieIcfgContainer [2022-04-27 12:15:19,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:15:19,919 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:15:19,919 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:15:19,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:15:19,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:15:19" (1/3) ... [2022-04-27 12:15:19,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9b1918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:15:19, skipping insertion in model container [2022-04-27 12:15:19,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:15:19" (2/3) ... [2022-04-27 12:15:19,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9b1918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:15:19, skipping insertion in model container [2022-04-27 12:15:19,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:15:19" (3/3) ... [2022-04-27 12:15:19,922 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_unwindbound1.c [2022-04-27 12:15:19,937 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:15:19,937 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:15:19,979 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:15:19,985 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@18710200, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@79aa6d17 [2022-04-27 12:15:19,985 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:15:19,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:15:19,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 12:15:19,998 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:15:19,999 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:15:20,000 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:15:20,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:15:20,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1588022502, now seen corresponding path program 1 times [2022-04-27 12:15:20,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:15:20,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154597363] [2022-04-27 12:15:20,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:15:20,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:15:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:15:20,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:15:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:15:20,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {41#true} is VALID [2022-04-27 12:15:20,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-27 12:15:20,193 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #93#return; {41#true} is VALID [2022-04-27 12:15:20,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:15:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:15:20,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-27 12:15:20,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-27 12:15:20,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-27 12:15:20,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} #77#return; {42#false} is VALID [2022-04-27 12:15:20,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {50#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:15:20,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {50#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {41#true} is VALID [2022-04-27 12:15:20,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-27 12:15:20,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #93#return; {41#true} is VALID [2022-04-27 12:15:20,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret8 := main(); {41#true} is VALID [2022-04-27 12:15:20,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {41#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {41#true} is VALID [2022-04-27 12:15:20,210 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {41#true} is VALID [2022-04-27 12:15:20,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-27 12:15:20,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-27 12:15:20,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-27 12:15:20,211 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} #77#return; {42#false} is VALID [2022-04-27 12:15:20,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {42#false} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {42#false} is VALID [2022-04-27 12:15:20,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#false} assume !true; {42#false} is VALID [2022-04-27 12:15:20,211 INFO L272 TraceCheckUtils]: 13: Hoare triple {42#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {42#false} is VALID [2022-04-27 12:15:20,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2022-04-27 12:15:20,212 INFO L290 TraceCheckUtils]: 15: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2022-04-27 12:15:20,212 INFO L290 TraceCheckUtils]: 16: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-27 12:15:20,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:15:20,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:15:20,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154597363] [2022-04-27 12:15:20,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154597363] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:15:20,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:15:20,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:15:20,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717123430] [2022-04-27 12:15:20,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:15:20,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 12:15:20,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:15:20,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:15:20,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:15:20,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:15:20,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:15:20,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:15:20,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:15:20,268 INFO L87 Difference]: Start difference. First operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:15:20,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:20,452 INFO L93 Difference]: Finished difference Result 68 states and 101 transitions. [2022-04-27 12:15:20,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:15:20,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 12:15:20,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:15:20,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:15:20,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-27 12:15:20,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:15:20,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-27 12:15:20,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-27 12:15:20,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:15:20,554 INFO L225 Difference]: With dead ends: 68 [2022-04-27 12:15:20,554 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 12:15:20,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:15:20,558 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:15:20,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:15:20,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 12:15:20,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-27 12:15:20,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:15:20,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:15:20,579 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:15:20,579 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:15:20,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:20,583 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-27 12:15:20,583 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-27 12:15:20,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:15:20,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:15:20,584 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 34 states. [2022-04-27 12:15:20,584 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 34 states. [2022-04-27 12:15:20,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:20,587 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-27 12:15:20,587 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-27 12:15:20,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:15:20,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:15:20,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:15:20,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:15:20,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:15:20,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-04-27 12:15:20,591 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 17 [2022-04-27 12:15:20,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:15:20,591 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-04-27 12:15:20,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:15:20,592 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-04-27 12:15:20,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 12:15:20,592 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:15:20,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:15:20,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:15:20,592 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:15:20,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:15:20,593 INFO L85 PathProgramCache]: Analyzing trace with hash 766070672, now seen corresponding path program 1 times [2022-04-27 12:15:20,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:15:20,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811661168] [2022-04-27 12:15:20,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:15:20,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:15:20,616 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:15:20,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1254500898] [2022-04-27 12:15:20,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:15:20,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:15:20,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:15:20,628 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:15:20,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 12:15:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:15:20,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 12:15:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:15:20,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:15:20,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {265#true} call ULTIMATE.init(); {265#true} is VALID [2022-04-27 12:15:20,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {265#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {273#(<= ~counter~0 0)} is VALID [2022-04-27 12:15:20,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {273#(<= ~counter~0 0)} assume true; {273#(<= ~counter~0 0)} is VALID [2022-04-27 12:15:20,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {273#(<= ~counter~0 0)} {265#true} #93#return; {273#(<= ~counter~0 0)} is VALID [2022-04-27 12:15:20,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {273#(<= ~counter~0 0)} call #t~ret8 := main(); {273#(<= ~counter~0 0)} is VALID [2022-04-27 12:15:20,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {273#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {273#(<= ~counter~0 0)} is VALID [2022-04-27 12:15:20,818 INFO L272 TraceCheckUtils]: 6: Hoare triple {273#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {273#(<= ~counter~0 0)} is VALID [2022-04-27 12:15:20,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {273#(<= ~counter~0 0)} ~cond := #in~cond; {273#(<= ~counter~0 0)} is VALID [2022-04-27 12:15:20,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {273#(<= ~counter~0 0)} assume !(0 == ~cond); {273#(<= ~counter~0 0)} is VALID [2022-04-27 12:15:20,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {273#(<= ~counter~0 0)} assume true; {273#(<= ~counter~0 0)} is VALID [2022-04-27 12:15:20,820 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {273#(<= ~counter~0 0)} {273#(<= ~counter~0 0)} #77#return; {273#(<= ~counter~0 0)} is VALID [2022-04-27 12:15:20,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {273#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {273#(<= ~counter~0 0)} is VALID [2022-04-27 12:15:20,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {273#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {307#(<= |main_#t~post6| 0)} is VALID [2022-04-27 12:15:20,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {307#(<= |main_#t~post6| 0)} assume !(#t~post6 < 1);havoc #t~post6; {266#false} is VALID [2022-04-27 12:15:20,822 INFO L272 TraceCheckUtils]: 14: Hoare triple {266#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {266#false} is VALID [2022-04-27 12:15:20,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {266#false} ~cond := #in~cond; {266#false} is VALID [2022-04-27 12:15:20,822 INFO L290 TraceCheckUtils]: 16: Hoare triple {266#false} assume 0 == ~cond; {266#false} is VALID [2022-04-27 12:15:20,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {266#false} assume !false; {266#false} is VALID [2022-04-27 12:15:20,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:15:20,823 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:15:20,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:15:20,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811661168] [2022-04-27 12:15:20,823 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:15:20,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254500898] [2022-04-27 12:15:20,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254500898] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:15:20,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:15:20,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 12:15:20,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707375509] [2022-04-27 12:15:20,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:15:20,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-27 12:15:20,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:15:20,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:15:20,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:15:20,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 12:15:20,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:15:20,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 12:15:20,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 12:15:20,840 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:15:20,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:20,906 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-27 12:15:20,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 12:15:20,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-27 12:15:20,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:15:20,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:15:20,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-27 12:15:20,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:15:20,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-27 12:15:20,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2022-04-27 12:15:20,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:15:20,943 INFO L225 Difference]: With dead ends: 42 [2022-04-27 12:15:20,944 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 12:15:20,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 12:15:20,945 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:15:20,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:15:20,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 12:15:20,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-27 12:15:20,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:15:20,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:15:20,953 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:15:20,954 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:15:20,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:20,956 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-27 12:15:20,956 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-27 12:15:20,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:15:20,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:15:20,957 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 35 states. [2022-04-27 12:15:20,957 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 35 states. [2022-04-27 12:15:20,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:20,959 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-27 12:15:20,959 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-27 12:15:20,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:15:20,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:15:20,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:15:20,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:15:20,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:15:20,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-27 12:15:20,961 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 18 [2022-04-27 12:15:20,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:15:20,962 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-27 12:15:20,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:15:20,962 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-27 12:15:20,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 12:15:20,962 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:15:20,962 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:15:20,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 12:15:21,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:15:21,178 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:15:21,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:15:21,178 INFO L85 PathProgramCache]: Analyzing trace with hash 767560222, now seen corresponding path program 1 times [2022-04-27 12:15:21,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:15:21,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201027978] [2022-04-27 12:15:21,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:15:21,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:15:21,193 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:15:21,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1917027426] [2022-04-27 12:15:21,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:15:21,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:15:21,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:15:21,199 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:15:21,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 12:15:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:15:21,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:15:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:15:21,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:15:21,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {505#true} call ULTIMATE.init(); {505#true} is VALID [2022-04-27 12:15:21,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {505#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {505#true} is VALID [2022-04-27 12:15:21,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {505#true} assume true; {505#true} is VALID [2022-04-27 12:15:21,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {505#true} {505#true} #93#return; {505#true} is VALID [2022-04-27 12:15:21,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {505#true} call #t~ret8 := main(); {505#true} is VALID [2022-04-27 12:15:21,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {505#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {505#true} is VALID [2022-04-27 12:15:21,922 INFO L272 TraceCheckUtils]: 6: Hoare triple {505#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {505#true} is VALID [2022-04-27 12:15:21,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {505#true} ~cond := #in~cond; {505#true} is VALID [2022-04-27 12:15:21,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {505#true} assume !(0 == ~cond); {505#true} is VALID [2022-04-27 12:15:21,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {505#true} assume true; {505#true} is VALID [2022-04-27 12:15:21,923 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {505#true} {505#true} #77#return; {505#true} is VALID [2022-04-27 12:15:21,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {505#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {543#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-27 12:15:21,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {543#(and (= main_~a~0 0) (= main_~b~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {543#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-27 12:15:21,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {543#(and (= main_~a~0 0) (= main_~b~0 0))} assume !!(#t~post6 < 1);havoc #t~post6; {543#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-27 12:15:21,925 INFO L272 TraceCheckUtils]: 14: Hoare triple {543#(and (= main_~a~0 0) (= main_~b~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {553#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:15:21,926 INFO L290 TraceCheckUtils]: 15: Hoare triple {553#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {557#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:15:21,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {557#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {506#false} is VALID [2022-04-27 12:15:21,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {506#false} assume !false; {506#false} is VALID [2022-04-27 12:15:21,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:15:21,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:15:21,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:15:21,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201027978] [2022-04-27 12:15:21,927 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:15:21,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917027426] [2022-04-27 12:15:21,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917027426] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:15:21,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:15:21,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:15:21,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059757288] [2022-04-27 12:15:21,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:15:21,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 12:15:21,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:15:21,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:15:21,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:15:21,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:15:21,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:15:21,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:15:21,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:15:21,955 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:15:22,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:22,093 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-27 12:15:22,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:15:22,093 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 12:15:22,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:15:22,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:15:22,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-27 12:15:22,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:15:22,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-27 12:15:22,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2022-04-27 12:15:22,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:15:22,142 INFO L225 Difference]: With dead ends: 45 [2022-04-27 12:15:22,142 INFO L226 Difference]: Without dead ends: 43 [2022-04-27 12:15:22,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:15:22,144 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:15:22,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 145 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:15:22,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-27 12:15:22,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-04-27 12:15:22,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:15:22,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:15:22,163 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:15:22,163 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:15:22,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:22,165 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-27 12:15:22,165 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-27 12:15:22,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:15:22,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:15:22,166 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 43 states. [2022-04-27 12:15:22,166 INFO L87 Difference]: Start difference. First operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 43 states. [2022-04-27 12:15:22,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:22,168 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-27 12:15:22,168 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-27 12:15:22,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:15:22,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:15:22,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:15:22,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:15:22,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:15:22,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-04-27 12:15:22,171 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 18 [2022-04-27 12:15:22,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:15:22,171 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-04-27 12:15:22,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:15:22,171 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-27 12:15:22,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 12:15:22,171 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:15:22,172 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:15:22,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 12:15:22,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 12:15:22,384 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:15:22,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:15:22,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1016228092, now seen corresponding path program 1 times [2022-04-27 12:15:22,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:15:22,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098105674] [2022-04-27 12:15:22,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:15:22,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:15:22,397 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:15:22,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1115879346] [2022-04-27 12:15:22,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:15:22,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:15:22,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:15:22,399 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:15:22,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 12:15:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:15:22,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:15:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:15:22,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:15:26,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {776#true} call ULTIMATE.init(); {776#true} is VALID [2022-04-27 12:15:26,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {776#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {776#true} is VALID [2022-04-27 12:15:26,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {776#true} assume true; {776#true} is VALID [2022-04-27 12:15:26,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {776#true} {776#true} #93#return; {776#true} is VALID [2022-04-27 12:15:26,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {776#true} call #t~ret8 := main(); {776#true} is VALID [2022-04-27 12:15:26,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {776#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {776#true} is VALID [2022-04-27 12:15:26,568 INFO L272 TraceCheckUtils]: 6: Hoare triple {776#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {776#true} is VALID [2022-04-27 12:15:26,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {776#true} ~cond := #in~cond; {776#true} is VALID [2022-04-27 12:15:26,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {776#true} assume !(0 == ~cond); {776#true} is VALID [2022-04-27 12:15:26,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {776#true} assume true; {776#true} is VALID [2022-04-27 12:15:26,569 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {776#true} {776#true} #77#return; {776#true} is VALID [2022-04-27 12:15:26,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {776#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {814#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:15:26,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {814#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {814#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:15:26,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {814#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 1);havoc #t~post6; {814#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:15:26,570 INFO L272 TraceCheckUtils]: 14: Hoare triple {814#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {776#true} is VALID [2022-04-27 12:15:26,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {776#true} ~cond := #in~cond; {776#true} is VALID [2022-04-27 12:15:26,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {776#true} assume !(0 == ~cond); {776#true} is VALID [2022-04-27 12:15:26,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {776#true} assume true; {776#true} is VALID [2022-04-27 12:15:26,571 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {776#true} {814#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {814#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:15:26,572 INFO L272 TraceCheckUtils]: 19: Hoare triple {814#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {839#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:15:26,572 INFO L290 TraceCheckUtils]: 20: Hoare triple {839#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {843#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:15:26,573 INFO L290 TraceCheckUtils]: 21: Hoare triple {843#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {777#false} is VALID [2022-04-27 12:15:26,573 INFO L290 TraceCheckUtils]: 22: Hoare triple {777#false} assume !false; {777#false} is VALID [2022-04-27 12:15:26,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:15:26,573 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:15:26,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:15:26,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098105674] [2022-04-27 12:15:26,574 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:15:26,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115879346] [2022-04-27 12:15:26,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115879346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:15:26,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:15:26,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:15:26,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125108121] [2022-04-27 12:15:26,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:15:26,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 23 [2022-04-27 12:15:26,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:15:26,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:15:26,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:15:26,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:15:26,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:15:26,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:15:26,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:15:26,590 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:15:26,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:26,779 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-04-27 12:15:26,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:15:26,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 23 [2022-04-27 12:15:26,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:15:26,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:15:26,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-27 12:15:26,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:15:26,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-27 12:15:26,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-27 12:15:26,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:15:26,832 INFO L225 Difference]: With dead ends: 58 [2022-04-27 12:15:26,832 INFO L226 Difference]: Without dead ends: 55 [2022-04-27 12:15:26,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:15:26,835 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:15:26,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 139 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:15:26,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-27 12:15:26,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-04-27 12:15:26,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:15:26,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:15:26,848 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:15:26,849 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:15:26,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:26,853 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-27 12:15:26,853 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-27 12:15:26,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:15:26,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:15:26,855 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-27 12:15:26,856 INFO L87 Difference]: Start difference. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-27 12:15:26,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:26,860 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-27 12:15:26,860 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-27 12:15:26,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:15:26,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:15:26,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:15:26,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:15:26,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 12:15:26,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-04-27 12:15:26,863 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 23 [2022-04-27 12:15:26,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:15:26,863 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-04-27 12:15:26,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:15:26,864 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-04-27 12:15:26,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 12:15:26,864 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:15:26,865 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:15:26,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 12:15:27,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:15:27,072 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:15:27,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:15:27,072 INFO L85 PathProgramCache]: Analyzing trace with hash 2019703110, now seen corresponding path program 1 times [2022-04-27 12:15:27,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:15:27,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42593458] [2022-04-27 12:15:27,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:15:27,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:15:27,087 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:15:27,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [150356360] [2022-04-27 12:15:27,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:15:27,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:15:27,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:15:27,089 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:15:27,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 12:15:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:15:27,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:15:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:15:27,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:15:27,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {1126#true} call ULTIMATE.init(); {1126#true} is VALID [2022-04-27 12:15:27,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {1126#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1134#(<= 0 ~counter~0)} is VALID [2022-04-27 12:15:27,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {1134#(<= 0 ~counter~0)} assume true; {1134#(<= 0 ~counter~0)} is VALID [2022-04-27 12:15:27,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1134#(<= 0 ~counter~0)} {1126#true} #93#return; {1134#(<= 0 ~counter~0)} is VALID [2022-04-27 12:15:27,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {1134#(<= 0 ~counter~0)} call #t~ret8 := main(); {1134#(<= 0 ~counter~0)} is VALID [2022-04-27 12:15:27,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {1134#(<= 0 ~counter~0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1134#(<= 0 ~counter~0)} is VALID [2022-04-27 12:15:27,290 INFO L272 TraceCheckUtils]: 6: Hoare triple {1134#(<= 0 ~counter~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1134#(<= 0 ~counter~0)} is VALID [2022-04-27 12:15:27,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {1134#(<= 0 ~counter~0)} ~cond := #in~cond; {1134#(<= 0 ~counter~0)} is VALID [2022-04-27 12:15:27,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {1134#(<= 0 ~counter~0)} assume !(0 == ~cond); {1134#(<= 0 ~counter~0)} is VALID [2022-04-27 12:15:27,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {1134#(<= 0 ~counter~0)} assume true; {1134#(<= 0 ~counter~0)} is VALID [2022-04-27 12:15:27,291 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1134#(<= 0 ~counter~0)} {1134#(<= 0 ~counter~0)} #77#return; {1134#(<= 0 ~counter~0)} is VALID [2022-04-27 12:15:27,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {1134#(<= 0 ~counter~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1134#(<= 0 ~counter~0)} is VALID [2022-04-27 12:15:27,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {1134#(<= 0 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1168#(<= 1 ~counter~0)} is VALID [2022-04-27 12:15:27,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {1168#(<= 1 ~counter~0)} assume !!(#t~post6 < 1);havoc #t~post6; {1168#(<= 1 ~counter~0)} is VALID [2022-04-27 12:15:27,293 INFO L272 TraceCheckUtils]: 14: Hoare triple {1168#(<= 1 ~counter~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1168#(<= 1 ~counter~0)} is VALID [2022-04-27 12:15:27,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {1168#(<= 1 ~counter~0)} ~cond := #in~cond; {1168#(<= 1 ~counter~0)} is VALID [2022-04-27 12:15:27,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {1168#(<= 1 ~counter~0)} assume !(0 == ~cond); {1168#(<= 1 ~counter~0)} is VALID [2022-04-27 12:15:27,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {1168#(<= 1 ~counter~0)} assume true; {1168#(<= 1 ~counter~0)} is VALID [2022-04-27 12:15:27,294 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1168#(<= 1 ~counter~0)} {1168#(<= 1 ~counter~0)} #79#return; {1168#(<= 1 ~counter~0)} is VALID [2022-04-27 12:15:27,295 INFO L272 TraceCheckUtils]: 19: Hoare triple {1168#(<= 1 ~counter~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1168#(<= 1 ~counter~0)} is VALID [2022-04-27 12:15:27,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {1168#(<= 1 ~counter~0)} ~cond := #in~cond; {1168#(<= 1 ~counter~0)} is VALID [2022-04-27 12:15:27,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {1168#(<= 1 ~counter~0)} assume !(0 == ~cond); {1168#(<= 1 ~counter~0)} is VALID [2022-04-27 12:15:27,298 INFO L290 TraceCheckUtils]: 22: Hoare triple {1168#(<= 1 ~counter~0)} assume true; {1168#(<= 1 ~counter~0)} is VALID [2022-04-27 12:15:27,298 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1168#(<= 1 ~counter~0)} {1168#(<= 1 ~counter~0)} #81#return; {1168#(<= 1 ~counter~0)} is VALID [2022-04-27 12:15:27,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {1168#(<= 1 ~counter~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1168#(<= 1 ~counter~0)} is VALID [2022-04-27 12:15:27,299 INFO L290 TraceCheckUtils]: 25: Hoare triple {1168#(<= 1 ~counter~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1208#(<= 1 |main_#t~post7|)} is VALID [2022-04-27 12:15:27,299 INFO L290 TraceCheckUtils]: 26: Hoare triple {1208#(<= 1 |main_#t~post7|)} assume !!(#t~post7 < 1);havoc #t~post7; {1127#false} is VALID [2022-04-27 12:15:27,299 INFO L272 TraceCheckUtils]: 27: Hoare triple {1127#false} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1127#false} is VALID [2022-04-27 12:15:27,299 INFO L290 TraceCheckUtils]: 28: Hoare triple {1127#false} ~cond := #in~cond; {1127#false} is VALID [2022-04-27 12:15:27,300 INFO L290 TraceCheckUtils]: 29: Hoare triple {1127#false} assume 0 == ~cond; {1127#false} is VALID [2022-04-27 12:15:27,300 INFO L290 TraceCheckUtils]: 30: Hoare triple {1127#false} assume !false; {1127#false} is VALID [2022-04-27 12:15:27,300 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:15:27,300 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:15:27,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:15:27,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42593458] [2022-04-27 12:15:27,300 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:15:27,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150356360] [2022-04-27 12:15:27,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150356360] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:15:27,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:15:27,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:15:27,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110923036] [2022-04-27 12:15:27,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:15:27,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2022-04-27 12:15:27,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:15:27,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:15:27,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:15:27,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:15:27,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:15:27,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:15:27,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:15:27,324 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:15:27,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:27,400 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2022-04-27 12:15:27,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:15:27,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2022-04-27 12:15:27,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:15:27,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:15:27,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-04-27 12:15:27,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:15:27,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-04-27 12:15:27,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 62 transitions. [2022-04-27 12:15:27,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:15:27,442 INFO L225 Difference]: With dead ends: 75 [2022-04-27 12:15:27,442 INFO L226 Difference]: Without dead ends: 42 [2022-04-27 12:15:27,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:15:27,443 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 16 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:15:27,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 61 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:15:27,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-27 12:15:27,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2022-04-27 12:15:27,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:15:27,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 40 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:15:27,457 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 40 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:15:27,457 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 40 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:15:27,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:27,458 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2022-04-27 12:15:27,458 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-04-27 12:15:27,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:15:27,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:15:27,459 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 42 states. [2022-04-27 12:15:27,459 INFO L87 Difference]: Start difference. First operand has 40 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 42 states. [2022-04-27 12:15:27,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:27,460 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2022-04-27 12:15:27,460 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-04-27 12:15:27,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:15:27,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:15:27,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:15:27,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:15:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:15:27,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-04-27 12:15:27,461 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 31 [2022-04-27 12:15:27,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:15:27,462 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-04-27 12:15:27,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:15:27,462 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-27 12:15:27,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 12:15:27,462 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:15:27,462 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:15:27,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 12:15:27,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:15:27,681 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:15:27,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:15:27,681 INFO L85 PathProgramCache]: Analyzing trace with hash 202176206, now seen corresponding path program 1 times [2022-04-27 12:15:27,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:15:27,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922864565] [2022-04-27 12:15:27,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:15:27,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:15:27,692 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:15:27,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1624736640] [2022-04-27 12:15:27,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:15:27,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:15:27,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:15:27,693 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:15:27,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 12:15:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:15:27,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 12:15:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:15:27,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:15:27,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {1475#true} call ULTIMATE.init(); {1475#true} is VALID [2022-04-27 12:15:27,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {1475#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1475#true} is VALID [2022-04-27 12:15:27,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {1475#true} assume true; {1475#true} is VALID [2022-04-27 12:15:27,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1475#true} {1475#true} #93#return; {1475#true} is VALID [2022-04-27 12:15:27,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {1475#true} call #t~ret8 := main(); {1475#true} is VALID [2022-04-27 12:15:27,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {1475#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1475#true} is VALID [2022-04-27 12:15:27,909 INFO L272 TraceCheckUtils]: 6: Hoare triple {1475#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1475#true} is VALID [2022-04-27 12:15:27,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {1475#true} ~cond := #in~cond; {1475#true} is VALID [2022-04-27 12:15:27,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {1475#true} assume !(0 == ~cond); {1475#true} is VALID [2022-04-27 12:15:27,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {1475#true} assume true; {1475#true} is VALID [2022-04-27 12:15:27,910 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1475#true} {1475#true} #77#return; {1475#true} is VALID [2022-04-27 12:15:27,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {1475#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1513#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:15:27,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {1513#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1513#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:15:27,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {1513#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 1);havoc #t~post6; {1513#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:15:27,912 INFO L272 TraceCheckUtils]: 14: Hoare triple {1513#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1475#true} is VALID [2022-04-27 12:15:27,912 INFO L290 TraceCheckUtils]: 15: Hoare triple {1475#true} ~cond := #in~cond; {1475#true} is VALID [2022-04-27 12:15:27,912 INFO L290 TraceCheckUtils]: 16: Hoare triple {1475#true} assume !(0 == ~cond); {1475#true} is VALID [2022-04-27 12:15:27,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {1475#true} assume true; {1475#true} is VALID [2022-04-27 12:15:27,922 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1475#true} {1513#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {1513#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:15:27,923 INFO L272 TraceCheckUtils]: 19: Hoare triple {1513#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1475#true} is VALID [2022-04-27 12:15:27,923 INFO L290 TraceCheckUtils]: 20: Hoare triple {1475#true} ~cond := #in~cond; {1475#true} is VALID [2022-04-27 12:15:27,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {1475#true} assume !(0 == ~cond); {1475#true} is VALID [2022-04-27 12:15:27,923 INFO L290 TraceCheckUtils]: 22: Hoare triple {1475#true} assume true; {1475#true} is VALID [2022-04-27 12:15:27,923 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1475#true} {1513#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #81#return; {1513#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:15:27,924 INFO L290 TraceCheckUtils]: 24: Hoare triple {1513#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1553#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:15:27,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {1553#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1553#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:15:27,925 INFO L290 TraceCheckUtils]: 26: Hoare triple {1553#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !(#t~post7 < 1);havoc #t~post7; {1553#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:15:27,925 INFO L290 TraceCheckUtils]: 27: Hoare triple {1553#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {1563#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} is VALID [2022-04-27 12:15:27,925 INFO L290 TraceCheckUtils]: 28: Hoare triple {1563#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1563#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} is VALID [2022-04-27 12:15:27,926 INFO L290 TraceCheckUtils]: 29: Hoare triple {1563#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} assume !(#t~post6 < 1);havoc #t~post6; {1563#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} is VALID [2022-04-27 12:15:27,926 INFO L272 TraceCheckUtils]: 30: Hoare triple {1563#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1573#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:15:27,927 INFO L290 TraceCheckUtils]: 31: Hoare triple {1573#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1577#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:15:27,927 INFO L290 TraceCheckUtils]: 32: Hoare triple {1577#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1476#false} is VALID [2022-04-27 12:15:27,927 INFO L290 TraceCheckUtils]: 33: Hoare triple {1476#false} assume !false; {1476#false} is VALID [2022-04-27 12:15:27,927 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:15:27,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:15:28,098 INFO L290 TraceCheckUtils]: 33: Hoare triple {1476#false} assume !false; {1476#false} is VALID [2022-04-27 12:15:28,098 INFO L290 TraceCheckUtils]: 32: Hoare triple {1577#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1476#false} is VALID [2022-04-27 12:15:28,099 INFO L290 TraceCheckUtils]: 31: Hoare triple {1573#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1577#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:15:28,099 INFO L272 TraceCheckUtils]: 30: Hoare triple {1593#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1573#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:15:28,100 INFO L290 TraceCheckUtils]: 29: Hoare triple {1593#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !(#t~post6 < 1);havoc #t~post6; {1593#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 12:15:28,100 INFO L290 TraceCheckUtils]: 28: Hoare triple {1593#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1593#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 12:15:28,107 INFO L290 TraceCheckUtils]: 27: Hoare triple {1603#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {1593#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 12:15:28,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {1603#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} assume !(#t~post7 < 1);havoc #t~post7; {1603#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-27 12:15:28,108 INFO L290 TraceCheckUtils]: 25: Hoare triple {1603#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1603#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-27 12:15:28,108 INFO L290 TraceCheckUtils]: 24: Hoare triple {1593#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1603#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-27 12:15:28,109 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1475#true} {1593#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #81#return; {1593#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 12:15:28,109 INFO L290 TraceCheckUtils]: 22: Hoare triple {1475#true} assume true; {1475#true} is VALID [2022-04-27 12:15:28,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {1475#true} assume !(0 == ~cond); {1475#true} is VALID [2022-04-27 12:15:28,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {1475#true} ~cond := #in~cond; {1475#true} is VALID [2022-04-27 12:15:28,109 INFO L272 TraceCheckUtils]: 19: Hoare triple {1593#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1475#true} is VALID [2022-04-27 12:15:28,111 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1475#true} {1593#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #79#return; {1593#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 12:15:28,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {1475#true} assume true; {1475#true} is VALID [2022-04-27 12:15:28,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {1475#true} assume !(0 == ~cond); {1475#true} is VALID [2022-04-27 12:15:28,112 INFO L290 TraceCheckUtils]: 15: Hoare triple {1475#true} ~cond := #in~cond; {1475#true} is VALID [2022-04-27 12:15:28,112 INFO L272 TraceCheckUtils]: 14: Hoare triple {1593#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1475#true} is VALID [2022-04-27 12:15:28,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {1593#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(#t~post6 < 1);havoc #t~post6; {1593#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 12:15:28,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {1593#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1593#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 12:15:28,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {1475#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1593#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-27 12:15:28,113 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1475#true} {1475#true} #77#return; {1475#true} is VALID [2022-04-27 12:15:28,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {1475#true} assume true; {1475#true} is VALID [2022-04-27 12:15:28,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {1475#true} assume !(0 == ~cond); {1475#true} is VALID [2022-04-27 12:15:28,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {1475#true} ~cond := #in~cond; {1475#true} is VALID [2022-04-27 12:15:28,113 INFO L272 TraceCheckUtils]: 6: Hoare triple {1475#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1475#true} is VALID [2022-04-27 12:15:28,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {1475#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1475#true} is VALID [2022-04-27 12:15:28,113 INFO L272 TraceCheckUtils]: 4: Hoare triple {1475#true} call #t~ret8 := main(); {1475#true} is VALID [2022-04-27 12:15:28,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1475#true} {1475#true} #93#return; {1475#true} is VALID [2022-04-27 12:15:28,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {1475#true} assume true; {1475#true} is VALID [2022-04-27 12:15:28,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {1475#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1475#true} is VALID [2022-04-27 12:15:28,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {1475#true} call ULTIMATE.init(); {1475#true} is VALID [2022-04-27 12:15:28,114 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-27 12:15:28,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:15:28,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922864565] [2022-04-27 12:15:28,114 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:15:28,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624736640] [2022-04-27 12:15:28,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624736640] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:15:28,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:15:28,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2022-04-27 12:15:28,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809380019] [2022-04-27 12:15:28,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:15:28,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 34 [2022-04-27 12:15:28,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:15:28,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:15:28,144 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-27 12:15:28,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:15:28,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:15:28,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:15:28,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:15:28,145 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:15:28,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:28,399 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-27 12:15:28,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:15:28,399 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 34 [2022-04-27 12:15:28,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:15:28,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:15:28,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-27 12:15:28,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:15:28,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-27 12:15:28,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-27 12:15:28,431 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-27 12:15:28,431 INFO L225 Difference]: With dead ends: 40 [2022-04-27 12:15:28,431 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 12:15:28,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:15:28,432 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:15:28,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 75 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:15:28,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 12:15:28,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 12:15:28,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:15:28,432 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 12:15:28,433 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 12:15:28,433 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 12:15:28,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:28,433 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 12:15:28,433 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 12:15:28,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:15:28,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:15:28,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 12:15:28,433 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 12:15:28,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:15:28,433 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 12:15:28,433 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 12:15:28,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:15:28,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:15:28,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:15:28,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:15:28,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 12:15:28,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 12:15:28,433 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2022-04-27 12:15:28,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:15:28,434 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 12:15:28,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:15:28,434 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 12:15:28,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:15:28,436 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 12:15:28,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-27 12:15:28,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:15:28,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 12:15:28,851 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-27 12:15:28,852 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-27 12:15:28,852 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-27 12:15:28,852 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-27 12:15:28,852 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-27 12:15:28,852 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-04-27 12:15:28,852 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-04-27 12:15:28,852 INFO L895 garLoopResultBuilder]: At program point L37-4(lines 37 61) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0)))) (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= 1 ~counter~0)) (and (= main_~x~0 main_~r~0) (= main_~q~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:15:28,852 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 23 65) no Hoare annotation was computed. [2022-04-27 12:15:28,852 INFO L895 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:15:28,852 INFO L899 garLoopResultBuilder]: For program point L54-1(line 54) no Hoare annotation was computed. [2022-04-27 12:15:28,852 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:15:28,852 INFO L899 garLoopResultBuilder]: For program point L46-1(lines 46 58) no Hoare annotation was computed. [2022-04-27 12:15:28,852 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 23 65) no Hoare annotation was computed. [2022-04-27 12:15:28,852 INFO L895 garLoopResultBuilder]: At program point L46-3(lines 46 58) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (let ((.cse0 (* main_~q~0 main_~y~0))) (and (= (+ .cse0 main_~r~0) main_~x~0) (<= 1 ~counter~0) (= (+ .cse0 main_~r~0 (* main_~a~0 main_~y~0)) (+ main_~b~0 main_~x~0)))) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:15:28,852 INFO L899 garLoopResultBuilder]: For program point L46-4(lines 46 58) no Hoare annotation was computed. [2022-04-27 12:15:28,852 INFO L895 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (let ((.cse0 (* main_~q~0 main_~y~0))) (and (= (+ .cse0 main_~r~0) main_~x~0) (<= 1 ~counter~0) (= (+ .cse0 main_~r~0 (* main_~a~0 main_~y~0)) (+ main_~b~0 main_~x~0)))) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:15:28,853 INFO L895 garLoopResultBuilder]: At program point L38-1(line 38) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (let ((.cse0 (* main_~q~0 main_~y~0))) (and (= (+ .cse0 main_~r~0) main_~x~0) (<= 1 ~counter~0) (= (+ .cse0 main_~r~0 (* main_~a~0 main_~y~0)) (+ main_~b~0 main_~x~0)))) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:15:28,853 INFO L899 garLoopResultBuilder]: For program point L63(line 63) no Hoare annotation was computed. [2022-04-27 12:15:28,853 INFO L895 garLoopResultBuilder]: At program point L30(line 30) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:15:28,853 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 23 65) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:15:28,853 INFO L899 garLoopResultBuilder]: For program point L30-1(line 30) no Hoare annotation was computed. [2022-04-27 12:15:28,853 INFO L899 garLoopResultBuilder]: For program point L49(lines 46 58) no Hoare annotation was computed. [2022-04-27 12:15:28,853 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:15:28,853 INFO L895 garLoopResultBuilder]: At program point L47-1(line 47) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:15:28,853 INFO L899 garLoopResultBuilder]: For program point L39(lines 37 61) no Hoare annotation was computed. [2022-04-27 12:15:28,853 INFO L899 garLoopResultBuilder]: For program point L37-1(lines 37 61) no Hoare annotation was computed. [2022-04-27 12:15:28,853 INFO L895 garLoopResultBuilder]: At program point L37-3(lines 37 61) the Hoare annotation is: (or (and (= main_~a~0 0) (= main_~x~0 main_~r~0) (= main_~b~0 0) (<= 0 ~counter~0) (= main_~q~0 0)) (not (<= |old(~counter~0)| 0)) (let ((.cse0 (* main_~q~0 main_~y~0))) (and (= (+ .cse0 main_~r~0) main_~x~0) (<= 1 ~counter~0) (= (+ .cse0 main_~r~0 (* main_~a~0 main_~y~0)) (+ main_~b~0 main_~x~0)))) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:15:28,853 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 12:15:28,853 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 12:15:28,853 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 12:15:28,853 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 12:15:28,853 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-27 12:15:28,853 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 12:15:28,854 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 12:15:28,854 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2022-04-27 12:15:28,854 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2022-04-27 12:15:28,854 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-27 12:15:28,854 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2022-04-27 12:15:28,854 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2022-04-27 12:15:28,854 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-04-27 12:15:28,856 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-04-27 12:15:28,857 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 12:15:28,859 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 12:15:28,859 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 12:15:28,863 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 12:15:28,865 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 12:15:28,865 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 12:15:28,865 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 12:15:28,865 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 12:15:28,865 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 12:15:28,865 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 12:15:28,865 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-27 12:15:28,865 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 12:15:28,865 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 12:15:28,865 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 12:15:28,865 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 12:15:28,865 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-27 12:15:28,865 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-04-27 12:15:28,865 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 12:15:28,865 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 12:15:28,865 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 12:15:28,865 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 12:15:28,867 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-27 12:15:28,867 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:15:28,867 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:15:28,867 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:15:28,867 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:15:28,867 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:15:28,867 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:15:28,867 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:15:28,867 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-04-27 12:15:28,867 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-27 12:15:28,867 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-27 12:15:28,867 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 12:15:28,867 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 12:15:28,867 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 12:15:28,867 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 12:15:28,867 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 12:15:28,867 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 12:15:28,867 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2022-04-27 12:15:28,867 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-04-27 12:15:28,867 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2022-04-27 12:15:28,867 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-27 12:15:28,867 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2022-04-27 12:15:28,867 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2022-04-27 12:15:28,867 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 12:15:28,867 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-27 12:15:28,867 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-27 12:15:28,868 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 12:15:28,868 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-27 12:15:28,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 12:15:28 BoogieIcfgContainer [2022-04-27 12:15:28,874 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 12:15:28,875 INFO L158 Benchmark]: Toolchain (without parser) took 9472.43ms. Allocated memory was 195.0MB in the beginning and 272.6MB in the end (delta: 77.6MB). Free memory was 145.0MB in the beginning and 219.7MB in the end (delta: -74.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-27 12:15:28,875 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 195.0MB. Free memory was 161.0MB in the beginning and 160.9MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 12:15:28,875 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.52ms. Allocated memory is still 195.0MB. Free memory was 144.7MB in the beginning and 170.4MB in the end (delta: -25.6MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2022-04-27 12:15:28,876 INFO L158 Benchmark]: Boogie Preprocessor took 17.96ms. Allocated memory is still 195.0MB. Free memory was 170.4MB in the beginning and 168.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 12:15:28,876 INFO L158 Benchmark]: RCFGBuilder took 299.59ms. Allocated memory is still 195.0MB. Free memory was 168.8MB in the beginning and 156.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 12:15:28,876 INFO L158 Benchmark]: TraceAbstraction took 8955.76ms. Allocated memory was 195.0MB in the beginning and 272.6MB in the end (delta: 77.6MB). Free memory was 155.7MB in the beginning and 219.7MB in the end (delta: -64.0MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. [2022-04-27 12:15:28,877 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.35ms. Allocated memory is still 195.0MB. Free memory was 161.0MB in the beginning and 160.9MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 195.52ms. Allocated memory is still 195.0MB. Free memory was 144.7MB in the beginning and 170.4MB in the end (delta: -25.6MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.96ms. Allocated memory is still 195.0MB. Free memory was 170.4MB in the beginning and 168.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 299.59ms. Allocated memory is still 195.0MB. Free memory was 168.8MB in the beginning and 156.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 8955.76ms. Allocated memory was 195.0MB in the beginning and 272.6MB in the end (delta: 77.6MB). Free memory was 155.7MB in the beginning and 219.7MB in the end (delta: -64.0MB). Peak memory consumption was 14.2MB. 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: 17]: 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, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 65 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 576 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 360 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 158 IncrementalHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 216 mSDtfsCounter, 158 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=4, InterpolantAutomatonStates: 27, 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, 7 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 40 PreInvPairs, 49 NumberOfFragments, 271 HoareAnnotationTreeSize, 40 FomulaSimplifications, 11 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 122 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 141 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 168 ConstructedInterpolants, 0 QuantifiedInterpolants, 486 SizeOfPredicates, 8 NumberOfNonLiveVariables, 504 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 28/30 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: 46]: Loop Invariant Derived loop invariant: (!(\old(counter) <= 0) || ((q * y + r == x && 1 <= counter) && q * y + r + a * y == b + x)) || !(0 <= \old(counter)) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((((((a == 0 && x == r) && b == 0) && 0 <= counter) && q == 0) || !(\old(counter) <= 0)) || ((q * y + r == x && 1 <= counter) && q * y + r + a * y == b + x)) || !(0 <= \old(counter)) RESULT: Ultimate proved your program to be correct! [2022-04-27 12:15:28,890 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...