/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/egcd-ll_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:48:49,522 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:48:49,523 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:48:49,551 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:48:49,551 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:48:49,552 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:48:49,553 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:48:49,555 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:48:49,556 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:48:49,557 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:48:49,558 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:48:49,558 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:48:49,559 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:48:49,559 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:48:49,560 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:48:49,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:48:49,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:48:49,562 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:48:49,564 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:48:49,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:48:49,566 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:48:49,567 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:48:49,568 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:48:49,569 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:48:49,570 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:48:49,572 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:48:49,573 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:48:49,573 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:48:49,573 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:48:49,574 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:48:49,574 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:48:49,575 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:48:49,575 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:48:49,576 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:48:49,576 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:48:49,577 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:48:49,577 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:48:49,578 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:48:49,578 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:48:49,578 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:48:49,579 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:48:49,581 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:48:49,581 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:48:49,609 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:48:49,610 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:48:49,610 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:48:49,610 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:48:49,611 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:48:49,611 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:48:49,612 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:48:49,612 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:48:49,612 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:48:49,613 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:48:49,613 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:48:49,613 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:48:49,613 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:48:49,613 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:48:49,613 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:48:49,613 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:48:49,613 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:48:49,614 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:48:49,615 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:48:49,615 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:48:49,615 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:48:49,615 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:48:49,615 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:48:49,615 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:48:49,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:48:49,616 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:48:49,616 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:48:49,616 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:48:49,616 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:48:49,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:48:49,616 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:48:49,616 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:48:49,617 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:48:49,617 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:48:49,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:48:49,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:48:49,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:48:49,841 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:48:49,842 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:48:49,843 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound2.c [2022-04-27 12:48:49,895 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98a796580/f95473b8fbda4b13ba822630af19db6c/FLAG32b927203 [2022-04-27 12:48:50,316 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:48:50,316 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound2.c [2022-04-27 12:48:50,322 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98a796580/f95473b8fbda4b13ba822630af19db6c/FLAG32b927203 [2022-04-27 12:48:50,336 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98a796580/f95473b8fbda4b13ba822630af19db6c [2022-04-27 12:48:50,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:48:50,340 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:48:50,341 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:48:50,341 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:48:50,345 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:48:50,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:48:50" (1/1) ... [2022-04-27 12:48:50,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aab6c6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:48:50, skipping insertion in model container [2022-04-27 12:48:50,350 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:48:50" (1/1) ... [2022-04-27 12:48:50,355 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:48:50,368 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:48:50,516 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/egcd-ll_unwindbound2.c[489,502] [2022-04-27 12:48:50,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:48:50,540 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:48:50,553 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/egcd-ll_unwindbound2.c[489,502] [2022-04-27 12:48:50,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:48:50,575 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:48:50,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:48:50 WrapperNode [2022-04-27 12:48:50,576 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:48:50,577 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:48:50,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:48:50,577 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:48:50,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:48:50" (1/1) ... [2022-04-27 12:48:50,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:48:50" (1/1) ... [2022-04-27 12:48:50,594 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:48:50" (1/1) ... [2022-04-27 12:48:50,594 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:48:50" (1/1) ... [2022-04-27 12:48:50,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:48:50" (1/1) ... [2022-04-27 12:48:50,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:48:50" (1/1) ... [2022-04-27 12:48:50,604 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:48:50" (1/1) ... [2022-04-27 12:48:50,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:48:50,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:48:50,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:48:50,606 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:48:50,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:48:50" (1/1) ... [2022-04-27 12:48:50,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:48:50,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:48:50,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:48:50,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 12:48:50,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:48:50,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:48:50,669 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:48:50,669 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:48:50,669 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:48:50,669 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:48:50,669 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:48:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:48:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:48:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:48:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 12:48:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:48:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:48:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:48:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:48:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:48:50,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:48:50,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:48:50,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:48:50,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:48:50,724 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:48:50,726 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:48:50,886 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:48:50,892 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:48:50,892 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 12:48:50,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:48:50 BoogieIcfgContainer [2022-04-27 12:48:50,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:48:50,895 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:48:50,895 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:48:50,898 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:48:50,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:48:50" (1/3) ... [2022-04-27 12:48:50,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@411085d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:48:50, skipping insertion in model container [2022-04-27 12:48:50,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:48:50" (2/3) ... [2022-04-27 12:48:50,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@411085d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:48:50, skipping insertion in model container [2022-04-27 12:48:50,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:48:50" (3/3) ... [2022-04-27 12:48:50,900 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound2.c [2022-04-27 12:48:50,912 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:48:50,912 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:48:50,949 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:48:50,954 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@1381b491, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@57f3957c [2022-04-27 12:48:50,955 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:48:50,961 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:48:50,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 12:48:50,968 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:48:50,968 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:48:50,969 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:48:50,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:48:50,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1226702723, now seen corresponding path program 1 times [2022-04-27 12:48:50,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:48:50,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704324884] [2022-04-27 12:48:50,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:48:50,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:48:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:48:51,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:48:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:48:51,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {38#true} is VALID [2022-04-27 12:48:51,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-27 12:48:51,196 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #82#return; {38#true} is VALID [2022-04-27 12:48:51,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:48:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:48:51,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-04-27 12:48:51,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-04-27 12:48:51,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2022-04-27 12:48:51,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {38#true} #64#return; {39#false} is VALID [2022-04-27 12:48:51,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 12:48:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:48:51,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-04-27 12:48:51,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-04-27 12:48:51,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2022-04-27 12:48:51,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {39#false} #66#return; {39#false} is VALID [2022-04-27 12:48:51,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:48:51,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {38#true} is VALID [2022-04-27 12:48:51,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-27 12:48:51,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #82#return; {38#true} is VALID [2022-04-27 12:48:51,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret7 := main(); {38#true} is VALID [2022-04-27 12:48:51,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {38#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~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; {38#true} is VALID [2022-04-27 12:48:51,219 INFO L272 TraceCheckUtils]: 6: Hoare triple {38#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {38#true} is VALID [2022-04-27 12:48:51,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-04-27 12:48:51,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-04-27 12:48:51,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#false} assume true; {39#false} is VALID [2022-04-27 12:48:51,221 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {39#false} {38#true} #64#return; {39#false} is VALID [2022-04-27 12:48:51,222 INFO L272 TraceCheckUtils]: 11: Hoare triple {39#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {38#true} is VALID [2022-04-27 12:48:51,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-04-27 12:48:51,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-04-27 12:48:51,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {39#false} assume true; {39#false} is VALID [2022-04-27 12:48:51,223 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {39#false} {39#false} #66#return; {39#false} is VALID [2022-04-27 12:48:51,224 INFO L290 TraceCheckUtils]: 16: Hoare triple {39#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {39#false} is VALID [2022-04-27 12:48:51,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {39#false} assume !true; {39#false} is VALID [2022-04-27 12:48:51,225 INFO L272 TraceCheckUtils]: 18: Hoare triple {39#false} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {39#false} is VALID [2022-04-27 12:48:51,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2022-04-27 12:48:51,225 INFO L290 TraceCheckUtils]: 20: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2022-04-27 12:48:51,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-04-27 12:48:51,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:48:51,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:48:51,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704324884] [2022-04-27 12:48:51,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704324884] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:48:51,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:48:51,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:48:51,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545733201] [2022-04-27 12:48:51,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:48:51,239 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 12:48:51,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:48:51,243 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:48:51,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:48:51,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:48:51,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:48:51,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:48:51,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:48:51,308 INFO L87 Difference]: Start difference. First operand has 35 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:48:51,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:48:51,512 INFO L93 Difference]: Finished difference Result 64 states and 97 transitions. [2022-04-27 12:48:51,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:48:51,513 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 12:48:51,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:48:51,514 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:48:51,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2022-04-27 12:48:51,527 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:48:51,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2022-04-27 12:48:51,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 97 transitions. [2022-04-27 12:48:51,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:48:51,682 INFO L225 Difference]: With dead ends: 64 [2022-04-27 12:48:51,682 INFO L226 Difference]: Without dead ends: 31 [2022-04-27 12:48:51,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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:48:51,703 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:48:51,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 45 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:48:51,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-27 12:48:51,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-04-27 12:48:51,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:48:51,730 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 30 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:48:51,730 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 30 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:48:51,731 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 30 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:48:51,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:48:51,736 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-04-27 12:48:51,736 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2022-04-27 12:48:51,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:48:51,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:48:51,737 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 31 states. [2022-04-27 12:48:51,738 INFO L87 Difference]: Start difference. First operand has 30 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 31 states. [2022-04-27 12:48:51,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:48:51,742 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-04-27 12:48:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2022-04-27 12:48:51,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:48:51,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:48:51,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:48:51,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:48:51,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:48:51,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-04-27 12:48:51,748 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 22 [2022-04-27 12:48:51,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:48:51,748 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-04-27 12:48:51,748 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:48:51,748 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-04-27 12:48:51,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 12:48:51,749 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:48:51,749 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:48:51,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:48:51,750 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:48:51,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:48:51,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1346542817, now seen corresponding path program 1 times [2022-04-27 12:48:51,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:48:51,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200076043] [2022-04-27 12:48:51,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:48:51,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:48:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:48:51,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:48:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:48:51,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#(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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:48:51,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {259#(= ~counter~0 0)} assume true; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:48:51,846 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {259#(= ~counter~0 0)} {254#true} #82#return; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:48:51,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:48:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:48:51,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {254#true} ~cond := #in~cond; {254#true} is VALID [2022-04-27 12:48:51,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {254#true} assume !(0 == ~cond); {254#true} is VALID [2022-04-27 12:48:51,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {254#true} assume true; {254#true} is VALID [2022-04-27 12:48:51,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {254#true} {259#(= ~counter~0 0)} #64#return; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:48:51,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 12:48:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:48:51,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {254#true} ~cond := #in~cond; {254#true} is VALID [2022-04-27 12:48:51,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {254#true} assume !(0 == ~cond); {254#true} is VALID [2022-04-27 12:48:51,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {254#true} assume true; {254#true} is VALID [2022-04-27 12:48:51,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {254#true} {259#(= ~counter~0 0)} #66#return; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:48:51,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {254#true} call ULTIMATE.init(); {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:48:51,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#(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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:48:51,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {259#(= ~counter~0 0)} assume true; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:48:51,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {259#(= ~counter~0 0)} {254#true} #82#return; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:48:51,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {259#(= ~counter~0 0)} call #t~ret7 := main(); {259#(= ~counter~0 0)} is VALID [2022-04-27 12:48:51,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {259#(= ~counter~0 0)} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~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; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:48:51,873 INFO L272 TraceCheckUtils]: 6: Hoare triple {259#(= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {254#true} is VALID [2022-04-27 12:48:51,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {254#true} ~cond := #in~cond; {254#true} is VALID [2022-04-27 12:48:51,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {254#true} assume !(0 == ~cond); {254#true} is VALID [2022-04-27 12:48:51,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {254#true} assume true; {254#true} is VALID [2022-04-27 12:48:51,875 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {254#true} {259#(= ~counter~0 0)} #64#return; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:48:51,875 INFO L272 TraceCheckUtils]: 11: Hoare triple {259#(= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {254#true} is VALID [2022-04-27 12:48:51,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {254#true} ~cond := #in~cond; {254#true} is VALID [2022-04-27 12:48:51,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {254#true} assume !(0 == ~cond); {254#true} is VALID [2022-04-27 12:48:51,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {254#true} assume true; {254#true} is VALID [2022-04-27 12:48:51,876 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {254#true} {259#(= ~counter~0 0)} #66#return; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:48:51,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {259#(= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {259#(= ~counter~0 0)} is VALID [2022-04-27 12:48:51,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {259#(= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {268#(= |main_#t~post6| 0)} is VALID [2022-04-27 12:48:51,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {268#(= |main_#t~post6| 0)} assume !(#t~post6 < 2);havoc #t~post6; {255#false} is VALID [2022-04-27 12:48:51,878 INFO L272 TraceCheckUtils]: 19: Hoare triple {255#false} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {255#false} is VALID [2022-04-27 12:48:51,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {255#false} ~cond := #in~cond; {255#false} is VALID [2022-04-27 12:48:51,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {255#false} assume 0 == ~cond; {255#false} is VALID [2022-04-27 12:48:51,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {255#false} assume !false; {255#false} is VALID [2022-04-27 12:48:51,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:48:51,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:48:51,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200076043] [2022-04-27 12:48:51,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200076043] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:48:51,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:48:51,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:48:51,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114895278] [2022-04-27 12:48:51,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:48:51,881 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), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 12:48:51,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:48:51,882 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), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:48:51,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:48:51,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:48:51,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:48:51,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:48:51,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:48:51,900 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:48:52,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:48:52,105 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2022-04-27 12:48:52,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:48:52,105 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), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 12:48:52,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:48:52,106 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), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:48:52,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2022-04-27 12:48:52,109 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), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:48:52,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2022-04-27 12:48:52,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 54 transitions. [2022-04-27 12:48:52,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:48:52,171 INFO L225 Difference]: With dead ends: 42 [2022-04-27 12:48:52,171 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 12:48:52,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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:48:52,178 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 13 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:48:52,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 65 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:48:52,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 12:48:52,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 12:48:52,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:48:52,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:48:52,190 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:48:52,191 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:48:52,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:48:52,196 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-27 12:48:52,196 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 12:48:52,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:48:52,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:48:52,203 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 32 states. [2022-04-27 12:48:52,204 INFO L87 Difference]: Start difference. First operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 32 states. [2022-04-27 12:48:52,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:48:52,208 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-27 12:48:52,208 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 12:48:52,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:48:52,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:48:52,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:48:52,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:48:52,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 12:48:52,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-27 12:48:52,211 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 23 [2022-04-27 12:48:52,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:48:52,212 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-27 12:48:52,212 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), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:48:52,212 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-27 12:48:52,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 12:48:52,213 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:48:52,213 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:48:52,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 12:48:52,213 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:48:52,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:48:52,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1348211113, now seen corresponding path program 1 times [2022-04-27 12:48:52,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:48:52,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838390159] [2022-04-27 12:48:52,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:48:52,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:48:52,246 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:48:52,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [109389951] [2022-04-27 12:48:52,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:48:52,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:48:52,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:48:52,256 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:48:52,267 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:48:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:48:52,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:48:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:48:52,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:48:55,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {452#true} call ULTIMATE.init(); {452#true} is VALID [2022-04-27 12:48:55,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {452#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {452#true} is VALID [2022-04-27 12:48:55,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {452#true} assume true; {452#true} is VALID [2022-04-27 12:48:55,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {452#true} {452#true} #82#return; {452#true} is VALID [2022-04-27 12:48:55,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {452#true} call #t~ret7 := main(); {452#true} is VALID [2022-04-27 12:48:55,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {452#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~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; {452#true} is VALID [2022-04-27 12:48:55,775 INFO L272 TraceCheckUtils]: 6: Hoare triple {452#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {452#true} is VALID [2022-04-27 12:48:55,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {452#true} ~cond := #in~cond; {452#true} is VALID [2022-04-27 12:48:55,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {452#true} assume !(0 == ~cond); {452#true} is VALID [2022-04-27 12:48:55,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {452#true} assume true; {452#true} is VALID [2022-04-27 12:48:55,776 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {452#true} {452#true} #64#return; {452#true} is VALID [2022-04-27 12:48:55,776 INFO L272 TraceCheckUtils]: 11: Hoare triple {452#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {452#true} is VALID [2022-04-27 12:48:55,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {452#true} ~cond := #in~cond; {452#true} is VALID [2022-04-27 12:48:55,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {452#true} assume !(0 == ~cond); {452#true} is VALID [2022-04-27 12:48:55,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {452#true} assume true; {452#true} is VALID [2022-04-27 12:48:55,777 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {452#true} {452#true} #66#return; {452#true} is VALID [2022-04-27 12:48:55,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {452#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {505#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-27 12:48:55,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {505#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {505#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-27 12:48:55,778 INFO L290 TraceCheckUtils]: 18: Hoare triple {505#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} assume !!(#t~post6 < 2);havoc #t~post6; {505#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-27 12:48:55,779 INFO L272 TraceCheckUtils]: 19: Hoare triple {505#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {515#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:48:55,780 INFO L290 TraceCheckUtils]: 20: Hoare triple {515#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {519#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:48:55,780 INFO L290 TraceCheckUtils]: 21: Hoare triple {519#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {453#false} is VALID [2022-04-27 12:48:55,780 INFO L290 TraceCheckUtils]: 22: Hoare triple {453#false} assume !false; {453#false} is VALID [2022-04-27 12:48:55,781 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:48:55,781 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:48:55,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:48:55,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838390159] [2022-04-27 12:48:55,781 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:48:55,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109389951] [2022-04-27 12:48:55,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109389951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:48:55,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:48:55,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:48:55,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438157565] [2022-04-27 12:48:55,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:48:55,783 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-27 12:48:55,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:48:55,783 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:48:55,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:48:55,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:48:55,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:48:55,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:48:55,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:48:55,800 INFO L87 Difference]: Start difference. First operand 32 states and 41 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:48:56,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:48:56,021 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2022-04-27 12:48:56,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:48:56,022 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-27 12:48:56,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:48:56,023 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:48:56,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 12:48:56,029 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:48:56,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 12:48:56,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-27 12:48:56,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:48:56,104 INFO L225 Difference]: With dead ends: 49 [2022-04-27 12:48:56,104 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 12:48:56,104 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:48:56,107 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:48:56,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 134 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:48:56,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 12:48:56,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-04-27 12:48:56,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:48:56,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 46 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 12:48:56,117 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 46 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 12:48:56,117 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 46 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 12:48:56,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:48:56,121 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-27 12:48:56,121 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-27 12:48:56,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:48:56,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:48:56,122 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 47 states. [2022-04-27 12:48:56,122 INFO L87 Difference]: Start difference. First operand has 46 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 47 states. [2022-04-27 12:48:56,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:48:56,125 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-27 12:48:56,125 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-27 12:48:56,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:48:56,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:48:56,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:48:56,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:48:56,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 12:48:56,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2022-04-27 12:48:56,129 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 23 [2022-04-27 12:48:56,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:48:56,129 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2022-04-27 12:48:56,129 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:48:56,129 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-04-27 12:48:56,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 12:48:56,130 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:48:56,130 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:48:56,159 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:48:56,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:48:56,353 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:48:56,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:48:56,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1060153012, now seen corresponding path program 1 times [2022-04-27 12:48:56,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:48:56,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719960143] [2022-04-27 12:48:56,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:48:56,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:48:56,371 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:48:56,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [982157295] [2022-04-27 12:48:56,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:48:56,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:48:56,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:48:56,375 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:48:56,404 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:48:56,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:48:56,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 12:48:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:48:56,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:49:00,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {767#true} call ULTIMATE.init(); {767#true} is VALID [2022-04-27 12:49:00,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {767#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {767#true} is VALID [2022-04-27 12:49:00,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {767#true} assume true; {767#true} is VALID [2022-04-27 12:49:00,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {767#true} {767#true} #82#return; {767#true} is VALID [2022-04-27 12:49:00,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {767#true} call #t~ret7 := main(); {767#true} is VALID [2022-04-27 12:49:00,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {767#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~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; {767#true} is VALID [2022-04-27 12:49:00,667 INFO L272 TraceCheckUtils]: 6: Hoare triple {767#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {767#true} is VALID [2022-04-27 12:49:00,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {767#true} ~cond := #in~cond; {793#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:49:00,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {793#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {797#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:49:00,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {797#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {797#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:49:00,676 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {797#(not (= |assume_abort_if_not_#in~cond| 0))} {767#true} #64#return; {804#(<= 1 main_~x~0)} is VALID [2022-04-27 12:49:00,676 INFO L272 TraceCheckUtils]: 11: Hoare triple {804#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {767#true} is VALID [2022-04-27 12:49:00,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {767#true} ~cond := #in~cond; {767#true} is VALID [2022-04-27 12:49:00,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {767#true} assume !(0 == ~cond); {767#true} is VALID [2022-04-27 12:49:00,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {767#true} assume true; {767#true} is VALID [2022-04-27 12:49:00,677 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {767#true} {804#(<= 1 main_~x~0)} #66#return; {804#(<= 1 main_~x~0)} is VALID [2022-04-27 12:49:00,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {804#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:49:00,679 INFO L290 TraceCheckUtils]: 17: Hoare triple {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:49:00,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 2);havoc #t~post6; {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:49:00,680 INFO L272 TraceCheckUtils]: 19: Hoare triple {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {767#true} is VALID [2022-04-27 12:49:00,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {767#true} ~cond := #in~cond; {767#true} is VALID [2022-04-27 12:49:00,680 INFO L290 TraceCheckUtils]: 21: Hoare triple {767#true} assume !(0 == ~cond); {767#true} is VALID [2022-04-27 12:49:00,680 INFO L290 TraceCheckUtils]: 22: Hoare triple {767#true} assume true; {767#true} is VALID [2022-04-27 12:49:00,681 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {767#true} {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #68#return; {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:49:00,682 INFO L272 TraceCheckUtils]: 24: Hoare triple {823#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {848#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:49:00,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {848#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {852#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:49:00,683 INFO L290 TraceCheckUtils]: 26: Hoare triple {852#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {768#false} is VALID [2022-04-27 12:49:00,683 INFO L290 TraceCheckUtils]: 27: Hoare triple {768#false} assume !false; {768#false} is VALID [2022-04-27 12:49:00,683 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 12:49:00,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:49:30,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:49:30,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719960143] [2022-04-27 12:49:30,600 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:49:30,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982157295] [2022-04-27 12:49:30,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982157295] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:49:30,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:49:30,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-27 12:49:30,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241857105] [2022-04-27 12:49:30,601 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-27 12:49:30,602 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-04-27 12:49:30,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:49:30,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:49:30,626 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:49:30,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:49:30,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:49:30,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:49:30,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:49:30,628 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:49:31,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:49:31,099 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2022-04-27 12:49:31,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 12:49:31,099 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-04-27 12:49:31,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:49:31,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:49:31,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2022-04-27 12:49:31,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:49:31,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2022-04-27 12:49:31,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 64 transitions. [2022-04-27 12:49:31,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:49:31,172 INFO L225 Difference]: With dead ends: 53 [2022-04-27 12:49:31,173 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 12:49:31,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:49:31,174 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 21 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:49:31,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 185 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:49:31,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 12:49:31,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-27 12:49:31,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:49:31,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 12:49:31,191 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 12:49:31,192 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 12:49:31,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:49:31,195 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2022-04-27 12:49:31,195 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2022-04-27 12:49:31,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:49:31,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:49:31,196 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 51 states. [2022-04-27 12:49:31,196 INFO L87 Difference]: Start difference. First operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 51 states. [2022-04-27 12:49:31,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:49:31,199 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2022-04-27 12:49:31,199 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2022-04-27 12:49:31,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:49:31,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:49:31,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:49:31,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:49:31,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-27 12:49:31,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2022-04-27 12:49:31,202 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 28 [2022-04-27 12:49:31,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:49:31,202 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2022-04-27 12:49:31,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:49:31,203 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-27 12:49:31,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 12:49:31,203 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:49:31,203 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:49:31,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 12:49:31,419 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,SelfDestructingSolverStorable3 [2022-04-27 12:49:31,420 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:49:31,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:49:31,420 INFO L85 PathProgramCache]: Analyzing trace with hash -560761015, now seen corresponding path program 1 times [2022-04-27 12:49:31,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:49:31,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098798450] [2022-04-27 12:49:31,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:49:31,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:49:31,434 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:49:31,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [413243636] [2022-04-27 12:49:31,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:49:31,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:49:31,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:49:31,436 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:49:31,443 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:49:31,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:49:31,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 12:49:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:49:31,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:49:31,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {1136#true} call ULTIMATE.init(); {1136#true} is VALID [2022-04-27 12:49:31,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {1136#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1136#true} is VALID [2022-04-27 12:49:31,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {1136#true} assume true; {1136#true} is VALID [2022-04-27 12:49:31,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1136#true} {1136#true} #82#return; {1136#true} is VALID [2022-04-27 12:49:31,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {1136#true} call #t~ret7 := main(); {1136#true} is VALID [2022-04-27 12:49:31,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {1136#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~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; {1136#true} is VALID [2022-04-27 12:49:31,722 INFO L272 TraceCheckUtils]: 6: Hoare triple {1136#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1136#true} is VALID [2022-04-27 12:49:31,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {1136#true} ~cond := #in~cond; {1162#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:49:31,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {1162#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1166#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:49:31,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {1166#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1166#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:49:31,724 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1166#(not (= |assume_abort_if_not_#in~cond| 0))} {1136#true} #64#return; {1173#(<= 1 main_~x~0)} is VALID [2022-04-27 12:49:31,724 INFO L272 TraceCheckUtils]: 11: Hoare triple {1173#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1136#true} is VALID [2022-04-27 12:49:31,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {1136#true} ~cond := #in~cond; {1136#true} is VALID [2022-04-27 12:49:31,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {1136#true} assume !(0 == ~cond); {1136#true} is VALID [2022-04-27 12:49:31,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {1136#true} assume true; {1136#true} is VALID [2022-04-27 12:49:31,725 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1136#true} {1173#(<= 1 main_~x~0)} #66#return; {1173#(<= 1 main_~x~0)} is VALID [2022-04-27 12:49:31,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {1173#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:49:31,727 INFO L290 TraceCheckUtils]: 17: Hoare triple {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:49:31,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post6 < 2);havoc #t~post6; {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:49:31,727 INFO L272 TraceCheckUtils]: 19: Hoare triple {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {1136#true} is VALID [2022-04-27 12:49:31,727 INFO L290 TraceCheckUtils]: 20: Hoare triple {1136#true} ~cond := #in~cond; {1136#true} is VALID [2022-04-27 12:49:31,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {1136#true} assume !(0 == ~cond); {1136#true} is VALID [2022-04-27 12:49:31,728 INFO L290 TraceCheckUtils]: 22: Hoare triple {1136#true} assume true; {1136#true} is VALID [2022-04-27 12:49:31,729 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1136#true} {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #68#return; {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:49:31,729 INFO L272 TraceCheckUtils]: 24: Hoare triple {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1136#true} is VALID [2022-04-27 12:49:31,729 INFO L290 TraceCheckUtils]: 25: Hoare triple {1136#true} ~cond := #in~cond; {1136#true} is VALID [2022-04-27 12:49:31,729 INFO L290 TraceCheckUtils]: 26: Hoare triple {1136#true} assume !(0 == ~cond); {1136#true} is VALID [2022-04-27 12:49:31,729 INFO L290 TraceCheckUtils]: 27: Hoare triple {1136#true} assume true; {1136#true} is VALID [2022-04-27 12:49:31,730 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1136#true} {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #70#return; {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-27 12:49:31,731 INFO L272 TraceCheckUtils]: 29: Hoare triple {1192#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {1232#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:49:31,731 INFO L290 TraceCheckUtils]: 30: Hoare triple {1232#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1236#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:49:31,731 INFO L290 TraceCheckUtils]: 31: Hoare triple {1236#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1137#false} is VALID [2022-04-27 12:49:31,731 INFO L290 TraceCheckUtils]: 32: Hoare triple {1137#false} assume !false; {1137#false} is VALID [2022-04-27 12:49:31,732 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 12:49:31,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:49:31,912 INFO L290 TraceCheckUtils]: 32: Hoare triple {1137#false} assume !false; {1137#false} is VALID [2022-04-27 12:49:31,912 INFO L290 TraceCheckUtils]: 31: Hoare triple {1236#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1137#false} is VALID [2022-04-27 12:49:31,913 INFO L290 TraceCheckUtils]: 30: Hoare triple {1232#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1236#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:49:31,914 INFO L272 TraceCheckUtils]: 29: Hoare triple {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {1232#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:49:31,915 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1136#true} {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #70#return; {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:49:31,915 INFO L290 TraceCheckUtils]: 27: Hoare triple {1136#true} assume true; {1136#true} is VALID [2022-04-27 12:49:31,915 INFO L290 TraceCheckUtils]: 26: Hoare triple {1136#true} assume !(0 == ~cond); {1136#true} is VALID [2022-04-27 12:49:31,915 INFO L290 TraceCheckUtils]: 25: Hoare triple {1136#true} ~cond := #in~cond; {1136#true} is VALID [2022-04-27 12:49:31,915 INFO L272 TraceCheckUtils]: 24: Hoare triple {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1136#true} is VALID [2022-04-27 12:49:31,916 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1136#true} {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #68#return; {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:49:31,916 INFO L290 TraceCheckUtils]: 22: Hoare triple {1136#true} assume true; {1136#true} is VALID [2022-04-27 12:49:31,916 INFO L290 TraceCheckUtils]: 21: Hoare triple {1136#true} assume !(0 == ~cond); {1136#true} is VALID [2022-04-27 12:49:31,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {1136#true} ~cond := #in~cond; {1136#true} is VALID [2022-04-27 12:49:31,916 INFO L272 TraceCheckUtils]: 19: Hoare triple {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {1136#true} is VALID [2022-04-27 12:49:31,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 2);havoc #t~post6; {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:49:31,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:49:31,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {1136#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1252#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-27 12:49:31,918 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1136#true} {1136#true} #66#return; {1136#true} is VALID [2022-04-27 12:49:31,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {1136#true} assume true; {1136#true} is VALID [2022-04-27 12:49:31,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {1136#true} assume !(0 == ~cond); {1136#true} is VALID [2022-04-27 12:49:31,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {1136#true} ~cond := #in~cond; {1136#true} is VALID [2022-04-27 12:49:31,919 INFO L272 TraceCheckUtils]: 11: Hoare triple {1136#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1136#true} is VALID [2022-04-27 12:49:31,919 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1136#true} {1136#true} #64#return; {1136#true} is VALID [2022-04-27 12:49:31,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {1136#true} assume true; {1136#true} is VALID [2022-04-27 12:49:31,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {1136#true} assume !(0 == ~cond); {1136#true} is VALID [2022-04-27 12:49:31,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {1136#true} ~cond := #in~cond; {1136#true} is VALID [2022-04-27 12:49:31,919 INFO L272 TraceCheckUtils]: 6: Hoare triple {1136#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1136#true} is VALID [2022-04-27 12:49:31,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {1136#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~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; {1136#true} is VALID [2022-04-27 12:49:31,920 INFO L272 TraceCheckUtils]: 4: Hoare triple {1136#true} call #t~ret7 := main(); {1136#true} is VALID [2022-04-27 12:49:31,920 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1136#true} {1136#true} #82#return; {1136#true} is VALID [2022-04-27 12:49:31,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {1136#true} assume true; {1136#true} is VALID [2022-04-27 12:49:31,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {1136#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1136#true} is VALID [2022-04-27 12:49:31,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {1136#true} call ULTIMATE.init(); {1136#true} is VALID [2022-04-27 12:49:31,920 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 12:49:31,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:49:31,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098798450] [2022-04-27 12:49:31,921 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:49:31,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413243636] [2022-04-27 12:49:31,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413243636] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:49:31,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:49:31,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-27 12:49:31,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371557894] [2022-04-27 12:49:31,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:49:31,922 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 12:49:31,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:49:31,922 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:49:31,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:49:31,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:49:31,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:49:31,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:49:31,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:49:31,947 INFO L87 Difference]: Start difference. First operand 50 states and 66 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:49:32,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:49:32,213 INFO L93 Difference]: Finished difference Result 75 states and 107 transitions. [2022-04-27 12:49:32,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:49:32,213 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-27 12:49:32,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:49:32,213 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:49:32,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 12:49:32,215 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:49:32,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 12:49:32,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-27 12:49:32,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:49:32,277 INFO L225 Difference]: With dead ends: 75 [2022-04-27 12:49:32,277 INFO L226 Difference]: Without dead ends: 71 [2022-04-27 12:49:32,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:49:32,278 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 9 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:49:32,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 128 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:49:32,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-27 12:49:32,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-27 12:49:32,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:49:32,308 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:49:32,308 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:49:32,309 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:49:32,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:49:32,313 INFO L93 Difference]: Finished difference Result 71 states and 100 transitions. [2022-04-27 12:49:32,313 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2022-04-27 12:49:32,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:49:32,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:49:32,314 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 71 states. [2022-04-27 12:49:32,314 INFO L87 Difference]: Start difference. First operand has 71 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 71 states. [2022-04-27 12:49:32,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:49:32,318 INFO L93 Difference]: Finished difference Result 71 states and 100 transitions. [2022-04-27 12:49:32,318 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2022-04-27 12:49:32,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:49:32,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:49:32,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:49:32,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:49:32,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 40 states have internal predecessors, (48), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:49:32,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2022-04-27 12:49:32,322 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 100 transitions. Word has length 33 [2022-04-27 12:49:32,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:49:32,322 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 100 transitions. [2022-04-27 12:49:32,322 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:49:32,323 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2022-04-27 12:49:32,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 12:49:32,323 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:49:32,323 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:49:32,350 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:49:32,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:49:32,540 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:49:32,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:49:32,540 INFO L85 PathProgramCache]: Analyzing trace with hash 201438379, now seen corresponding path program 1 times [2022-04-27 12:49:32,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:49:32,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754038485] [2022-04-27 12:49:32,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:49:32,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:49:32,556 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:49:32,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [270586305] [2022-04-27 12:49:32,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:49:32,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:49:32,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:49:32,558 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:49:32,559 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:49:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:49:32,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 12:49:32,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:49:32,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:49:32,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {1712#true} call ULTIMATE.init(); {1712#true} is VALID [2022-04-27 12:49:32,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {1712#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1712#true} is VALID [2022-04-27 12:49:32,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {1712#true} assume true; {1712#true} is VALID [2022-04-27 12:49:32,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1712#true} {1712#true} #82#return; {1712#true} is VALID [2022-04-27 12:49:32,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {1712#true} call #t~ret7 := main(); {1712#true} is VALID [2022-04-27 12:49:32,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {1712#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~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; {1712#true} is VALID [2022-04-27 12:49:32,707 INFO L272 TraceCheckUtils]: 6: Hoare triple {1712#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1712#true} is VALID [2022-04-27 12:49:32,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {1712#true} ~cond := #in~cond; {1712#true} is VALID [2022-04-27 12:49:32,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {1712#true} assume !(0 == ~cond); {1712#true} is VALID [2022-04-27 12:49:32,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {1712#true} assume true; {1712#true} is VALID [2022-04-27 12:49:32,707 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1712#true} {1712#true} #64#return; {1712#true} is VALID [2022-04-27 12:49:32,707 INFO L272 TraceCheckUtils]: 11: Hoare triple {1712#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1712#true} is VALID [2022-04-27 12:49:32,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {1712#true} ~cond := #in~cond; {1712#true} is VALID [2022-04-27 12:49:32,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {1712#true} assume !(0 == ~cond); {1712#true} is VALID [2022-04-27 12:49:32,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {1712#true} assume true; {1712#true} is VALID [2022-04-27 12:49:32,708 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1712#true} {1712#true} #66#return; {1712#true} is VALID [2022-04-27 12:49:32,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {1712#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1712#true} is VALID [2022-04-27 12:49:32,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {1712#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1712#true} is VALID [2022-04-27 12:49:32,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {1712#true} assume !!(#t~post6 < 2);havoc #t~post6; {1712#true} is VALID [2022-04-27 12:49:32,708 INFO L272 TraceCheckUtils]: 19: Hoare triple {1712#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {1712#true} is VALID [2022-04-27 12:49:32,708 INFO L290 TraceCheckUtils]: 20: Hoare triple {1712#true} ~cond := #in~cond; {1712#true} is VALID [2022-04-27 12:49:32,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {1712#true} assume !(0 == ~cond); {1712#true} is VALID [2022-04-27 12:49:32,709 INFO L290 TraceCheckUtils]: 22: Hoare triple {1712#true} assume true; {1712#true} is VALID [2022-04-27 12:49:32,709 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1712#true} {1712#true} #68#return; {1712#true} is VALID [2022-04-27 12:49:32,709 INFO L272 TraceCheckUtils]: 24: Hoare triple {1712#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1712#true} is VALID [2022-04-27 12:49:32,709 INFO L290 TraceCheckUtils]: 25: Hoare triple {1712#true} ~cond := #in~cond; {1712#true} is VALID [2022-04-27 12:49:32,709 INFO L290 TraceCheckUtils]: 26: Hoare triple {1712#true} assume !(0 == ~cond); {1712#true} is VALID [2022-04-27 12:49:32,709 INFO L290 TraceCheckUtils]: 27: Hoare triple {1712#true} assume true; {1712#true} is VALID [2022-04-27 12:49:32,709 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1712#true} {1712#true} #70#return; {1712#true} is VALID [2022-04-27 12:49:32,709 INFO L272 TraceCheckUtils]: 29: Hoare triple {1712#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {1712#true} is VALID [2022-04-27 12:49:32,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {1712#true} ~cond := #in~cond; {1712#true} is VALID [2022-04-27 12:49:32,710 INFO L290 TraceCheckUtils]: 31: Hoare triple {1712#true} assume !(0 == ~cond); {1712#true} is VALID [2022-04-27 12:49:32,710 INFO L290 TraceCheckUtils]: 32: Hoare triple {1712#true} assume true; {1712#true} is VALID [2022-04-27 12:49:32,710 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1712#true} {1712#true} #72#return; {1712#true} is VALID [2022-04-27 12:49:32,712 INFO L290 TraceCheckUtils]: 34: Hoare triple {1712#true} assume !(~a~0 != ~b~0); {1819#(= main_~b~0 main_~a~0)} is VALID [2022-04-27 12:49:32,712 INFO L272 TraceCheckUtils]: 35: Hoare triple {1819#(= main_~b~0 main_~a~0)} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {1823#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:49:32,713 INFO L290 TraceCheckUtils]: 36: Hoare triple {1823#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1827#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:49:32,713 INFO L290 TraceCheckUtils]: 37: Hoare triple {1827#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1713#false} is VALID [2022-04-27 12:49:32,713 INFO L290 TraceCheckUtils]: 38: Hoare triple {1713#false} assume !false; {1713#false} is VALID [2022-04-27 12:49:32,713 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 12:49:32,714 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:49:32,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:49:32,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754038485] [2022-04-27 12:49:32,714 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:49:32,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270586305] [2022-04-27 12:49:32,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270586305] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:49:32,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:49:32,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:49:32,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912801797] [2022-04-27 12:49:32,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:49:32,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 39 [2022-04-27 12:49:32,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:49:32,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 12:49:32,739 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:49:32,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:49:32,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:49:32,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:49:32,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:49:32,740 INFO L87 Difference]: Start difference. First operand 71 states and 100 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 12:49:32,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:49:32,946 INFO L93 Difference]: Finished difference Result 87 states and 123 transitions. [2022-04-27 12:49:32,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:49:32,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 39 [2022-04-27 12:49:32,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:49:32,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 12:49:32,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-27 12:49:32,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 12:49:32,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-27 12:49:32,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-04-27 12:49:32,999 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:49:33,001 INFO L225 Difference]: With dead ends: 87 [2022-04-27 12:49:33,001 INFO L226 Difference]: Without dead ends: 85 [2022-04-27 12:49:33,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 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:49:33,003 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 5 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:49:33,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 144 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:49:33,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-27 12:49:33,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2022-04-27 12:49:33,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:49:33,034 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 78 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:49:33,034 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 78 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:49:33,035 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 78 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:49:33,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:49:33,039 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2022-04-27 12:49:33,039 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2022-04-27 12:49:33,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:49:33,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:49:33,040 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) Second operand 85 states. [2022-04-27 12:49:33,040 INFO L87 Difference]: Start difference. First operand has 78 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) Second operand 85 states. [2022-04-27 12:49:33,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:49:33,044 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2022-04-27 12:49:33,044 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2022-04-27 12:49:33,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:49:33,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:49:33,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:49:33,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:49:33,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:49:33,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2022-04-27 12:49:33,048 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 109 transitions. Word has length 39 [2022-04-27 12:49:33,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:49:33,049 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 109 transitions. [2022-04-27 12:49:33,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 12:49:33,049 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 109 transitions. [2022-04-27 12:49:33,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 12:49:33,050 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:49:33,050 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 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] [2022-04-27 12:49:33,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-27 12:49:33,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:49:33,263 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:49:33,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:49:33,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1085077998, now seen corresponding path program 1 times [2022-04-27 12:49:33,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:49:33,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354258166] [2022-04-27 12:49:33,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:49:33,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:49:33,283 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:49:33,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2112360393] [2022-04-27 12:49:33,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:49:33,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:49:33,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:49:33,289 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:49:33,290 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:49:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:49:33,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:49:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:49:33,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:49:33,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {2263#true} call ULTIMATE.init(); {2263#true} is VALID [2022-04-27 12:49:33,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {2263#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:49:33,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {2271#(<= ~counter~0 0)} assume true; {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:49:33,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2271#(<= ~counter~0 0)} {2263#true} #82#return; {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:49:33,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {2271#(<= ~counter~0 0)} call #t~ret7 := main(); {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:49:33,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {2271#(<= ~counter~0 0)} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~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; {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:49:33,534 INFO L272 TraceCheckUtils]: 6: Hoare triple {2271#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:49:33,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {2271#(<= ~counter~0 0)} ~cond := #in~cond; {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:49:33,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {2271#(<= ~counter~0 0)} assume !(0 == ~cond); {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:49:33,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {2271#(<= ~counter~0 0)} assume true; {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:49:33,536 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2271#(<= ~counter~0 0)} {2271#(<= ~counter~0 0)} #64#return; {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:49:33,536 INFO L272 TraceCheckUtils]: 11: Hoare triple {2271#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:49:33,536 INFO L290 TraceCheckUtils]: 12: Hoare triple {2271#(<= ~counter~0 0)} ~cond := #in~cond; {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:49:33,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {2271#(<= ~counter~0 0)} assume !(0 == ~cond); {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:49:33,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {2271#(<= ~counter~0 0)} assume true; {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:49:33,538 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2271#(<= ~counter~0 0)} {2271#(<= ~counter~0 0)} #66#return; {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:49:33,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {2271#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:49:33,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {2271#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:49:33,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {2320#(<= ~counter~0 1)} assume !!(#t~post6 < 2);havoc #t~post6; {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:49:33,545 INFO L272 TraceCheckUtils]: 19: Hoare triple {2320#(<= ~counter~0 1)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:49:33,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {2320#(<= ~counter~0 1)} ~cond := #in~cond; {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:49:33,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {2320#(<= ~counter~0 1)} assume !(0 == ~cond); {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:49:33,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {2320#(<= ~counter~0 1)} assume true; {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:49:33,546 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2320#(<= ~counter~0 1)} {2320#(<= ~counter~0 1)} #68#return; {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:49:33,547 INFO L272 TraceCheckUtils]: 24: Hoare triple {2320#(<= ~counter~0 1)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:49:33,547 INFO L290 TraceCheckUtils]: 25: Hoare triple {2320#(<= ~counter~0 1)} ~cond := #in~cond; {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:49:33,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {2320#(<= ~counter~0 1)} assume !(0 == ~cond); {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:49:33,548 INFO L290 TraceCheckUtils]: 27: Hoare triple {2320#(<= ~counter~0 1)} assume true; {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:49:33,549 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2320#(<= ~counter~0 1)} {2320#(<= ~counter~0 1)} #70#return; {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:49:33,549 INFO L272 TraceCheckUtils]: 29: Hoare triple {2320#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:49:33,550 INFO L290 TraceCheckUtils]: 30: Hoare triple {2320#(<= ~counter~0 1)} ~cond := #in~cond; {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:49:33,550 INFO L290 TraceCheckUtils]: 31: Hoare triple {2320#(<= ~counter~0 1)} assume !(0 == ~cond); {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:49:33,550 INFO L290 TraceCheckUtils]: 32: Hoare triple {2320#(<= ~counter~0 1)} assume true; {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:49:33,551 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2320#(<= ~counter~0 1)} {2320#(<= ~counter~0 1)} #72#return; {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:49:33,551 INFO L290 TraceCheckUtils]: 34: Hoare triple {2320#(<= ~counter~0 1)} assume !!(~a~0 != ~b~0); {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:49:33,551 INFO L290 TraceCheckUtils]: 35: Hoare triple {2320#(<= ~counter~0 1)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:49:33,552 INFO L290 TraceCheckUtils]: 36: Hoare triple {2320#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2378#(<= |main_#t~post6| 1)} is VALID [2022-04-27 12:49:33,552 INFO L290 TraceCheckUtils]: 37: Hoare triple {2378#(<= |main_#t~post6| 1)} assume !(#t~post6 < 2);havoc #t~post6; {2264#false} is VALID [2022-04-27 12:49:33,552 INFO L272 TraceCheckUtils]: 38: Hoare triple {2264#false} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {2264#false} is VALID [2022-04-27 12:49:33,552 INFO L290 TraceCheckUtils]: 39: Hoare triple {2264#false} ~cond := #in~cond; {2264#false} is VALID [2022-04-27 12:49:33,553 INFO L290 TraceCheckUtils]: 40: Hoare triple {2264#false} assume 0 == ~cond; {2264#false} is VALID [2022-04-27 12:49:33,553 INFO L290 TraceCheckUtils]: 41: Hoare triple {2264#false} assume !false; {2264#false} is VALID [2022-04-27 12:49:33,553 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 12:49:33,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:49:33,742 INFO L290 TraceCheckUtils]: 41: Hoare triple {2264#false} assume !false; {2264#false} is VALID [2022-04-27 12:49:33,742 INFO L290 TraceCheckUtils]: 40: Hoare triple {2264#false} assume 0 == ~cond; {2264#false} is VALID [2022-04-27 12:49:33,742 INFO L290 TraceCheckUtils]: 39: Hoare triple {2264#false} ~cond := #in~cond; {2264#false} is VALID [2022-04-27 12:49:33,742 INFO L272 TraceCheckUtils]: 38: Hoare triple {2264#false} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {2264#false} is VALID [2022-04-27 12:49:33,743 INFO L290 TraceCheckUtils]: 37: Hoare triple {2378#(<= |main_#t~post6| 1)} assume !(#t~post6 < 2);havoc #t~post6; {2264#false} is VALID [2022-04-27 12:49:33,743 INFO L290 TraceCheckUtils]: 36: Hoare triple {2320#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2378#(<= |main_#t~post6| 1)} is VALID [2022-04-27 12:49:33,744 INFO L290 TraceCheckUtils]: 35: Hoare triple {2320#(<= ~counter~0 1)} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:49:33,744 INFO L290 TraceCheckUtils]: 34: Hoare triple {2320#(<= ~counter~0 1)} assume !!(~a~0 != ~b~0); {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:49:33,745 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2263#true} {2320#(<= ~counter~0 1)} #72#return; {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:49:33,745 INFO L290 TraceCheckUtils]: 32: Hoare triple {2263#true} assume true; {2263#true} is VALID [2022-04-27 12:49:33,745 INFO L290 TraceCheckUtils]: 31: Hoare triple {2263#true} assume !(0 == ~cond); {2263#true} is VALID [2022-04-27 12:49:33,745 INFO L290 TraceCheckUtils]: 30: Hoare triple {2263#true} ~cond := #in~cond; {2263#true} is VALID [2022-04-27 12:49:33,745 INFO L272 TraceCheckUtils]: 29: Hoare triple {2320#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2263#true} is VALID [2022-04-27 12:49:33,746 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2263#true} {2320#(<= ~counter~0 1)} #70#return; {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:49:33,746 INFO L290 TraceCheckUtils]: 27: Hoare triple {2263#true} assume true; {2263#true} is VALID [2022-04-27 12:49:33,746 INFO L290 TraceCheckUtils]: 26: Hoare triple {2263#true} assume !(0 == ~cond); {2263#true} is VALID [2022-04-27 12:49:33,746 INFO L290 TraceCheckUtils]: 25: Hoare triple {2263#true} ~cond := #in~cond; {2263#true} is VALID [2022-04-27 12:49:33,746 INFO L272 TraceCheckUtils]: 24: Hoare triple {2320#(<= ~counter~0 1)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2263#true} is VALID [2022-04-27 12:49:33,747 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2263#true} {2320#(<= ~counter~0 1)} #68#return; {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:49:33,747 INFO L290 TraceCheckUtils]: 22: Hoare triple {2263#true} assume true; {2263#true} is VALID [2022-04-27 12:49:33,747 INFO L290 TraceCheckUtils]: 21: Hoare triple {2263#true} assume !(0 == ~cond); {2263#true} is VALID [2022-04-27 12:49:33,747 INFO L290 TraceCheckUtils]: 20: Hoare triple {2263#true} ~cond := #in~cond; {2263#true} is VALID [2022-04-27 12:49:33,747 INFO L272 TraceCheckUtils]: 19: Hoare triple {2320#(<= ~counter~0 1)} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {2263#true} is VALID [2022-04-27 12:49:33,748 INFO L290 TraceCheckUtils]: 18: Hoare triple {2320#(<= ~counter~0 1)} assume !!(#t~post6 < 2);havoc #t~post6; {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:49:33,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {2271#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2320#(<= ~counter~0 1)} is VALID [2022-04-27 12:49:33,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {2271#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:49:33,749 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2263#true} {2271#(<= ~counter~0 0)} #66#return; {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:49:33,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {2263#true} assume true; {2263#true} is VALID [2022-04-27 12:49:33,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {2263#true} assume !(0 == ~cond); {2263#true} is VALID [2022-04-27 12:49:33,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {2263#true} ~cond := #in~cond; {2263#true} is VALID [2022-04-27 12:49:33,750 INFO L272 TraceCheckUtils]: 11: Hoare triple {2271#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2263#true} is VALID [2022-04-27 12:49:33,750 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2263#true} {2271#(<= ~counter~0 0)} #64#return; {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:49:33,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {2263#true} assume true; {2263#true} is VALID [2022-04-27 12:49:33,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {2263#true} assume !(0 == ~cond); {2263#true} is VALID [2022-04-27 12:49:33,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {2263#true} ~cond := #in~cond; {2263#true} is VALID [2022-04-27 12:49:33,751 INFO L272 TraceCheckUtils]: 6: Hoare triple {2271#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2263#true} is VALID [2022-04-27 12:49:33,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {2271#(<= ~counter~0 0)} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~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; {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:49:33,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {2271#(<= ~counter~0 0)} call #t~ret7 := main(); {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:49:33,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2271#(<= ~counter~0 0)} {2263#true} #82#return; {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:49:33,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {2271#(<= ~counter~0 0)} assume true; {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:49:33,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {2263#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2271#(<= ~counter~0 0)} is VALID [2022-04-27 12:49:33,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {2263#true} call ULTIMATE.init(); {2263#true} is VALID [2022-04-27 12:49:33,753 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 12:49:33,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:49:33,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354258166] [2022-04-27 12:49:33,754 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:49:33,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112360393] [2022-04-27 12:49:33,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112360393] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:49:33,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:49:33,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-27 12:49:33,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3803612] [2022-04-27 12:49:33,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:49:33,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 4 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 42 [2022-04-27 12:49:33,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:49:33,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 4 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-27 12:49:33,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:49:33,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:49:33,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:49:33,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:49:33,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:49:33,795 INFO L87 Difference]: Start difference. First operand 78 states and 109 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 4 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-27 12:49:33,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:49:33,967 INFO L93 Difference]: Finished difference Result 121 states and 152 transitions. [2022-04-27 12:49:33,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:49:33,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 4 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 42 [2022-04-27 12:49:33,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:49:33,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 4 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-27 12:49:33,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-04-27 12:49:33,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 4 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-27 12:49:33,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-04-27 12:49:33,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2022-04-27 12:49:34,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:49:34,034 INFO L225 Difference]: With dead ends: 121 [2022-04-27 12:49:34,034 INFO L226 Difference]: Without dead ends: 102 [2022-04-27 12:49:34,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:49:34,035 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 13 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:49:34,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 118 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:49:34,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-27 12:49:34,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2022-04-27 12:49:34,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:49:34,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 100 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 63 states have internal predecessors, (69), 31 states have call successors, (31), 13 states have call predecessors, (31), 11 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:49:34,085 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 100 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 63 states have internal predecessors, (69), 31 states have call successors, (31), 13 states have call predecessors, (31), 11 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:49:34,085 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 100 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 63 states have internal predecessors, (69), 31 states have call successors, (31), 13 states have call predecessors, (31), 11 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:49:34,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:49:34,089 INFO L93 Difference]: Finished difference Result 102 states and 128 transitions. [2022-04-27 12:49:34,089 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 128 transitions. [2022-04-27 12:49:34,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:49:34,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:49:34,090 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 63 states have internal predecessors, (69), 31 states have call successors, (31), 13 states have call predecessors, (31), 11 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) Second operand 102 states. [2022-04-27 12:49:34,090 INFO L87 Difference]: Start difference. First operand has 100 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 63 states have internal predecessors, (69), 31 states have call successors, (31), 13 states have call predecessors, (31), 11 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) Second operand 102 states. [2022-04-27 12:49:34,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:49:34,094 INFO L93 Difference]: Finished difference Result 102 states and 128 transitions. [2022-04-27 12:49:34,094 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 128 transitions. [2022-04-27 12:49:34,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:49:34,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:49:34,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:49:34,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:49:34,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 63 states have internal predecessors, (69), 31 states have call successors, (31), 13 states have call predecessors, (31), 11 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2022-04-27 12:49:34,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 127 transitions. [2022-04-27 12:49:34,098 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 127 transitions. Word has length 42 [2022-04-27 12:49:34,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:49:34,098 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 127 transitions. [2022-04-27 12:49:34,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 4 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-27 12:49:34,099 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 127 transitions. [2022-04-27 12:49:34,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 12:49:34,099 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:49:34,099 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:49:34,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 12:49:34,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:49:34,324 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:49:34,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:49:34,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1083409702, now seen corresponding path program 1 times [2022-04-27 12:49:34,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:49:34,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839931749] [2022-04-27 12:49:34,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:49:34,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:49:34,339 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:49:34,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [740808581] [2022-04-27 12:49:34,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:49:34,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:49:34,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:49:34,341 INFO L229 MonitoredProcess]: Starting monitored process 7 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:49:34,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 12:49:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:49:34,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 12:49:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:49:34,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:49:35,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {3055#true} call ULTIMATE.init(); {3055#true} is VALID [2022-04-27 12:49:35,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {3055#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3055#true} is VALID [2022-04-27 12:49:35,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {3055#true} assume true; {3055#true} is VALID [2022-04-27 12:49:35,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3055#true} {3055#true} #82#return; {3055#true} is VALID [2022-04-27 12:49:35,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {3055#true} call #t~ret7 := main(); {3055#true} is VALID [2022-04-27 12:49:35,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {3055#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~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; {3055#true} is VALID [2022-04-27 12:49:35,824 INFO L272 TraceCheckUtils]: 6: Hoare triple {3055#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3055#true} is VALID [2022-04-27 12:49:35,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {3055#true} ~cond := #in~cond; {3055#true} is VALID [2022-04-27 12:49:35,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {3055#true} assume !(0 == ~cond); {3055#true} is VALID [2022-04-27 12:49:35,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {3055#true} assume true; {3055#true} is VALID [2022-04-27 12:49:35,824 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3055#true} {3055#true} #64#return; {3055#true} is VALID [2022-04-27 12:49:35,825 INFO L272 TraceCheckUtils]: 11: Hoare triple {3055#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3055#true} is VALID [2022-04-27 12:49:35,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {3055#true} ~cond := #in~cond; {3055#true} is VALID [2022-04-27 12:49:35,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {3055#true} assume !(0 == ~cond); {3055#true} is VALID [2022-04-27 12:49:35,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {3055#true} assume true; {3055#true} is VALID [2022-04-27 12:49:35,825 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3055#true} {3055#true} #66#return; {3055#true} is VALID [2022-04-27 12:49:35,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {3055#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:49:35,826 INFO L290 TraceCheckUtils]: 17: Hoare triple {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:49:35,826 INFO L290 TraceCheckUtils]: 18: Hoare triple {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(#t~post6 < 2);havoc #t~post6; {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:49:35,826 INFO L272 TraceCheckUtils]: 19: Hoare triple {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3055#true} is VALID [2022-04-27 12:49:35,827 INFO L290 TraceCheckUtils]: 20: Hoare triple {3055#true} ~cond := #in~cond; {3055#true} is VALID [2022-04-27 12:49:35,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {3055#true} assume !(0 == ~cond); {3055#true} is VALID [2022-04-27 12:49:35,827 INFO L290 TraceCheckUtils]: 22: Hoare triple {3055#true} assume true; {3055#true} is VALID [2022-04-27 12:49:35,827 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3055#true} {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #68#return; {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:49:35,828 INFO L272 TraceCheckUtils]: 24: Hoare triple {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3055#true} is VALID [2022-04-27 12:49:35,828 INFO L290 TraceCheckUtils]: 25: Hoare triple {3055#true} ~cond := #in~cond; {3055#true} is VALID [2022-04-27 12:49:35,828 INFO L290 TraceCheckUtils]: 26: Hoare triple {3055#true} assume !(0 == ~cond); {3055#true} is VALID [2022-04-27 12:49:35,828 INFO L290 TraceCheckUtils]: 27: Hoare triple {3055#true} assume true; {3055#true} is VALID [2022-04-27 12:49:35,829 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3055#true} {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #70#return; {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:49:35,829 INFO L272 TraceCheckUtils]: 29: Hoare triple {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3055#true} is VALID [2022-04-27 12:49:35,829 INFO L290 TraceCheckUtils]: 30: Hoare triple {3055#true} ~cond := #in~cond; {3055#true} is VALID [2022-04-27 12:49:35,829 INFO L290 TraceCheckUtils]: 31: Hoare triple {3055#true} assume !(0 == ~cond); {3055#true} is VALID [2022-04-27 12:49:35,829 INFO L290 TraceCheckUtils]: 32: Hoare triple {3055#true} assume true; {3055#true} is VALID [2022-04-27 12:49:35,830 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3055#true} {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #72#return; {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:49:35,830 INFO L290 TraceCheckUtils]: 34: Hoare triple {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:49:35,831 INFO L290 TraceCheckUtils]: 35: Hoare triple {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:49:35,831 INFO L290 TraceCheckUtils]: 36: Hoare triple {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:49:35,831 INFO L290 TraceCheckUtils]: 37: Hoare triple {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(#t~post6 < 2);havoc #t~post6; {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-27 12:49:35,832 INFO L272 TraceCheckUtils]: 38: Hoare triple {3108#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3175#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:49:35,833 INFO L290 TraceCheckUtils]: 39: Hoare triple {3175#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3179#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:49:35,833 INFO L290 TraceCheckUtils]: 40: Hoare triple {3179#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3056#false} is VALID [2022-04-27 12:49:35,833 INFO L290 TraceCheckUtils]: 41: Hoare triple {3056#false} assume !false; {3056#false} is VALID [2022-04-27 12:49:35,833 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-27 12:49:35,833 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:49:35,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:49:35,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839931749] [2022-04-27 12:49:35,834 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:49:35,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740808581] [2022-04-27 12:49:35,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740808581] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:49:35,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:49:35,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:49:35,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017581983] [2022-04-27 12:49:35,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:49:35,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2022-04-27 12:49:35,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:49:35,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:49:35,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:49:35,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:49:35,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:49:35,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:49:35,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:49:35,862 INFO L87 Difference]: Start difference. First operand 100 states and 127 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:49:36,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:49:36,066 INFO L93 Difference]: Finished difference Result 106 states and 132 transitions. [2022-04-27 12:49:36,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:49:36,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2022-04-27 12:49:36,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:49:36,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:49:36,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-04-27 12:49:36,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:49:36,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-04-27 12:49:36,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 62 transitions. [2022-04-27 12:49:36,130 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:49:36,134 INFO L225 Difference]: With dead ends: 106 [2022-04-27 12:49:36,134 INFO L226 Difference]: Without dead ends: 103 [2022-04-27 12:49:36,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 1 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:49:36,135 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:49:36,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 132 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:49:36,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-27 12:49:36,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-27 12:49:36,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:49:36,180 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 103 states, 60 states have (on average 1.2) internal successors, (72), 66 states have internal predecessors, (72), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 12:49:36,180 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 103 states, 60 states have (on average 1.2) internal successors, (72), 66 states have internal predecessors, (72), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 12:49:36,181 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 103 states, 60 states have (on average 1.2) internal successors, (72), 66 states have internal predecessors, (72), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 12:49:36,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:49:36,184 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2022-04-27 12:49:36,184 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2022-04-27 12:49:36,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:49:36,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:49:36,185 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 60 states have (on average 1.2) internal successors, (72), 66 states have internal predecessors, (72), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) Second operand 103 states. [2022-04-27 12:49:36,185 INFO L87 Difference]: Start difference. First operand has 103 states, 60 states have (on average 1.2) internal successors, (72), 66 states have internal predecessors, (72), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) Second operand 103 states. [2022-04-27 12:49:36,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:49:36,189 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2022-04-27 12:49:36,189 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2022-04-27 12:49:36,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:49:36,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:49:36,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:49:36,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:49:36,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 60 states have (on average 1.2) internal successors, (72), 66 states have internal predecessors, (72), 30 states have call successors, (30), 14 states have call predecessors, (30), 12 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-27 12:49:36,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 128 transitions. [2022-04-27 12:49:36,193 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 128 transitions. Word has length 42 [2022-04-27 12:49:36,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:49:36,193 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 128 transitions. [2022-04-27 12:49:36,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:49:36,193 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 128 transitions. [2022-04-27 12:49:36,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 12:49:36,194 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:49:36,194 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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:49:36,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 12:49:36,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:49:36,416 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:49:36,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:49:36,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1376219446, now seen corresponding path program 1 times [2022-04-27 12:49:36,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:49:36,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378342634] [2022-04-27 12:49:36,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:49:36,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:49:36,428 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:49:36,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1342393529] [2022-04-27 12:49:36,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:49:36,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:49:36,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:49:36,430 INFO L229 MonitoredProcess]: Starting monitored process 8 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:49:36,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 12:49:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:49:36,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 12:49:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:49:36,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:49:36,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {3703#true} call ULTIMATE.init(); {3703#true} is VALID [2022-04-27 12:49:36,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {3703#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3703#true} is VALID [2022-04-27 12:49:36,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {3703#true} assume true; {3703#true} is VALID [2022-04-27 12:49:36,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3703#true} {3703#true} #82#return; {3703#true} is VALID [2022-04-27 12:49:36,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {3703#true} call #t~ret7 := main(); {3703#true} is VALID [2022-04-27 12:49:36,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {3703#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~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; {3703#true} is VALID [2022-04-27 12:49:36,643 INFO L272 TraceCheckUtils]: 6: Hoare triple {3703#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3703#true} is VALID [2022-04-27 12:49:36,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {3703#true} ~cond := #in~cond; {3703#true} is VALID [2022-04-27 12:49:36,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {3703#true} assume !(0 == ~cond); {3703#true} is VALID [2022-04-27 12:49:36,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {3703#true} assume true; {3703#true} is VALID [2022-04-27 12:49:36,644 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3703#true} {3703#true} #64#return; {3703#true} is VALID [2022-04-27 12:49:36,644 INFO L272 TraceCheckUtils]: 11: Hoare triple {3703#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3703#true} is VALID [2022-04-27 12:49:36,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {3703#true} ~cond := #in~cond; {3703#true} is VALID [2022-04-27 12:49:36,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {3703#true} assume !(0 == ~cond); {3703#true} is VALID [2022-04-27 12:49:36,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {3703#true} assume true; {3703#true} is VALID [2022-04-27 12:49:36,644 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3703#true} {3703#true} #66#return; {3703#true} is VALID [2022-04-27 12:49:36,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {3703#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3703#true} is VALID [2022-04-27 12:49:36,644 INFO L290 TraceCheckUtils]: 17: Hoare triple {3703#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3703#true} is VALID [2022-04-27 12:49:36,644 INFO L290 TraceCheckUtils]: 18: Hoare triple {3703#true} assume !!(#t~post6 < 2);havoc #t~post6; {3703#true} is VALID [2022-04-27 12:49:36,645 INFO L272 TraceCheckUtils]: 19: Hoare triple {3703#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3703#true} is VALID [2022-04-27 12:49:36,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {3703#true} ~cond := #in~cond; {3703#true} is VALID [2022-04-27 12:49:36,645 INFO L290 TraceCheckUtils]: 21: Hoare triple {3703#true} assume !(0 == ~cond); {3703#true} is VALID [2022-04-27 12:49:36,645 INFO L290 TraceCheckUtils]: 22: Hoare triple {3703#true} assume true; {3703#true} is VALID [2022-04-27 12:49:36,645 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3703#true} {3703#true} #68#return; {3703#true} is VALID [2022-04-27 12:49:36,645 INFO L272 TraceCheckUtils]: 24: Hoare triple {3703#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3703#true} is VALID [2022-04-27 12:49:36,645 INFO L290 TraceCheckUtils]: 25: Hoare triple {3703#true} ~cond := #in~cond; {3783#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:49:36,646 INFO L290 TraceCheckUtils]: 26: Hoare triple {3783#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3787#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:49:36,646 INFO L290 TraceCheckUtils]: 27: Hoare triple {3787#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3787#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:49:36,647 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3787#(not (= |__VERIFIER_assert_#in~cond| 0))} {3703#true} #70#return; {3794#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:49:36,647 INFO L272 TraceCheckUtils]: 29: Hoare triple {3794#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3703#true} is VALID [2022-04-27 12:49:36,648 INFO L290 TraceCheckUtils]: 30: Hoare triple {3703#true} ~cond := #in~cond; {3703#true} is VALID [2022-04-27 12:49:36,648 INFO L290 TraceCheckUtils]: 31: Hoare triple {3703#true} assume !(0 == ~cond); {3703#true} is VALID [2022-04-27 12:49:36,648 INFO L290 TraceCheckUtils]: 32: Hoare triple {3703#true} assume true; {3703#true} is VALID [2022-04-27 12:49:36,649 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3703#true} {3794#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #72#return; {3794#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:49:36,649 INFO L290 TraceCheckUtils]: 34: Hoare triple {3794#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !(~a~0 != ~b~0); {3813#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:49:36,649 INFO L272 TraceCheckUtils]: 35: Hoare triple {3813#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {3703#true} is VALID [2022-04-27 12:49:36,649 INFO L290 TraceCheckUtils]: 36: Hoare triple {3703#true} ~cond := #in~cond; {3703#true} is VALID [2022-04-27 12:49:36,649 INFO L290 TraceCheckUtils]: 37: Hoare triple {3703#true} assume !(0 == ~cond); {3703#true} is VALID [2022-04-27 12:49:36,650 INFO L290 TraceCheckUtils]: 38: Hoare triple {3703#true} assume true; {3703#true} is VALID [2022-04-27 12:49:36,650 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3703#true} {3813#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #74#return; {3813#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:49:36,651 INFO L272 TraceCheckUtils]: 40: Hoare triple {3813#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~p~0 * ~x~0 + ~r~0 * ~y~0 - ~b~0 then 1 else 0)); {3832#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:49:36,652 INFO L290 TraceCheckUtils]: 41: Hoare triple {3832#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3836#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:49:36,652 INFO L290 TraceCheckUtils]: 42: Hoare triple {3836#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3704#false} is VALID [2022-04-27 12:49:36,652 INFO L290 TraceCheckUtils]: 43: Hoare triple {3704#false} assume !false; {3704#false} is VALID [2022-04-27 12:49:36,652 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-27 12:49:36,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:49:51,362 INFO L290 TraceCheckUtils]: 43: Hoare triple {3704#false} assume !false; {3704#false} is VALID [2022-04-27 12:49:51,363 INFO L290 TraceCheckUtils]: 42: Hoare triple {3836#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3704#false} is VALID [2022-04-27 12:49:51,363 INFO L290 TraceCheckUtils]: 41: Hoare triple {3832#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3836#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:49:51,364 INFO L272 TraceCheckUtils]: 40: Hoare triple {3813#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~p~0 * ~x~0 + ~r~0 * ~y~0 - ~b~0 then 1 else 0)); {3832#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:49:51,365 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3703#true} {3813#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #74#return; {3813#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:49:51,365 INFO L290 TraceCheckUtils]: 38: Hoare triple {3703#true} assume true; {3703#true} is VALID [2022-04-27 12:49:51,365 INFO L290 TraceCheckUtils]: 37: Hoare triple {3703#true} assume !(0 == ~cond); {3703#true} is VALID [2022-04-27 12:49:51,365 INFO L290 TraceCheckUtils]: 36: Hoare triple {3703#true} ~cond := #in~cond; {3703#true} is VALID [2022-04-27 12:49:51,365 INFO L272 TraceCheckUtils]: 35: Hoare triple {3813#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~a~0 - ~b~0 then 1 else 0)); {3703#true} is VALID [2022-04-27 12:49:51,366 INFO L290 TraceCheckUtils]: 34: Hoare triple {3794#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !(~a~0 != ~b~0); {3813#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:49:51,366 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3703#true} {3794#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #72#return; {3794#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:49:51,367 INFO L290 TraceCheckUtils]: 32: Hoare triple {3703#true} assume true; {3703#true} is VALID [2022-04-27 12:49:51,367 INFO L290 TraceCheckUtils]: 31: Hoare triple {3703#true} assume !(0 == ~cond); {3703#true} is VALID [2022-04-27 12:49:51,367 INFO L290 TraceCheckUtils]: 30: Hoare triple {3703#true} ~cond := #in~cond; {3703#true} is VALID [2022-04-27 12:49:51,367 INFO L272 TraceCheckUtils]: 29: Hoare triple {3794#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3703#true} is VALID [2022-04-27 12:49:51,368 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3787#(not (= |__VERIFIER_assert_#in~cond| 0))} {3703#true} #70#return; {3794#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:49:51,368 INFO L290 TraceCheckUtils]: 27: Hoare triple {3787#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3787#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:49:51,368 INFO L290 TraceCheckUtils]: 26: Hoare triple {3897#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3787#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:49:51,369 INFO L290 TraceCheckUtils]: 25: Hoare triple {3703#true} ~cond := #in~cond; {3897#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:49:51,369 INFO L272 TraceCheckUtils]: 24: Hoare triple {3703#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3703#true} is VALID [2022-04-27 12:49:51,369 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3703#true} {3703#true} #68#return; {3703#true} is VALID [2022-04-27 12:49:51,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {3703#true} assume true; {3703#true} is VALID [2022-04-27 12:49:51,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {3703#true} assume !(0 == ~cond); {3703#true} is VALID [2022-04-27 12:49:51,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {3703#true} ~cond := #in~cond; {3703#true} is VALID [2022-04-27 12:49:51,369 INFO L272 TraceCheckUtils]: 19: Hoare triple {3703#true} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {3703#true} is VALID [2022-04-27 12:49:51,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {3703#true} assume !!(#t~post6 < 2);havoc #t~post6; {3703#true} is VALID [2022-04-27 12:49:51,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {3703#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3703#true} is VALID [2022-04-27 12:49:51,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {3703#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3703#true} is VALID [2022-04-27 12:49:51,370 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3703#true} {3703#true} #66#return; {3703#true} is VALID [2022-04-27 12:49:51,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {3703#true} assume true; {3703#true} is VALID [2022-04-27 12:49:51,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {3703#true} assume !(0 == ~cond); {3703#true} is VALID [2022-04-27 12:49:51,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {3703#true} ~cond := #in~cond; {3703#true} is VALID [2022-04-27 12:49:51,370 INFO L272 TraceCheckUtils]: 11: Hoare triple {3703#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3703#true} is VALID [2022-04-27 12:49:51,370 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3703#true} {3703#true} #64#return; {3703#true} is VALID [2022-04-27 12:49:51,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {3703#true} assume true; {3703#true} is VALID [2022-04-27 12:49:51,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {3703#true} assume !(0 == ~cond); {3703#true} is VALID [2022-04-27 12:49:51,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {3703#true} ~cond := #in~cond; {3703#true} is VALID [2022-04-27 12:49:51,370 INFO L272 TraceCheckUtils]: 6: Hoare triple {3703#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3703#true} is VALID [2022-04-27 12:49:51,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {3703#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~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; {3703#true} is VALID [2022-04-27 12:49:51,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {3703#true} call #t~ret7 := main(); {3703#true} is VALID [2022-04-27 12:49:51,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3703#true} {3703#true} #82#return; {3703#true} is VALID [2022-04-27 12:49:51,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {3703#true} assume true; {3703#true} is VALID [2022-04-27 12:49:51,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {3703#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3703#true} is VALID [2022-04-27 12:49:51,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {3703#true} call ULTIMATE.init(); {3703#true} is VALID [2022-04-27 12:49:51,371 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-27 12:49:51,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:49:51,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378342634] [2022-04-27 12:49:51,371 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:49:51,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342393529] [2022-04-27 12:49:51,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342393529] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:49:51,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:49:51,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-27 12:49:51,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965305674] [2022-04-27 12:49:51,372 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:49:51,373 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2022-04-27 12:49:51,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:49:51,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 12:49:51,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:49:51,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 12:49:51,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:49:51,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 12:49:51,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:49:51,404 INFO L87 Difference]: Start difference. First operand 103 states and 128 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 12:49:52,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:49:52,063 INFO L93 Difference]: Finished difference Result 118 states and 148 transitions. [2022-04-27 12:49:52,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 12:49:52,063 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2022-04-27 12:49:52,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:49:52,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 12:49:52,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 60 transitions. [2022-04-27 12:49:52,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 12:49:52,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 60 transitions. [2022-04-27 12:49:52,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 60 transitions. [2022-04-27 12:49:52,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:49:52,123 INFO L225 Difference]: With dead ends: 118 [2022-04-27 12:49:52,123 INFO L226 Difference]: Without dead ends: 106 [2022-04-27 12:49:52,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:49:52,124 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 12:49:52,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 140 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 12:49:52,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-27 12:49:52,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2022-04-27 12:49:52,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:49:52,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 104 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 67 states have internal predecessors, (71), 31 states have call successors, (31), 13 states have call predecessors, (31), 12 states have return successors, (28), 23 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 12:49:52,170 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 104 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 67 states have internal predecessors, (71), 31 states have call successors, (31), 13 states have call predecessors, (31), 12 states have return successors, (28), 23 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 12:49:52,170 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 104 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 67 states have internal predecessors, (71), 31 states have call successors, (31), 13 states have call predecessors, (31), 12 states have return successors, (28), 23 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 12:49:52,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:49:52,174 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2022-04-27 12:49:52,174 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2022-04-27 12:49:52,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:49:52,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:49:52,175 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 67 states have internal predecessors, (71), 31 states have call successors, (31), 13 states have call predecessors, (31), 12 states have return successors, (28), 23 states have call predecessors, (28), 28 states have call successors, (28) Second operand 106 states. [2022-04-27 12:49:52,175 INFO L87 Difference]: Start difference. First operand has 104 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 67 states have internal predecessors, (71), 31 states have call successors, (31), 13 states have call predecessors, (31), 12 states have return successors, (28), 23 states have call predecessors, (28), 28 states have call successors, (28) Second operand 106 states. [2022-04-27 12:49:52,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:49:52,179 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2022-04-27 12:49:52,179 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2022-04-27 12:49:52,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:49:52,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:49:52,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:49:52,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:49:52,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 67 states have internal predecessors, (71), 31 states have call successors, (31), 13 states have call predecessors, (31), 12 states have return successors, (28), 23 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 12:49:52,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 130 transitions. [2022-04-27 12:49:52,183 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 130 transitions. Word has length 44 [2022-04-27 12:49:52,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:49:52,184 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 130 transitions. [2022-04-27 12:49:52,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 12:49:52,184 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 130 transitions. [2022-04-27 12:49:52,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-27 12:49:52,184 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:49:52,184 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:49:52,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 12:49:52,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:49:52,408 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:49:52,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:49:52,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1137310021, now seen corresponding path program 2 times [2022-04-27 12:49:52,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:49:52,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188400013] [2022-04-27 12:49:52,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:49:52,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:49:52,422 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:49:52,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [623578866] [2022-04-27 12:49:52,422 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:49:52,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:49:52,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:49:52,423 INFO L229 MonitoredProcess]: Starting monitored process 9 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:49:52,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 12:49:52,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 12:49:52,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:49:52,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 12:49:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:49:52,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:49:52,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {4525#true} call ULTIMATE.init(); {4525#true} is VALID [2022-04-27 12:49:52,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {4525#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4525#true} is VALID [2022-04-27 12:49:52,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {4525#true} assume true; {4525#true} is VALID [2022-04-27 12:49:52,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4525#true} {4525#true} #82#return; {4525#true} is VALID [2022-04-27 12:49:52,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {4525#true} call #t~ret7 := main(); {4525#true} is VALID [2022-04-27 12:49:52,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {4525#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~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; {4525#true} is VALID [2022-04-27 12:49:52,792 INFO L272 TraceCheckUtils]: 6: Hoare triple {4525#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4525#true} is VALID [2022-04-27 12:49:52,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {4525#true} ~cond := #in~cond; {4525#true} is VALID [2022-04-27 12:49:52,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {4525#true} assume !(0 == ~cond); {4525#true} is VALID [2022-04-27 12:49:52,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {4525#true} assume true; {4525#true} is VALID [2022-04-27 12:49:52,792 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4525#true} {4525#true} #64#return; {4525#true} is VALID [2022-04-27 12:49:52,792 INFO L272 TraceCheckUtils]: 11: Hoare triple {4525#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4525#true} is VALID [2022-04-27 12:49:52,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {4525#true} ~cond := #in~cond; {4525#true} is VALID [2022-04-27 12:49:52,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {4525#true} assume !(0 == ~cond); {4525#true} is VALID [2022-04-27 12:49:52,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {4525#true} assume true; {4525#true} is VALID [2022-04-27 12:49:52,792 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4525#true} {4525#true} #66#return; {4525#true} is VALID [2022-04-27 12:49:52,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {4525#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:49:52,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:49:52,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 2);havoc #t~post6; {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:49:52,793 INFO L272 TraceCheckUtils]: 19: Hoare triple {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {4525#true} is VALID [2022-04-27 12:49:52,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {4525#true} ~cond := #in~cond; {4525#true} is VALID [2022-04-27 12:49:52,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {4525#true} assume !(0 == ~cond); {4525#true} is VALID [2022-04-27 12:49:52,794 INFO L290 TraceCheckUtils]: 22: Hoare triple {4525#true} assume true; {4525#true} is VALID [2022-04-27 12:49:52,796 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4525#true} {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #68#return; {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:49:52,796 INFO L272 TraceCheckUtils]: 24: Hoare triple {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4525#true} is VALID [2022-04-27 12:49:52,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {4525#true} ~cond := #in~cond; {4525#true} is VALID [2022-04-27 12:49:52,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {4525#true} assume !(0 == ~cond); {4525#true} is VALID [2022-04-27 12:49:52,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {4525#true} assume true; {4525#true} is VALID [2022-04-27 12:49:52,797 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4525#true} {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #70#return; {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:49:52,797 INFO L272 TraceCheckUtils]: 29: Hoare triple {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4525#true} is VALID [2022-04-27 12:49:52,797 INFO L290 TraceCheckUtils]: 30: Hoare triple {4525#true} ~cond := #in~cond; {4525#true} is VALID [2022-04-27 12:49:52,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {4525#true} assume !(0 == ~cond); {4525#true} is VALID [2022-04-27 12:49:52,797 INFO L290 TraceCheckUtils]: 32: Hoare triple {4525#true} assume true; {4525#true} is VALID [2022-04-27 12:49:52,798 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4525#true} {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #72#return; {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:49:52,799 INFO L290 TraceCheckUtils]: 34: Hoare triple {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~a~0 != ~b~0); {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-27 12:49:52,799 INFO L290 TraceCheckUtils]: 35: Hoare triple {4578#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {4636#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} is VALID [2022-04-27 12:49:52,800 INFO L290 TraceCheckUtils]: 36: Hoare triple {4636#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4636#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} is VALID [2022-04-27 12:49:52,800 INFO L290 TraceCheckUtils]: 37: Hoare triple {4636#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} assume !!(#t~post6 < 2);havoc #t~post6; {4636#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} is VALID [2022-04-27 12:49:52,801 INFO L272 TraceCheckUtils]: 38: Hoare triple {4636#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {4525#true} is VALID [2022-04-27 12:49:52,801 INFO L290 TraceCheckUtils]: 39: Hoare triple {4525#true} ~cond := #in~cond; {4525#true} is VALID [2022-04-27 12:49:52,801 INFO L290 TraceCheckUtils]: 40: Hoare triple {4525#true} assume !(0 == ~cond); {4525#true} is VALID [2022-04-27 12:49:52,801 INFO L290 TraceCheckUtils]: 41: Hoare triple {4525#true} assume true; {4525#true} is VALID [2022-04-27 12:49:52,802 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4525#true} {4636#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} #68#return; {4636#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} is VALID [2022-04-27 12:49:52,802 INFO L272 TraceCheckUtils]: 43: Hoare triple {4636#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= main_~y~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= (- 1) main_~r~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4661#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:49:52,803 INFO L290 TraceCheckUtils]: 44: Hoare triple {4661#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4665#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:49:52,803 INFO L290 TraceCheckUtils]: 45: Hoare triple {4665#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4526#false} is VALID [2022-04-27 12:49:52,803 INFO L290 TraceCheckUtils]: 46: Hoare triple {4526#false} assume !false; {4526#false} is VALID [2022-04-27 12:49:52,804 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 12:49:52,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:49:53,013 INFO L290 TraceCheckUtils]: 46: Hoare triple {4526#false} assume !false; {4526#false} is VALID [2022-04-27 12:49:53,013 INFO L290 TraceCheckUtils]: 45: Hoare triple {4665#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4526#false} is VALID [2022-04-27 12:49:53,014 INFO L290 TraceCheckUtils]: 44: Hoare triple {4661#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4665#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:49:53,015 INFO L272 TraceCheckUtils]: 43: Hoare triple {4681#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4661#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:49:53,015 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4525#true} {4681#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #68#return; {4681#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:49:53,015 INFO L290 TraceCheckUtils]: 41: Hoare triple {4525#true} assume true; {4525#true} is VALID [2022-04-27 12:49:53,015 INFO L290 TraceCheckUtils]: 40: Hoare triple {4525#true} assume !(0 == ~cond); {4525#true} is VALID [2022-04-27 12:49:53,016 INFO L290 TraceCheckUtils]: 39: Hoare triple {4525#true} ~cond := #in~cond; {4525#true} is VALID [2022-04-27 12:49:53,016 INFO L272 TraceCheckUtils]: 38: Hoare triple {4681#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {4525#true} is VALID [2022-04-27 12:49:53,016 INFO L290 TraceCheckUtils]: 37: Hoare triple {4681#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 2);havoc #t~post6; {4681#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:49:53,016 INFO L290 TraceCheckUtils]: 36: Hoare triple {4681#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4681#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:49:53,446 INFO L290 TraceCheckUtils]: 35: Hoare triple {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} assume ~a~0 > ~b~0;~a~0 := ~a~0 - ~b~0;~p~0 := ~p~0 - ~q~0;~r~0 := ~r~0 - ~s~0; {4681#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-27 12:49:53,446 INFO L290 TraceCheckUtils]: 34: Hoare triple {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} assume !!(~a~0 != ~b~0); {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-27 12:49:53,447 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4525#true} {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} #72#return; {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-27 12:49:53,447 INFO L290 TraceCheckUtils]: 32: Hoare triple {4525#true} assume true; {4525#true} is VALID [2022-04-27 12:49:53,447 INFO L290 TraceCheckUtils]: 31: Hoare triple {4525#true} assume !(0 == ~cond); {4525#true} is VALID [2022-04-27 12:49:53,447 INFO L290 TraceCheckUtils]: 30: Hoare triple {4525#true} ~cond := #in~cond; {4525#true} is VALID [2022-04-27 12:49:53,447 INFO L272 TraceCheckUtils]: 29: Hoare triple {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4525#true} is VALID [2022-04-27 12:49:53,451 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4525#true} {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} #70#return; {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-27 12:49:53,451 INFO L290 TraceCheckUtils]: 27: Hoare triple {4525#true} assume true; {4525#true} is VALID [2022-04-27 12:49:53,451 INFO L290 TraceCheckUtils]: 26: Hoare triple {4525#true} assume !(0 == ~cond); {4525#true} is VALID [2022-04-27 12:49:53,451 INFO L290 TraceCheckUtils]: 25: Hoare triple {4525#true} ~cond := #in~cond; {4525#true} is VALID [2022-04-27 12:49:53,451 INFO L272 TraceCheckUtils]: 24: Hoare triple {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4525#true} is VALID [2022-04-27 12:49:53,453 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4525#true} {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} #68#return; {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-27 12:49:53,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {4525#true} assume true; {4525#true} is VALID [2022-04-27 12:49:53,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {4525#true} assume !(0 == ~cond); {4525#true} is VALID [2022-04-27 12:49:53,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {4525#true} ~cond := #in~cond; {4525#true} is VALID [2022-04-27 12:49:53,453 INFO L272 TraceCheckUtils]: 19: Hoare triple {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} call __VERIFIER_assert((if 1 == ~p~0 * ~s~0 - ~r~0 * ~q~0 then 1 else 0)); {4525#true} is VALID [2022-04-27 12:49:53,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} assume !!(#t~post6 < 2);havoc #t~post6; {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-27 12:49:53,454 INFO L290 TraceCheckUtils]: 17: Hoare triple {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-27 12:49:53,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {4525#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4706#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-27 12:49:53,455 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4525#true} {4525#true} #66#return; {4525#true} is VALID [2022-04-27 12:49:53,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {4525#true} assume true; {4525#true} is VALID [2022-04-27 12:49:53,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {4525#true} assume !(0 == ~cond); {4525#true} is VALID [2022-04-27 12:49:53,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {4525#true} ~cond := #in~cond; {4525#true} is VALID [2022-04-27 12:49:53,455 INFO L272 TraceCheckUtils]: 11: Hoare triple {4525#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4525#true} is VALID [2022-04-27 12:49:53,455 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4525#true} {4525#true} #64#return; {4525#true} is VALID [2022-04-27 12:49:53,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {4525#true} assume true; {4525#true} is VALID [2022-04-27 12:49:53,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {4525#true} assume !(0 == ~cond); {4525#true} is VALID [2022-04-27 12:49:53,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {4525#true} ~cond := #in~cond; {4525#true} is VALID [2022-04-27 12:49:53,455 INFO L272 TraceCheckUtils]: 6: Hoare triple {4525#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4525#true} is VALID [2022-04-27 12:49:53,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {4525#true} havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~x~0;havoc ~y~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; {4525#true} is VALID [2022-04-27 12:49:53,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {4525#true} call #t~ret7 := main(); {4525#true} is VALID [2022-04-27 12:49:53,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4525#true} {4525#true} #82#return; {4525#true} is VALID [2022-04-27 12:49:53,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {4525#true} assume true; {4525#true} is VALID [2022-04-27 12:49:53,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {4525#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(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4525#true} is VALID [2022-04-27 12:49:53,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {4525#true} call ULTIMATE.init(); {4525#true} is VALID [2022-04-27 12:49:53,456 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 12:49:53,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:49:53,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188400013] [2022-04-27 12:49:53,456 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:49:53,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623578866] [2022-04-27 12:49:53,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623578866] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:49:53,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:49:53,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-27 12:49:53,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009248998] [2022-04-27 12:49:53,456 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:49:53,457 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 47 [2022-04-27 12:49:53,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:49:53,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-27 12:49:53,557 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:49:53,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:49:53,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:49:53,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:49:53,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:49:53,558 INFO L87 Difference]: Start difference. First operand 104 states and 130 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-27 12:49:56,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:49:56,451 INFO L93 Difference]: Finished difference Result 131 states and 169 transitions. [2022-04-27 12:49:56,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 12:49:56,451 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 47 [2022-04-27 12:49:56,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:49:56,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-27 12:49:56,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-04-27 12:49:56,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-27 12:49:56,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-04-27 12:49:56,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 75 transitions. [2022-04-27 12:49:56,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:49:56,686 INFO L225 Difference]: With dead ends: 131 [2022-04-27 12:49:56,686 INFO L226 Difference]: Without dead ends: 124 [2022-04-27 12:49:56,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:49:56,687 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 15 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 12:49:56,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 150 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 12:49:56,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-27 12:49:56,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 108. [2022-04-27 12:49:56,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:49:56,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 108 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 72 states have internal predecessors, (76), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:49:56,725 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 108 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 72 states have internal predecessors, (76), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:49:56,725 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 108 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 72 states have internal predecessors, (76), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:49:56,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:49:56,728 INFO L93 Difference]: Finished difference Result 124 states and 155 transitions. [2022-04-27 12:49:56,728 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 155 transitions. [2022-04-27 12:49:56,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:49:56,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:49:56,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 72 states have internal predecessors, (76), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) Second operand 124 states. [2022-04-27 12:49:56,729 INFO L87 Difference]: Start difference. First operand has 108 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 72 states have internal predecessors, (76), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) Second operand 124 states. [2022-04-27 12:49:56,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:49:56,733 INFO L93 Difference]: Finished difference Result 124 states and 155 transitions. [2022-04-27 12:49:56,733 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 155 transitions. [2022-04-27 12:49:56,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:49:56,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:49:56,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:49:56,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:49:56,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 72 states have internal predecessors, (76), 27 states have call successors, (27), 15 states have call predecessors, (27), 14 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:49:56,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 126 transitions. [2022-04-27 12:49:56,736 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 126 transitions. Word has length 47 [2022-04-27 12:49:56,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:49:56,737 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 126 transitions. [2022-04-27 12:49:56,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-27 12:49:56,737 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 126 transitions. [2022-04-27 12:49:56,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-27 12:49:56,737 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:49:56,737 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:49:56,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 12:49:56,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 12:49:56,960 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:49:56,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:49:56,960 INFO L85 PathProgramCache]: Analyzing trace with hash 220857665, now seen corresponding path program 2 times [2022-04-27 12:49:56,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:49:56,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194402058] [2022-04-27 12:49:56,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:49:56,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:49:56,974 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:49:56,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1384191889] [2022-04-27 12:49:56,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:49:56,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:49:56,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:49:56,980 INFO L229 MonitoredProcess]: Starting monitored process 10 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:49:56,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 12:49:57,026 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 12:49:57,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-27 12:49:57,027 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 12:49:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 12:49:57,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 12:49:57,070 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 12:49:57,071 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 12:49:57,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-27 12:49:57,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:49:57,300 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:49:57,303 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 12:49:57,336 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 12:49:57,336 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 12:49:57,336 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 12:49:57,336 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 12:49:57,336 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 12:49:57,336 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 12:49:57,337 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 12:49:57,337 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 12:49:57,337 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 12:49:57,337 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 12:49:57,337 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 12:49:57,337 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 12:49:57,337 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-27 12:49:57,337 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 12:49:57,337 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 12:49:57,337 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 12:49:57,337 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 12:49:57,337 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 12:49:57,337 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 12:49:57,337 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-04-27 12:49:57,337 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 12:49:57,337 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-27 12:49:57,337 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 12:49:57,337 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-27 12:49:57,337 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-27 12:49:57,337 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 12:49:57,337 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 12:49:57,337 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 12:49:57,338 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:49:57,338 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:49:57,338 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:49:57,338 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:49:57,338 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:49:57,338 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:49:57,338 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:49:57,338 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2022-04-27 12:49:57,338 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2022-04-27 12:49:57,338 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 12:49:57,338 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-27 12:49:57,338 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 12:49:57,338 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 12:49:57,338 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 12:49:57,338 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 12:49:57,338 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-27 12:49:57,338 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-27 12:49:57,338 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-04-27 12:49:57,338 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-04-27 12:49:57,338 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-04-27 12:49:57,338 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-04-27 12:49:57,338 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-04-27 12:49:57,339 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-27 12:49:57,339 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-27 12:49:57,339 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 12:49:57,339 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 12:49:57,339 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-27 12:49:57,339 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-27 12:49:57,339 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 12:49:57,339 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 12:49:57,339 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 12:49:57,339 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 12:49:57,339 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 12:49:57,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 12:49:57 BoogieIcfgContainer [2022-04-27 12:49:57,340 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 12:49:57,340 INFO L158 Benchmark]: Toolchain (without parser) took 67000.66ms. Allocated memory was 182.5MB in the beginning and 228.6MB in the end (delta: 46.1MB). Free memory was 131.8MB in the beginning and 162.6MB in the end (delta: -30.8MB). Peak memory consumption was 15.5MB. Max. memory is 8.0GB. [2022-04-27 12:49:57,341 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory is still 148.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 12:49:57,341 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.01ms. Allocated memory was 182.5MB in the beginning and 228.6MB in the end (delta: 46.1MB). Free memory was 131.6MB in the beginning and 203.3MB in the end (delta: -71.7MB). Peak memory consumption was 14.4MB. Max. memory is 8.0GB. [2022-04-27 12:49:57,341 INFO L158 Benchmark]: Boogie Preprocessor took 28.64ms. Allocated memory is still 228.6MB. Free memory was 203.3MB in the beginning and 201.6MB in the end (delta: 1.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-27 12:49:57,341 INFO L158 Benchmark]: RCFGBuilder took 287.28ms. Allocated memory is still 228.6MB. Free memory was 201.6MB in the beginning and 189.7MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 12:49:57,343 INFO L158 Benchmark]: TraceAbstraction took 66444.67ms. Allocated memory is still 228.6MB. Free memory was 189.3MB in the beginning and 162.6MB in the end (delta: 26.7MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-04-27 12:49:57,344 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.12ms. Allocated memory is still 182.5MB. Free memory is still 148.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.01ms. Allocated memory was 182.5MB in the beginning and 228.6MB in the end (delta: 46.1MB). Free memory was 131.6MB in the beginning and 203.3MB in the end (delta: -71.7MB). Peak memory consumption was 14.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.64ms. Allocated memory is still 228.6MB. Free memory was 203.3MB in the beginning and 201.6MB in the end (delta: 1.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 287.28ms. Allocated memory is still 228.6MB. Free memory was 201.6MB in the beginning and 189.7MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 66444.67ms. Allocated memory is still 228.6MB. Free memory was 189.3MB in the beginning and 162.6MB in the end (delta: 26.7MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [\old(counter)=5, counter=0] [L20] long long a, b, p, q, r, s; [L21] int x, y; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [\old(counter)=0, counter=0, x=4, y=1] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [\old(counter)=0, counter=0, x=4, y=1] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [\old(counter)=0, a=4, b=1, counter=0, p=1, q=0, r=0, s=1, x=4, y=1] [L34] EXPR counter++ VAL [\old(counter)=0, a=4, b=1, counter=1, counter++=0, p=1, q=0, r=0, s=1, x=4, y=1] [L34] COND TRUE counter++<2 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=4, b=1, counter=1, p=1, q=0, r=0, s=1, x=4, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=4, b=1, counter=1, p=1, q=0, r=0, s=1, x=4, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=4, b=1, counter=1, p=1, q=0, r=0, s=1, x=4, y=1] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=4, b=1, counter=1, p=1, q=0, r=0, s=1, x=4, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=3, b=1, counter=1, p=1, q=0, r=-1, s=1, x=4, y=1] [L34] EXPR counter++ VAL [\old(counter)=0, a=3, b=1, counter=2, counter++=1, p=1, q=0, r=-1, s=1, x=4, y=1] [L34] COND TRUE counter++<2 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [\old(counter)=0, a=3, b=1, counter=2, p=1, q=0, r=-1, s=1, x=4, y=1] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=3, b=1, counter=2, p=1, q=0, r=-1, s=1, x=4, y=1] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=3, b=1, counter=2, p=1, q=0, r=-1, s=1, x=4, y=1] [L39] COND FALSE !(!(a != b)) VAL [\old(counter)=0, a=3, b=1, counter=2, p=1, q=0, r=-1, s=1, x=4, y=1] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [\old(counter)=0, a=2, b=1, counter=2, p=1, q=0, r=-2, s=1, x=4, y=1] [L34] EXPR counter++ VAL [\old(counter)=0, a=2, b=1, counter=3, counter++=2, p=1, q=0, r=-2, s=1, x=4, y=1] [L34] COND FALSE !(counter++<2) [L53] CALL __VERIFIER_assert(a - b == 0) VAL [\old(cond)=0, \old(counter)=0, counter=3] [L11] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] [L13] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 66.4s, OverallIterations: 11, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 148 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 117 mSDsluCounter, 1241 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 847 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 695 IncrementalHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 394 mSDtfsCounter, 695 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 496 GetRequests, 433 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=10, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 30 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 56.1s InterpolantComputationTime, 404 NumberOfCodeBlocks, 404 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 495 ConstructedInterpolants, 0 QuantifiedInterpolants, 1417 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1015 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 257/289 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-27 12:49:57,364 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...