/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/prod4br-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 12:38:02,047 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 12:38:02,049 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 12:38:02,094 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 12:38:02,094 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 12:38:02,098 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 12:38:02,098 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 12:38:02,099 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 12:38:02,100 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 12:38:02,101 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 12:38:02,101 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 12:38:02,102 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 12:38:02,102 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 12:38:02,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 12:38:02,104 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 12:38:02,109 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 12:38:02,109 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 12:38:02,112 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 12:38:02,115 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 12:38:02,116 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 12:38:02,117 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 12:38:02,121 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 12:38:02,122 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 12:38:02,122 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 12:38:02,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 12:38:02,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 12:38:02,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 12:38:02,124 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 12:38:02,125 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 12:38:02,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 12:38:02,125 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 12:38:02,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 12:38:02,126 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 12:38:02,126 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 12:38:02,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 12:38:02,127 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 12:38:02,127 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 12:38:02,128 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 12:38:02,128 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 12:38:02,128 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 12:38:02,128 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 12:38:02,133 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 12:38:02,133 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-07 12:38:02,159 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 12:38:02,159 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 12:38:02,160 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 12:38:02,160 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 12:38:02,160 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 12:38:02,160 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 12:38:02,161 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 12:38:02,161 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 12:38:02,161 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 12:38:02,161 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 12:38:02,161 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 12:38:02,162 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 12:38:02,162 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 12:38:02,162 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 12:38:02,162 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 12:38:02,162 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 12:38:02,162 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 12:38:02,163 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 12:38:02,163 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 12:38:02,163 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 12:38:02,163 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 12:38:02,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 12:38:02,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 12:38:02,163 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 12:38:02,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 12:38:02,163 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 12:38:02,164 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 12:38:02,164 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 12:38:02,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 12:38:02,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 12:38:02,164 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 12:38:02,164 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 12:38:02,164 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 12:38:02,164 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 12:38:02,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 12:38:02,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 12:38:02,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 12:38:02,364 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 12:38:02,366 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 12:38:02,366 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/prod4br-ll.c [2022-04-07 12:38:02,413 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d25512268/4c02a65697484d2e976ce771456b909e/FLAG0b7956269 [2022-04-07 12:38:02,720 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 12:38:02,720 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/prod4br-ll.c [2022-04-07 12:38:02,725 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d25512268/4c02a65697484d2e976ce771456b909e/FLAG0b7956269 [2022-04-07 12:38:03,144 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d25512268/4c02a65697484d2e976ce771456b909e [2022-04-07 12:38:03,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 12:38:03,147 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 12:38:03,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 12:38:03,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 12:38:03,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 12:38:03,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:38:03" (1/1) ... [2022-04-07 12:38:03,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e76e1af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:38:03, skipping insertion in model container [2022-04-07 12:38:03,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:38:03" (1/1) ... [2022-04-07 12:38:03,156 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 12:38:03,167 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 12:38:03,268 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/prod4br-ll.c[524,537] [2022-04-07 12:38:03,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 12:38:03,292 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 12:38:03,300 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/prod4br-ll.c[524,537] [2022-04-07 12:38:03,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 12:38:03,316 INFO L208 MainTranslator]: Completed translation [2022-04-07 12:38:03,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:38:03 WrapperNode [2022-04-07 12:38:03,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 12:38:03,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 12:38:03,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 12:38:03,317 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 12:38:03,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:38:03" (1/1) ... [2022-04-07 12:38:03,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:38:03" (1/1) ... [2022-04-07 12:38:03,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:38:03" (1/1) ... [2022-04-07 12:38:03,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:38:03" (1/1) ... [2022-04-07 12:38:03,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:38:03" (1/1) ... [2022-04-07 12:38:03,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:38:03" (1/1) ... [2022-04-07 12:38:03,334 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:38:03" (1/1) ... [2022-04-07 12:38:03,335 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 12:38:03,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 12:38:03,336 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 12:38:03,336 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 12:38:03,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:38:03" (1/1) ... [2022-04-07 12:38:03,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 12:38:03,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:38:03,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 12:38:03,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 12:38:03,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 12:38:03,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 12:38:03,402 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 12:38:03,402 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 12:38:03,402 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 12:38:03,402 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 12:38:03,402 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 12:38:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 12:38:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 12:38:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 12:38:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 12:38:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 12:38:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 12:38:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 12:38:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 12:38:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 12:38:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 12:38:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 12:38:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 12:38:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 12:38:03,446 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 12:38:03,447 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 12:38:03,610 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 12:38:03,615 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 12:38:03,615 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 12:38:03,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:38:03 BoogieIcfgContainer [2022-04-07 12:38:03,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 12:38:03,617 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 12:38:03,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 12:38:03,620 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 12:38:03,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 12:38:03" (1/3) ... [2022-04-07 12:38:03,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1873da57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:38:03, skipping insertion in model container [2022-04-07 12:38:03,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:38:03" (2/3) ... [2022-04-07 12:38:03,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1873da57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:38:03, skipping insertion in model container [2022-04-07 12:38:03,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:38:03" (3/3) ... [2022-04-07 12:38:03,622 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll.c [2022-04-07 12:38:03,625 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 12:38:03,625 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 12:38:03,672 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 12:38:03,676 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 12:38:03,676 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 12:38:03,703 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 12:38:03,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 12:38:03,706 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:38:03,706 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:38:03,706 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:38:03,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:38:03,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1051010973, now seen corresponding path program 1 times [2022-04-07 12:38:03,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:38:03,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866150051] [2022-04-07 12:38:03,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:38:03,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:38:03,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:38:03,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 12:38:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:38:03,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-07 12:38:03,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-07 12:38:03,881 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #76#return; {34#true} is VALID [2022-04-07 12:38:03,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 12:38:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:38:03,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-07 12:38:03,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-07 12:38:03,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-07 12:38:03,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} #68#return; {35#false} is VALID [2022-04-07 12:38:03,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 12:38:03,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-07 12:38:03,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-07 12:38:03,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #76#return; {34#true} is VALID [2022-04-07 12:38:03,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret6 := main(); {34#true} is VALID [2022-04-07 12:38:03,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~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; {34#true} is VALID [2022-04-07 12:38:03,906 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {34#true} is VALID [2022-04-07 12:38:03,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-07 12:38:03,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-07 12:38:03,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-07 12:38:03,907 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} #68#return; {35#false} is VALID [2022-04-07 12:38:03,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {35#false} is VALID [2022-04-07 12:38:03,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#false} assume false; {35#false} is VALID [2022-04-07 12:38:03,908 INFO L272 TraceCheckUtils]: 13: Hoare triple {35#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {35#false} is VALID [2022-04-07 12:38:03,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-07 12:38:03,908 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-07 12:38:03,908 INFO L290 TraceCheckUtils]: 16: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-07 12:38:03,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:38:03,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:38:03,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866150051] [2022-04-07 12:38:03,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866150051] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:38:03,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:38:03,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 12:38:03,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008002968] [2022-04-07 12:38:03,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:38:03,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-07 12:38:03,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:38:03,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 12:38:03,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:38:03,943 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 12:38:03,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:38:03,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 12:38:03,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 12:38:03,961 INFO L87 Difference]: Start difference. First operand has 31 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 12:38:04,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:38:04,081 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2022-04-07 12:38:04,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 12:38:04,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-07 12:38:04,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:38:04,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 12:38:04,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-04-07 12:38:04,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 12:38:04,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-04-07 12:38:04,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 73 transitions. [2022-04-07 12:38:04,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:38:04,192 INFO L225 Difference]: With dead ends: 53 [2022-04-07 12:38:04,192 INFO L226 Difference]: Without dead ends: 26 [2022-04-07 12:38:04,195 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 12:38:04,199 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 12:38:04,201 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 35 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 12:38:04,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-07 12:38:04,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-07 12:38:04,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:38:04,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 12:38:04,221 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 12:38:04,221 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 12:38:04,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:38:04,224 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-07 12:38:04,224 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-07 12:38:04,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:38:04,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:38:04,224 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-07 12:38:04,225 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-07 12:38:04,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:38:04,227 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-07 12:38:04,227 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-07 12:38:04,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:38:04,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:38:04,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:38:04,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:38:04,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 12:38:04,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-07 12:38:04,230 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2022-04-07 12:38:04,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:38:04,230 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-07 12:38:04,230 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 12:38:04,230 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-07 12:38:04,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 12:38:04,231 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:38:04,231 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:38:04,231 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 12:38:04,231 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:38:04,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:38:04,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1732856803, now seen corresponding path program 1 times [2022-04-07 12:38:04,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:38:04,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644980228] [2022-04-07 12:38:04,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:38:04,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:38:04,292 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:38:04,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1504845417] [2022-04-07 12:38:04,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:38:04,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:38:04,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:38:04,295 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:38:04,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 12:38:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:38:04,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-07 12:38:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:38:04,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:38:04,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {204#true} call ULTIMATE.init(); {204#true} is VALID [2022-04-07 12:38:04,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {204#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(13, 2);call #Ultimate.allocInit(12, 3); {204#true} is VALID [2022-04-07 12:38:04,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {204#true} assume true; {204#true} is VALID [2022-04-07 12:38:04,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {204#true} {204#true} #76#return; {204#true} is VALID [2022-04-07 12:38:04,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {204#true} call #t~ret6 := main(); {204#true} is VALID [2022-04-07 12:38:04,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {204#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~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; {204#true} is VALID [2022-04-07 12:38:04,497 INFO L272 TraceCheckUtils]: 6: Hoare triple {204#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {204#true} is VALID [2022-04-07 12:38:04,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {204#true} ~cond := #in~cond; {204#true} is VALID [2022-04-07 12:38:04,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {204#true} assume !(0 == ~cond); {204#true} is VALID [2022-04-07 12:38:04,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {204#true} assume true; {204#true} is VALID [2022-04-07 12:38:04,497 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {204#true} {204#true} #68#return; {204#true} is VALID [2022-04-07 12:38:04,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {204#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {242#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 12:38:04,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {242#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {242#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 12:38:04,500 INFO L272 TraceCheckUtils]: 13: Hoare triple {242#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {249#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:38:04,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {249#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {253#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:38:04,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {253#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {205#false} is VALID [2022-04-07 12:38:04,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {205#false} assume !false; {205#false} is VALID [2022-04-07 12:38:04,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:38:04,501 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 12:38:04,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:38:04,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644980228] [2022-04-07 12:38:04,502 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:38:04,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504845417] [2022-04-07 12:38:04,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504845417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:38:04,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:38:04,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 12:38:04,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265306822] [2022-04-07 12:38:04,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:38:04,507 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-07 12:38:04,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:38:04,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 12:38:04,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:38:04,520 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 12:38:04,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:38:04,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 12:38:04,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 12:38:04,531 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 12:38:04,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:38:04,690 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-07 12:38:04,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 12:38:04,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-07 12:38:04,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:38:04,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 12:38:04,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-07 12:38:04,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 12:38:04,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-07 12:38:04,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-07 12:38:04,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:38:04,737 INFO L225 Difference]: With dead ends: 40 [2022-04-07 12:38:04,737 INFO L226 Difference]: Without dead ends: 38 [2022-04-07 12:38:04,737 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 12:38:04,738 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 12:38:04,738 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 75 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 12:38:04,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-07 12:38:04,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2022-04-07 12:38:04,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:38:04,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 12:38:04,743 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 12:38:04,744 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 12:38:04,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:38:04,745 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-07 12:38:04,745 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-07 12:38:04,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:38:04,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:38:04,746 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 38 states. [2022-04-07 12:38:04,747 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 38 states. [2022-04-07 12:38:04,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:38:04,748 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-07 12:38:04,748 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-07 12:38:04,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:38:04,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:38:04,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:38:04,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:38:04,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 12:38:04,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-04-07 12:38:04,751 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 17 [2022-04-07 12:38:04,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:38:04,751 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-04-07 12:38:04,751 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 12:38:04,751 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-07 12:38:04,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 12:38:04,752 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:38:04,752 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:38:04,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-07 12:38:04,967 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:38:04,968 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:38:04,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:38:04,968 INFO L85 PathProgramCache]: Analyzing trace with hash -253409975, now seen corresponding path program 1 times [2022-04-07 12:38:04,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:38:04,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913178296] [2022-04-07 12:38:04,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:38:04,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:38:04,995 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:38:04,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1076885296] [2022-04-07 12:38:04,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:38:04,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:38:04,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:38:05,000 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:38:05,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 12:38:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:38:05,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-07 12:38:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:38:05,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:38:15,476 INFO L272 TraceCheckUtils]: 0: Hoare triple {439#true} call ULTIMATE.init(); {439#true} is VALID [2022-04-07 12:38:15,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {439#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(13, 2);call #Ultimate.allocInit(12, 3); {439#true} is VALID [2022-04-07 12:38:15,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {439#true} assume true; {439#true} is VALID [2022-04-07 12:38:15,477 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {439#true} {439#true} #76#return; {439#true} is VALID [2022-04-07 12:38:15,477 INFO L272 TraceCheckUtils]: 4: Hoare triple {439#true} call #t~ret6 := main(); {439#true} is VALID [2022-04-07 12:38:15,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {439#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~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; {439#true} is VALID [2022-04-07 12:38:15,478 INFO L272 TraceCheckUtils]: 6: Hoare triple {439#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {439#true} is VALID [2022-04-07 12:38:15,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {439#true} ~cond := #in~cond; {465#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 12:38:15,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {465#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {469#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 12:38:15,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {469#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {469#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 12:38:15,482 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {469#(not (= |assume_abort_if_not_#in~cond| 0))} {439#true} #68#return; {476#(<= 1 main_~y~0)} is VALID [2022-04-07 12:38:15,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {476#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {480#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-07 12:38:15,483 INFO L290 TraceCheckUtils]: 12: Hoare triple {480#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !false; {480#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-07 12:38:15,483 INFO L272 TraceCheckUtils]: 13: Hoare triple {480#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {439#true} is VALID [2022-04-07 12:38:15,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {439#true} ~cond := #in~cond; {490#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:38:15,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {490#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {494#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:38:15,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {494#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {494#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:38:17,492 WARN L284 TraceCheckUtils]: 17: Hoare quadruple {494#(not (= |__VERIFIER_assert_#in~cond| 0))} {480#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} #70#return; {501#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is UNKNOWN [2022-04-07 12:38:17,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {501#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !(0 != ~a~0 && 0 != ~b~0); {505#(and (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} is VALID [2022-04-07 12:38:17,494 INFO L272 TraceCheckUtils]: 19: Hoare triple {505#(and (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {509#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:38:17,495 INFO L290 TraceCheckUtils]: 20: Hoare triple {509#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {513#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:38:17,495 INFO L290 TraceCheckUtils]: 21: Hoare triple {513#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {440#false} is VALID [2022-04-07 12:38:17,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {440#false} assume !false; {440#false} is VALID [2022-04-07 12:38:17,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:38:17,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:38:30,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {440#false} assume !false; {440#false} is VALID [2022-04-07 12:38:30,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {513#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {440#false} is VALID [2022-04-07 12:38:30,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {509#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {513#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:38:30,175 INFO L272 TraceCheckUtils]: 19: Hoare triple {529#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {509#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:38:30,176 INFO L290 TraceCheckUtils]: 18: Hoare triple {533#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {529#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-07 12:38:30,178 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {494#(not (= |__VERIFIER_assert_#in~cond| 0))} {439#true} #70#return; {533#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-07 12:38:30,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {494#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {494#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:38:30,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {546#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {494#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:38:30,179 INFO L290 TraceCheckUtils]: 14: Hoare triple {439#true} ~cond := #in~cond; {546#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 12:38:30,179 INFO L272 TraceCheckUtils]: 13: Hoare triple {439#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {439#true} is VALID [2022-04-07 12:38:30,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {439#true} assume !false; {439#true} is VALID [2022-04-07 12:38:30,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {439#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {439#true} is VALID [2022-04-07 12:38:30,179 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {439#true} {439#true} #68#return; {439#true} is VALID [2022-04-07 12:38:30,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {439#true} assume true; {439#true} is VALID [2022-04-07 12:38:30,180 INFO L290 TraceCheckUtils]: 8: Hoare triple {439#true} assume !(0 == ~cond); {439#true} is VALID [2022-04-07 12:38:30,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {439#true} ~cond := #in~cond; {439#true} is VALID [2022-04-07 12:38:30,180 INFO L272 TraceCheckUtils]: 6: Hoare triple {439#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {439#true} is VALID [2022-04-07 12:38:30,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {439#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~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; {439#true} is VALID [2022-04-07 12:38:30,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {439#true} call #t~ret6 := main(); {439#true} is VALID [2022-04-07 12:38:30,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {439#true} {439#true} #76#return; {439#true} is VALID [2022-04-07 12:38:30,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {439#true} assume true; {439#true} is VALID [2022-04-07 12:38:30,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {439#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(13, 2);call #Ultimate.allocInit(12, 3); {439#true} is VALID [2022-04-07 12:38:30,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {439#true} call ULTIMATE.init(); {439#true} is VALID [2022-04-07 12:38:30,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:38:30,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:38:30,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913178296] [2022-04-07 12:38:30,181 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:38:30,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076885296] [2022-04-07 12:38:30,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076885296] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:38:30,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:38:30,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2022-04-07 12:38:30,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491471785] [2022-04-07 12:38:30,182 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:38:30,182 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 23 [2022-04-07 12:38:30,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:38:30,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 12:38:32,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 34 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:38:32,208 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-07 12:38:32,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:38:32,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-07 12:38:32,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-07 12:38:32,209 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 15 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 12:38:34,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:38:34,245 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-04-07 12:38:34,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-07 12:38:34,245 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 23 [2022-04-07 12:38:34,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:38:34,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 12:38:34,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2022-04-07 12:38:34,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 12:38:34,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2022-04-07 12:38:34,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 56 transitions. [2022-04-07 12:38:36,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 55 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 12:38:36,296 INFO L225 Difference]: With dead ends: 48 [2022-04-07 12:38:36,296 INFO L226 Difference]: Without dead ends: 46 [2022-04-07 12:38:36,296 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-04-07 12:38:36,297 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 28 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:38:36,297 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 143 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-07 12:38:36,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-07 12:38:36,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2022-04-07 12:38:36,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:38:36,308 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 36 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 12:38:36,309 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 36 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 12:38:36,309 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 36 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 12:38:36,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:38:36,311 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-04-07 12:38:36,311 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-04-07 12:38:36,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:38:36,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:38:36,311 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 46 states. [2022-04-07 12:38:36,312 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 46 states. [2022-04-07 12:38:36,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:38:36,313 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-04-07 12:38:36,313 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-04-07 12:38:36,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:38:36,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:38:36,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:38:36,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:38:36,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 12:38:36,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-04-07 12:38:36,315 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 23 [2022-04-07 12:38:36,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:38:36,315 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-04-07 12:38:36,316 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 12:38:36,316 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-07 12:38:36,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-07 12:38:36,316 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:38:36,316 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:38:36,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 12:38:36,516 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-07 12:38:36,517 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:38:36,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:38:36,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1855333828, now seen corresponding path program 1 times [2022-04-07 12:38:36,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:38:36,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382352795] [2022-04-07 12:38:36,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:38:36,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:38:36,529 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:38:36,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [28760681] [2022-04-07 12:38:36,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:38:36,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:38:36,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:38:36,539 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:38:36,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 12:38:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:38:36,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-07 12:38:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:38:36,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:38:42,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {814#true} call ULTIMATE.init(); {814#true} is VALID [2022-04-07 12:38:42,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {814#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(13, 2);call #Ultimate.allocInit(12, 3); {814#true} is VALID [2022-04-07 12:38:42,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {814#true} assume true; {814#true} is VALID [2022-04-07 12:38:42,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {814#true} {814#true} #76#return; {814#true} is VALID [2022-04-07 12:38:42,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {814#true} call #t~ret6 := main(); {814#true} is VALID [2022-04-07 12:38:42,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {814#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~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; {814#true} is VALID [2022-04-07 12:38:42,643 INFO L272 TraceCheckUtils]: 6: Hoare triple {814#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {814#true} is VALID [2022-04-07 12:38:42,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {814#true} ~cond := #in~cond; {840#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 12:38:42,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {840#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {844#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 12:38:42,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {844#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {844#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 12:38:42,644 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {844#(not (= |assume_abort_if_not_#in~cond| 0))} {814#true} #68#return; {851#(<= 1 main_~y~0)} is VALID [2022-04-07 12:38:42,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {851#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {855#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 12:38:42,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {855#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {855#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 12:38:42,645 INFO L272 TraceCheckUtils]: 13: Hoare triple {855#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {814#true} is VALID [2022-04-07 12:38:42,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {814#true} ~cond := #in~cond; {865#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:38:42,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {865#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {869#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:38:42,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {869#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {869#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:38:42,649 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {869#(not (= |__VERIFIER_assert_#in~cond| 0))} {855#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #70#return; {855#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 12:38:42,649 INFO L290 TraceCheckUtils]: 18: Hoare triple {855#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {855#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 12:38:42,650 INFO L290 TraceCheckUtils]: 19: Hoare triple {855#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {882#(and (= (div main_~y~0 2) main_~b~0) (<= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (<= 1 main_~y~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 12:38:42,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {882#(and (= (div main_~y~0 2) main_~b~0) (<= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (<= 1 main_~y~0) (= (mod main_~x~0 2) 0))} assume !false; {882#(and (= (div main_~y~0 2) main_~b~0) (<= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (<= 1 main_~y~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-07 12:38:42,653 INFO L272 TraceCheckUtils]: 21: Hoare triple {882#(and (= (div main_~y~0 2) main_~b~0) (<= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (<= 1 main_~y~0) (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {889#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:38:42,654 INFO L290 TraceCheckUtils]: 22: Hoare triple {889#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {893#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:38:42,654 INFO L290 TraceCheckUtils]: 23: Hoare triple {893#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {815#false} is VALID [2022-04-07 12:38:42,654 INFO L290 TraceCheckUtils]: 24: Hoare triple {815#false} assume !false; {815#false} is VALID [2022-04-07 12:38:42,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:38:42,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:39:49,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {815#false} assume !false; {815#false} is VALID [2022-04-07 12:39:49,168 INFO L290 TraceCheckUtils]: 23: Hoare triple {893#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {815#false} is VALID [2022-04-07 12:39:49,168 INFO L290 TraceCheckUtils]: 22: Hoare triple {889#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {893#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:39:49,169 INFO L272 TraceCheckUtils]: 21: Hoare triple {909#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {889#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:39:49,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {909#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !false; {909#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-07 12:39:49,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {916#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {909#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-07 12:39:49,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {916#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} assume !!(0 != ~a~0 && 0 != ~b~0); {916#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} is VALID [2022-04-07 12:39:49,181 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {869#(not (= |__VERIFIER_assert_#in~cond| 0))} {923#(or (not (= (mod main_~a~0 2) 0)) (= (mod main_~b~0 2) 0) (not (< main_~b~0 0)) (not (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))} #70#return; {916#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} is VALID [2022-04-07 12:39:49,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {869#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {869#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:39:49,182 INFO L290 TraceCheckUtils]: 15: Hoare triple {933#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {869#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 12:39:49,182 INFO L290 TraceCheckUtils]: 14: Hoare triple {814#true} ~cond := #in~cond; {933#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 12:39:49,182 INFO L272 TraceCheckUtils]: 13: Hoare triple {923#(or (not (= (mod main_~a~0 2) 0)) (= (mod main_~b~0 2) 0) (not (< main_~b~0 0)) (not (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {814#true} is VALID [2022-04-07 12:39:49,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {923#(or (not (= (mod main_~a~0 2) 0)) (= (mod main_~b~0 2) 0) (not (< main_~b~0 0)) (not (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))} assume !false; {923#(or (not (= (mod main_~a~0 2) 0)) (= (mod main_~b~0 2) 0) (not (< main_~b~0 0)) (not (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))} is VALID [2022-04-07 12:39:49,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {943#(or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (* (div main_~x~0 2) (+ (div main_~y~0 2) 1) 4) (* main_~y~0 main_~x~0)) (not (= (mod main_~x~0 2) 0)))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {923#(or (not (= (mod main_~a~0 2) 0)) (= (mod main_~b~0 2) 0) (not (< main_~b~0 0)) (not (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))} is VALID [2022-04-07 12:39:49,184 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {844#(not (= |assume_abort_if_not_#in~cond| 0))} {814#true} #68#return; {943#(or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (* (div main_~x~0 2) (+ (div main_~y~0 2) 1) 4) (* main_~y~0 main_~x~0)) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-07 12:39:49,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {844#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {844#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 12:39:49,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {956#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {844#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 12:39:49,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {814#true} ~cond := #in~cond; {956#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-07 12:39:49,185 INFO L272 TraceCheckUtils]: 6: Hoare triple {814#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {814#true} is VALID [2022-04-07 12:39:49,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {814#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~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; {814#true} is VALID [2022-04-07 12:39:49,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {814#true} call #t~ret6 := main(); {814#true} is VALID [2022-04-07 12:39:49,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {814#true} {814#true} #76#return; {814#true} is VALID [2022-04-07 12:39:49,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {814#true} assume true; {814#true} is VALID [2022-04-07 12:39:49,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {814#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(13, 2);call #Ultimate.allocInit(12, 3); {814#true} is VALID [2022-04-07 12:39:49,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {814#true} call ULTIMATE.init(); {814#true} is VALID [2022-04-07 12:39:49,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 12:39:49,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:39:49,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382352795] [2022-04-07 12:39:49,187 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:39:49,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28760681] [2022-04-07 12:39:49,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28760681] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 12:39:49,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 12:39:49,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 17 [2022-04-07 12:39:49,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018724886] [2022-04-07 12:39:49,187 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 12:39:49,187 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 14 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 25 [2022-04-07 12:39:49,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:39:49,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 14 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 12:39:49,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:39:49,227 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-07 12:39:49,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:39:49,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-07 12:39:49,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-07 12:39:49,228 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 14 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 12:39:51,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:39:51,972 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2022-04-07 12:39:51,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 12:39:51,972 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 14 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 25 [2022-04-07 12:39:51,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:39:51,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 14 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 12:39:51,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 75 transitions. [2022-04-07 12:39:51,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 14 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 12:39:51,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 75 transitions. [2022-04-07 12:39:51,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 75 transitions. [2022-04-07 12:39:52,143 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-07 12:39:52,144 INFO L225 Difference]: With dead ends: 62 [2022-04-07 12:39:52,145 INFO L226 Difference]: Without dead ends: 58 [2022-04-07 12:39:52,145 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2022-04-07 12:39:52,146 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 63 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-07 12:39:52,146 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 126 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-07 12:39:52,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-07 12:39:52,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 32. [2022-04-07 12:39:52,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:39:52,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 32 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 12:39:52,163 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 32 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 12:39:52,163 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 32 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 12:39:52,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:39:52,165 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2022-04-07 12:39:52,165 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2022-04-07 12:39:52,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:39:52,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:39:52,165 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 58 states. [2022-04-07 12:39:52,166 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 58 states. [2022-04-07 12:39:52,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:39:52,167 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2022-04-07 12:39:52,167 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2022-04-07 12:39:52,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:39:52,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:39:52,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:39:52,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:39:52,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-07 12:39:52,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-07 12:39:52,169 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 25 [2022-04-07 12:39:52,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:39:52,169 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-07 12:39:52,169 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 14 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 12:39:52,169 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-07 12:39:52,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-07 12:39:52,169 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:39:52,170 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:39:52,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-07 12:39:52,383 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:39:52,383 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:39:52,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:39:52,384 INFO L85 PathProgramCache]: Analyzing trace with hash 642754736, now seen corresponding path program 1 times [2022-04-07 12:39:52,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:39:52,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110743605] [2022-04-07 12:39:52,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:39:52,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:39:52,409 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:39:52,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [105000608] [2022-04-07 12:39:52,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:39:52,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:39:52,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:39:52,410 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 12:39:52,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-07 12:39:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:39:52,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-07 12:39:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:39:52,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:39:52,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {1237#true} call ULTIMATE.init(); {1237#true} is VALID [2022-04-07 12:39:52,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {1237#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(13, 2);call #Ultimate.allocInit(12, 3); {1237#true} is VALID [2022-04-07 12:39:52,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {1237#true} assume true; {1237#true} is VALID [2022-04-07 12:39:52,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1237#true} {1237#true} #76#return; {1237#true} is VALID [2022-04-07 12:39:52,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {1237#true} call #t~ret6 := main(); {1237#true} is VALID [2022-04-07 12:39:52,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {1237#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~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; {1237#true} is VALID [2022-04-07 12:39:52,565 INFO L272 TraceCheckUtils]: 6: Hoare triple {1237#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1237#true} is VALID [2022-04-07 12:39:52,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {1237#true} ~cond := #in~cond; {1263#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 12:39:52,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {1263#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1267#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 12:39:52,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {1267#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1267#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 12:39:52,566 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1267#(not (= |assume_abort_if_not_#in~cond| 0))} {1237#true} #68#return; {1274#(<= 1 main_~y~0)} is VALID [2022-04-07 12:39:52,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {1274#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1278#(<= 1 main_~b~0)} is VALID [2022-04-07 12:39:52,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {1278#(<= 1 main_~b~0)} assume !false; {1278#(<= 1 main_~b~0)} is VALID [2022-04-07 12:39:52,574 INFO L272 TraceCheckUtils]: 13: Hoare triple {1278#(<= 1 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1237#true} is VALID [2022-04-07 12:39:52,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {1237#true} ~cond := #in~cond; {1237#true} is VALID [2022-04-07 12:39:52,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {1237#true} assume !(0 == ~cond); {1237#true} is VALID [2022-04-07 12:39:52,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {1237#true} assume true; {1237#true} is VALID [2022-04-07 12:39:52,575 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1237#true} {1278#(<= 1 main_~b~0)} #70#return; {1278#(<= 1 main_~b~0)} is VALID [2022-04-07 12:39:52,575 INFO L290 TraceCheckUtils]: 18: Hoare triple {1278#(<= 1 main_~b~0)} assume !(0 != ~a~0 && 0 != ~b~0); {1300#(and (= main_~a~0 0) (<= 1 main_~b~0))} is VALID [2022-04-07 12:39:52,575 INFO L272 TraceCheckUtils]: 19: Hoare triple {1300#(and (= main_~a~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1237#true} is VALID [2022-04-07 12:39:52,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {1237#true} ~cond := #in~cond; {1237#true} is VALID [2022-04-07 12:39:52,576 INFO L290 TraceCheckUtils]: 21: Hoare triple {1237#true} assume !(0 == ~cond); {1237#true} is VALID [2022-04-07 12:39:52,576 INFO L290 TraceCheckUtils]: 22: Hoare triple {1237#true} assume true; {1237#true} is VALID [2022-04-07 12:39:52,576 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1237#true} {1300#(and (= main_~a~0 0) (<= 1 main_~b~0))} #72#return; {1300#(and (= main_~a~0 0) (<= 1 main_~b~0))} is VALID [2022-04-07 12:39:52,577 INFO L272 TraceCheckUtils]: 24: Hoare triple {1300#(and (= main_~a~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {1319#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:39:52,577 INFO L290 TraceCheckUtils]: 25: Hoare triple {1319#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1323#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:39:52,577 INFO L290 TraceCheckUtils]: 26: Hoare triple {1323#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1238#false} is VALID [2022-04-07 12:39:52,578 INFO L290 TraceCheckUtils]: 27: Hoare triple {1238#false} assume !false; {1238#false} is VALID [2022-04-07 12:39:52,578 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 12:39:52,578 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 12:39:52,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:39:52,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110743605] [2022-04-07 12:39:52,578 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:39:52,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105000608] [2022-04-07 12:39:52,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105000608] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:39:52,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:39:52,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-07 12:39:52,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270364046] [2022-04-07 12:39:52,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:39:52,579 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-04-07 12:39:52,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:39:52,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 12:39:52,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:39:52,595 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 12:39:52,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:39:52,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 12:39:52,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-04-07 12:39:52,596 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 12:39:52,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:39:52,866 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-07 12:39:52,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 12:39:52,867 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-04-07 12:39:52,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:39:52,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 12:39:52,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2022-04-07 12:39:52,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 12:39:52,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2022-04-07 12:39:52,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 48 transitions. [2022-04-07 12:39:52,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:39:52,906 INFO L225 Difference]: With dead ends: 44 [2022-04-07 12:39:52,906 INFO L226 Difference]: Without dead ends: 38 [2022-04-07 12:39:52,906 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-04-07 12:39:52,907 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 24 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:39:52,907 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 117 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 12:39:52,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-07 12:39:52,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-07 12:39:52,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:39:52,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 37 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 12:39:52,931 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 37 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 12:39:52,932 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 37 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 12:39:52,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:39:52,935 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-07 12:39:52,935 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-07 12:39:52,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:39:52,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:39:52,937 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 38 states. [2022-04-07 12:39:52,937 INFO L87 Difference]: Start difference. First operand has 37 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 38 states. [2022-04-07 12:39:52,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:39:52,939 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-07 12:39:52,939 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-07 12:39:52,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:39:52,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:39:52,940 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:39:52,940 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:39:52,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 12:39:52,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2022-04-07 12:39:52,942 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 28 [2022-04-07 12:39:52,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:39:52,942 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-04-07 12:39:52,942 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 12:39:52,942 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-07 12:39:52,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-07 12:39:52,943 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:39:52,943 INFO L499 BasicCegarLoop]: 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] [2022-04-07 12:39:52,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-07 12:39:53,157 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:39:53,157 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:39:53,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:39:53,157 INFO L85 PathProgramCache]: Analyzing trace with hash 694423764, now seen corresponding path program 1 times [2022-04-07 12:39:53,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:39:53,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605104239] [2022-04-07 12:39:53,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:39:53,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:39:53,168 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:39:53,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [778010967] [2022-04-07 12:39:53,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:39:53,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:39:53,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:39:53,172 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-07 12:39:53,173 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-07 12:39:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:39:53,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 12:39:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:39:53,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:39:53,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {1527#true} call ULTIMATE.init(); {1527#true} is VALID [2022-04-07 12:39:53,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {1527#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(13, 2);call #Ultimate.allocInit(12, 3); {1527#true} is VALID [2022-04-07 12:39:53,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {1527#true} assume true; {1527#true} is VALID [2022-04-07 12:39:53,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1527#true} {1527#true} #76#return; {1527#true} is VALID [2022-04-07 12:39:53,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {1527#true} call #t~ret6 := main(); {1527#true} is VALID [2022-04-07 12:39:53,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {1527#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~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; {1527#true} is VALID [2022-04-07 12:39:53,321 INFO L272 TraceCheckUtils]: 6: Hoare triple {1527#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1527#true} is VALID [2022-04-07 12:39:53,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {1527#true} ~cond := #in~cond; {1527#true} is VALID [2022-04-07 12:39:53,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {1527#true} assume !(0 == ~cond); {1527#true} is VALID [2022-04-07 12:39:53,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {1527#true} assume true; {1527#true} is VALID [2022-04-07 12:39:53,321 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1527#true} {1527#true} #68#return; {1527#true} is VALID [2022-04-07 12:39:53,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {1527#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1527#true} is VALID [2022-04-07 12:39:53,321 INFO L290 TraceCheckUtils]: 12: Hoare triple {1527#true} assume !false; {1527#true} is VALID [2022-04-07 12:39:53,321 INFO L272 TraceCheckUtils]: 13: Hoare triple {1527#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1527#true} is VALID [2022-04-07 12:39:53,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {1527#true} ~cond := #in~cond; {1527#true} is VALID [2022-04-07 12:39:53,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {1527#true} assume !(0 == ~cond); {1527#true} is VALID [2022-04-07 12:39:53,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {1527#true} assume true; {1527#true} is VALID [2022-04-07 12:39:53,321 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1527#true} {1527#true} #70#return; {1527#true} is VALID [2022-04-07 12:39:53,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {1527#true} assume !!(0 != ~a~0 && 0 != ~b~0); {1586#(not (= main_~a~0 0))} is VALID [2022-04-07 12:39:53,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {1586#(not (= main_~a~0 0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1586#(not (= main_~a~0 0))} is VALID [2022-04-07 12:39:53,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {1586#(not (= main_~a~0 0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1586#(not (= main_~a~0 0))} is VALID [2022-04-07 12:39:53,329 INFO L290 TraceCheckUtils]: 21: Hoare triple {1586#(not (= main_~a~0 0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {1586#(not (= main_~a~0 0))} is VALID [2022-04-07 12:39:53,330 INFO L290 TraceCheckUtils]: 22: Hoare triple {1586#(not (= main_~a~0 0))} assume !false; {1586#(not (= main_~a~0 0))} is VALID [2022-04-07 12:39:53,330 INFO L272 TraceCheckUtils]: 23: Hoare triple {1586#(not (= main_~a~0 0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1527#true} is VALID [2022-04-07 12:39:53,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {1527#true} ~cond := #in~cond; {1527#true} is VALID [2022-04-07 12:39:53,330 INFO L290 TraceCheckUtils]: 25: Hoare triple {1527#true} assume !(0 == ~cond); {1527#true} is VALID [2022-04-07 12:39:53,330 INFO L290 TraceCheckUtils]: 26: Hoare triple {1527#true} assume true; {1527#true} is VALID [2022-04-07 12:39:53,331 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1527#true} {1586#(not (= main_~a~0 0))} #70#return; {1586#(not (= main_~a~0 0))} is VALID [2022-04-07 12:39:53,339 INFO L290 TraceCheckUtils]: 28: Hoare triple {1586#(not (= main_~a~0 0))} assume !(0 != ~a~0 && 0 != ~b~0); {1617#(and (= main_~b~0 0) (not (= main_~a~0 0)))} is VALID [2022-04-07 12:39:53,339 INFO L272 TraceCheckUtils]: 29: Hoare triple {1617#(and (= main_~b~0 0) (not (= main_~a~0 0)))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1527#true} is VALID [2022-04-07 12:39:53,339 INFO L290 TraceCheckUtils]: 30: Hoare triple {1527#true} ~cond := #in~cond; {1527#true} is VALID [2022-04-07 12:39:53,339 INFO L290 TraceCheckUtils]: 31: Hoare triple {1527#true} assume !(0 == ~cond); {1527#true} is VALID [2022-04-07 12:39:53,339 INFO L290 TraceCheckUtils]: 32: Hoare triple {1527#true} assume true; {1527#true} is VALID [2022-04-07 12:39:53,340 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1527#true} {1617#(and (= main_~b~0 0) (not (= main_~a~0 0)))} #72#return; {1617#(and (= main_~b~0 0) (not (= main_~a~0 0)))} is VALID [2022-04-07 12:39:53,343 INFO L272 TraceCheckUtils]: 34: Hoare triple {1617#(and (= main_~b~0 0) (not (= main_~a~0 0)))} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {1636#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:39:53,343 INFO L290 TraceCheckUtils]: 35: Hoare triple {1636#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1640#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:39:53,344 INFO L290 TraceCheckUtils]: 36: Hoare triple {1640#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1528#false} is VALID [2022-04-07 12:39:53,344 INFO L290 TraceCheckUtils]: 37: Hoare triple {1528#false} assume !false; {1528#false} is VALID [2022-04-07 12:39:53,344 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 12:39:53,344 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 12:39:53,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:39:53,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605104239] [2022-04-07 12:39:53,344 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:39:53,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778010967] [2022-04-07 12:39:53,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778010967] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 12:39:53,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 12:39:53,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 12:39:53,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66625024] [2022-04-07 12:39:53,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:39:53,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2022-04-07 12:39:53,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:39:53,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 12:39:53,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:39:53,373 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 12:39:53,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:39:53,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 12:39:53,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-07 12:39:53,373 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 12:39:53,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:39:53,535 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2022-04-07 12:39:53,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 12:39:53,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2022-04-07 12:39:53,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:39:53,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 12:39:53,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-07 12:39:53,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 12:39:53,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-07 12:39:53,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-04-07 12:39:53,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:39:53,566 INFO L225 Difference]: With dead ends: 49 [2022-04-07 12:39:53,566 INFO L226 Difference]: Without dead ends: 43 [2022-04-07 12:39:53,566 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-07 12:39:53,567 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 12:39:53,567 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 96 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 12:39:53,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-07 12:39:53,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-04-07 12:39:53,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:39:53,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 40 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 12:39:53,588 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 40 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 12:39:53,588 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 40 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 12:39:53,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:39:53,589 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-04-07 12:39:53,589 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-07 12:39:53,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:39:53,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:39:53,589 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 43 states. [2022-04-07 12:39:53,589 INFO L87 Difference]: Start difference. First operand has 40 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 43 states. [2022-04-07 12:39:53,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:39:53,590 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-04-07 12:39:53,591 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-04-07 12:39:53,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:39:53,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:39:53,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:39:53,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:39:53,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 12:39:53,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-04-07 12:39:53,592 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 38 [2022-04-07 12:39:53,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:39:53,592 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-04-07 12:39:53,592 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 12:39:53,592 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-07 12:39:53,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-07 12:39:53,593 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 12:39:53,593 INFO L499 BasicCegarLoop]: 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] [2022-04-07 12:39:53,609 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-07 12:39:53,806 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:39:53,806 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 12:39:53,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 12:39:53,806 INFO L85 PathProgramCache]: Analyzing trace with hash -893924138, now seen corresponding path program 1 times [2022-04-07 12:39:53,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 12:39:53,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201901160] [2022-04-07 12:39:53,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:39:53,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 12:39:53,815 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 12:39:53,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [590279605] [2022-04-07 12:39:53,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 12:39:53,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:39:53,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 12:39:53,816 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-07 12:39:53,817 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-07 12:39:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:39:53,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-07 12:39:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 12:39:53,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 12:39:54,118 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-07 12:39:54,164 INFO L272 TraceCheckUtils]: 0: Hoare triple {1862#true} call ULTIMATE.init(); {1862#true} is VALID [2022-04-07 12:39:54,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {1862#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(13, 2);call #Ultimate.allocInit(12, 3); {1862#true} is VALID [2022-04-07 12:39:54,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {1862#true} assume true; {1862#true} is VALID [2022-04-07 12:39:54,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1862#true} {1862#true} #76#return; {1862#true} is VALID [2022-04-07 12:39:54,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {1862#true} call #t~ret6 := main(); {1862#true} is VALID [2022-04-07 12:39:54,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {1862#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~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; {1862#true} is VALID [2022-04-07 12:39:54,165 INFO L272 TraceCheckUtils]: 6: Hoare triple {1862#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1862#true} is VALID [2022-04-07 12:39:54,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {1862#true} ~cond := #in~cond; {1888#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 12:39:54,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {1888#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1892#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 12:39:54,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {1892#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1892#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 12:39:54,166 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1892#(not (= |assume_abort_if_not_#in~cond| 0))} {1862#true} #68#return; {1899#(<= 1 main_~y~0)} is VALID [2022-04-07 12:39:54,167 INFO L290 TraceCheckUtils]: 11: Hoare triple {1899#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1903#(<= 1 main_~b~0)} is VALID [2022-04-07 12:39:54,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {1903#(<= 1 main_~b~0)} assume !false; {1903#(<= 1 main_~b~0)} is VALID [2022-04-07 12:39:54,167 INFO L272 TraceCheckUtils]: 13: Hoare triple {1903#(<= 1 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1862#true} is VALID [2022-04-07 12:39:54,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {1862#true} ~cond := #in~cond; {1862#true} is VALID [2022-04-07 12:39:54,168 INFO L290 TraceCheckUtils]: 15: Hoare triple {1862#true} assume !(0 == ~cond); {1862#true} is VALID [2022-04-07 12:39:54,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {1862#true} assume true; {1862#true} is VALID [2022-04-07 12:39:54,168 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1862#true} {1903#(<= 1 main_~b~0)} #70#return; {1903#(<= 1 main_~b~0)} is VALID [2022-04-07 12:39:54,169 INFO L290 TraceCheckUtils]: 18: Hoare triple {1903#(<= 1 main_~b~0)} assume !!(0 != ~a~0 && 0 != ~b~0); {1903#(<= 1 main_~b~0)} is VALID [2022-04-07 12:39:54,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {1903#(<= 1 main_~b~0)} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1903#(<= 1 main_~b~0)} is VALID [2022-04-07 12:39:54,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {1903#(<= 1 main_~b~0)} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1903#(<= 1 main_~b~0)} is VALID [2022-04-07 12:39:54,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {1903#(<= 1 main_~b~0)} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {1934#(<= 0 main_~b~0)} is VALID [2022-04-07 12:39:54,170 INFO L290 TraceCheckUtils]: 22: Hoare triple {1934#(<= 0 main_~b~0)} assume !false; {1934#(<= 0 main_~b~0)} is VALID [2022-04-07 12:39:54,170 INFO L272 TraceCheckUtils]: 23: Hoare triple {1934#(<= 0 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1862#true} is VALID [2022-04-07 12:39:54,170 INFO L290 TraceCheckUtils]: 24: Hoare triple {1862#true} ~cond := #in~cond; {1862#true} is VALID [2022-04-07 12:39:54,170 INFO L290 TraceCheckUtils]: 25: Hoare triple {1862#true} assume !(0 == ~cond); {1862#true} is VALID [2022-04-07 12:39:54,170 INFO L290 TraceCheckUtils]: 26: Hoare triple {1862#true} assume true; {1862#true} is VALID [2022-04-07 12:39:54,171 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1862#true} {1934#(<= 0 main_~b~0)} #70#return; {1934#(<= 0 main_~b~0)} is VALID [2022-04-07 12:39:54,172 INFO L290 TraceCheckUtils]: 28: Hoare triple {1934#(<= 0 main_~b~0)} assume !(0 != ~a~0 && 0 != ~b~0); {1956#(and (or (= main_~a~0 0) (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-07 12:39:54,172 INFO L272 TraceCheckUtils]: 29: Hoare triple {1956#(and (or (= main_~a~0 0) (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1862#true} is VALID [2022-04-07 12:39:54,172 INFO L290 TraceCheckUtils]: 30: Hoare triple {1862#true} ~cond := #in~cond; {1862#true} is VALID [2022-04-07 12:39:54,172 INFO L290 TraceCheckUtils]: 31: Hoare triple {1862#true} assume !(0 == ~cond); {1862#true} is VALID [2022-04-07 12:39:54,172 INFO L290 TraceCheckUtils]: 32: Hoare triple {1862#true} assume true; {1862#true} is VALID [2022-04-07 12:39:54,173 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1862#true} {1956#(and (or (= main_~a~0 0) (= main_~b~0 0)) (<= 0 main_~b~0))} #72#return; {1956#(and (or (= main_~a~0 0) (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-07 12:39:54,174 INFO L272 TraceCheckUtils]: 34: Hoare triple {1956#(and (or (= main_~a~0 0) (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {1975#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:39:54,175 INFO L290 TraceCheckUtils]: 35: Hoare triple {1975#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1979#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:39:54,175 INFO L290 TraceCheckUtils]: 36: Hoare triple {1979#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1863#false} is VALID [2022-04-07 12:39:54,175 INFO L290 TraceCheckUtils]: 37: Hoare triple {1863#false} assume !false; {1863#false} is VALID [2022-04-07 12:39:54,175 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 12:39:54,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 12:39:54,375 INFO L290 TraceCheckUtils]: 37: Hoare triple {1863#false} assume !false; {1863#false} is VALID [2022-04-07 12:39:54,376 INFO L290 TraceCheckUtils]: 36: Hoare triple {1979#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1863#false} is VALID [2022-04-07 12:39:54,376 INFO L290 TraceCheckUtils]: 35: Hoare triple {1975#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1979#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 12:39:54,377 INFO L272 TraceCheckUtils]: 34: Hoare triple {1995#(= (* main_~b~0 main_~a~0) 0)} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {1975#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 12:39:54,378 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1862#true} {1995#(= (* main_~b~0 main_~a~0) 0)} #72#return; {1995#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-07 12:39:54,378 INFO L290 TraceCheckUtils]: 32: Hoare triple {1862#true} assume true; {1862#true} is VALID [2022-04-07 12:39:54,378 INFO L290 TraceCheckUtils]: 31: Hoare triple {1862#true} assume !(0 == ~cond); {1862#true} is VALID [2022-04-07 12:39:54,378 INFO L290 TraceCheckUtils]: 30: Hoare triple {1862#true} ~cond := #in~cond; {1862#true} is VALID [2022-04-07 12:39:54,378 INFO L272 TraceCheckUtils]: 29: Hoare triple {1995#(= (* main_~b~0 main_~a~0) 0)} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1862#true} is VALID [2022-04-07 12:39:54,380 INFO L290 TraceCheckUtils]: 28: Hoare triple {1862#true} assume !(0 != ~a~0 && 0 != ~b~0); {1995#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-07 12:39:54,380 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1862#true} {1862#true} #70#return; {1862#true} is VALID [2022-04-07 12:39:54,380 INFO L290 TraceCheckUtils]: 26: Hoare triple {1862#true} assume true; {1862#true} is VALID [2022-04-07 12:39:54,380 INFO L290 TraceCheckUtils]: 25: Hoare triple {1862#true} assume !(0 == ~cond); {1862#true} is VALID [2022-04-07 12:39:54,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {1862#true} ~cond := #in~cond; {1862#true} is VALID [2022-04-07 12:39:54,380 INFO L272 TraceCheckUtils]: 23: Hoare triple {1862#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1862#true} is VALID [2022-04-07 12:39:54,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {1862#true} assume !false; {1862#true} is VALID [2022-04-07 12:39:54,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {1862#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {1862#true} is VALID [2022-04-07 12:39:54,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {1862#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1862#true} is VALID [2022-04-07 12:39:54,380 INFO L290 TraceCheckUtils]: 19: Hoare triple {1862#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1862#true} is VALID [2022-04-07 12:39:54,380 INFO L290 TraceCheckUtils]: 18: Hoare triple {1862#true} assume !!(0 != ~a~0 && 0 != ~b~0); {1862#true} is VALID [2022-04-07 12:39:54,381 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1862#true} {1862#true} #70#return; {1862#true} is VALID [2022-04-07 12:39:54,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {1862#true} assume true; {1862#true} is VALID [2022-04-07 12:39:54,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {1862#true} assume !(0 == ~cond); {1862#true} is VALID [2022-04-07 12:39:54,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {1862#true} ~cond := #in~cond; {1862#true} is VALID [2022-04-07 12:39:54,381 INFO L272 TraceCheckUtils]: 13: Hoare triple {1862#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1862#true} is VALID [2022-04-07 12:39:54,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {1862#true} assume !false; {1862#true} is VALID [2022-04-07 12:39:54,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {1862#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1862#true} is VALID [2022-04-07 12:39:54,381 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1862#true} {1862#true} #68#return; {1862#true} is VALID [2022-04-07 12:39:54,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {1862#true} assume true; {1862#true} is VALID [2022-04-07 12:39:54,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {1862#true} assume !(0 == ~cond); {1862#true} is VALID [2022-04-07 12:39:54,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {1862#true} ~cond := #in~cond; {1862#true} is VALID [2022-04-07 12:39:54,381 INFO L272 TraceCheckUtils]: 6: Hoare triple {1862#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1862#true} is VALID [2022-04-07 12:39:54,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {1862#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~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; {1862#true} is VALID [2022-04-07 12:39:54,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {1862#true} call #t~ret6 := main(); {1862#true} is VALID [2022-04-07 12:39:54,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1862#true} {1862#true} #76#return; {1862#true} is VALID [2022-04-07 12:39:54,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {1862#true} assume true; {1862#true} is VALID [2022-04-07 12:39:54,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {1862#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(13, 2);call #Ultimate.allocInit(12, 3); {1862#true} is VALID [2022-04-07 12:39:54,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {1862#true} call ULTIMATE.init(); {1862#true} is VALID [2022-04-07 12:39:54,382 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-07 12:39:54,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 12:39:54,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201901160] [2022-04-07 12:39:54,382 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 12:39:54,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590279605] [2022-04-07 12:39:54,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590279605] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 12:39:54,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 12:39:54,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-04-07 12:39:54,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063783552] [2022-04-07 12:39:54,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 12:39:54,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2022-04-07 12:39:54,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 12:39:54,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 12:39:54,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:39:54,404 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 12:39:54,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 12:39:54,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 12:39:54,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-07 12:39:54,404 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 12:39:54,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:39:54,684 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-07 12:39:54,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 12:39:54,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2022-04-07 12:39:54,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 12:39:54,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 12:39:54,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-07 12:39:54,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 12:39:54,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-07 12:39:54,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-07 12:39:54,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 12:39:54,715 INFO L225 Difference]: With dead ends: 40 [2022-04-07 12:39:54,716 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 12:39:54,716 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-04-07 12:39:54,716 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 12:39:54,717 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 96 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 12:39:54,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 12:39:54,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 12:39:54,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 12:39:54,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 12:39:54,717 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 12:39:54,717 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 12:39:54,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:39:54,717 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 12:39:54,717 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 12:39:54,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:39:54,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:39:54,718 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 12:39:54,718 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 12:39:54,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 12:39:54,718 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 12:39:54,718 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 12:39:54,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:39:54,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 12:39:54,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 12:39:54,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 12:39:54,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 12:39:54,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 12:39:54,718 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2022-04-07 12:39:54,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 12:39:54,718 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 12:39:54,718 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 12:39:54,718 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 12:39:54,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 12:39:54,720 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 12:39:54,737 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-07 12:39:54,931 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 12:39:54,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 12:39:59,508 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-07 12:39:59,508 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-07 12:39:59,508 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-07 12:39:59,508 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-07 12:39:59,508 INFO L882 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-04-07 12:39:59,508 INFO L882 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-04-07 12:39:59,508 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-04-07 12:39:59,508 INFO L878 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: (and (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (<= 1 main_~y~0)) [2022-04-07 12:39:59,508 INFO L882 garLoopResultBuilder]: For program point L33-1(lines 32 53) no Hoare annotation was computed. [2022-04-07 12:39:59,508 INFO L885 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2022-04-07 12:39:59,508 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 19 58) no Hoare annotation was computed. [2022-04-07 12:39:59,508 INFO L882 garLoopResultBuilder]: For program point L25-1(line 25) no Hoare annotation was computed. [2022-04-07 12:39:59,509 INFO L882 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2022-04-07 12:39:59,509 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 19 58) no Hoare annotation was computed. [2022-04-07 12:39:59,509 INFO L882 garLoopResultBuilder]: For program point L42(lines 42 52) no Hoare annotation was computed. [2022-04-07 12:39:59,509 INFO L882 garLoopResultBuilder]: For program point L38(lines 38 52) no Hoare annotation was computed. [2022-04-07 12:39:59,509 INFO L878 garLoopResultBuilder]: At program point L32-2(lines 32 53) the Hoare annotation is: (and (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (<= 1 main_~y~0) (= (* main_~b~0 main_~a~0) 0)) [2022-04-07 12:39:59,509 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 19 58) the Hoare annotation is: true [2022-04-07 12:39:59,509 INFO L878 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (and (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (<= 1 main_~y~0) (= (* main_~b~0 main_~a~0) 0)) [2022-04-07 12:39:59,509 INFO L882 garLoopResultBuilder]: For program point L45(lines 45 52) no Hoare annotation was computed. [2022-04-07 12:39:59,509 INFO L878 garLoopResultBuilder]: At program point L45-2(lines 32 53) the Hoare annotation is: (and (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (<= 1 main_~y~0)) [2022-04-07 12:39:59,509 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 12:39:59,509 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-07 12:39:59,509 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 12:39:59,509 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 12:39:59,509 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 12:39:59,509 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 12:39:59,509 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 12:39:59,509 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-07 12:39:59,509 INFO L882 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-04-07 12:39:59,509 INFO L882 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-04-07 12:39:59,509 INFO L882 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-04-07 12:39:59,509 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-04-07 12:39:59,510 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-04-07 12:39:59,511 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-04-07 12:39:59,512 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 12:39:59,514 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-07 12:39:59,514 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 12:39:59,515 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-07 12:39:59,515 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-07 12:39:59,515 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-07 12:39:59,515 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 12:39:59,515 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 12:39:59,515 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-07 12:39:59,515 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-07 12:39:59,515 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-07 12:39:59,515 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-07 12:39:59,515 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-07 12:39:59,515 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 12:39:59,516 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 12:39:59,516 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-07 12:39:59,516 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-04-07 12:39:59,516 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-07 12:39:59,516 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-07 12:39:59,516 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-07 12:39:59,516 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-07 12:39:59,517 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:39:59,517 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:39:59,517 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 12:39:59,517 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-07 12:39:59,517 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-07 12:39:59,517 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-07 12:39:59,517 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-04-07 12:39:59,517 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-04-07 12:39:59,524 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-07 12:39:59,524 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-07 12:39:59,524 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 12:39:59,524 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-07 12:39:59,524 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-07 12:39:59,524 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 12:39:59,524 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-07 12:39:59,524 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-04-07 12:39:59,524 INFO L163 areAnnotationChecker]: CFG has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-07 12:39:59,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 12:39:59 BoogieIcfgContainer [2022-04-07 12:39:59,529 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 12:39:59,530 INFO L158 Benchmark]: Toolchain (without parser) took 116382.57ms. Allocated memory was 187.7MB in the beginning and 225.4MB in the end (delta: 37.7MB). Free memory was 138.0MB in the beginning and 201.9MB in the end (delta: -63.9MB). Peak memory consumption was 106.2MB. Max. memory is 8.0GB. [2022-04-07 12:39:59,530 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory is still 154.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 12:39:59,530 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.01ms. Allocated memory is still 187.7MB. Free memory was 137.8MB in the beginning and 162.5MB in the end (delta: -24.7MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. [2022-04-07 12:39:59,531 INFO L158 Benchmark]: Boogie Preprocessor took 18.30ms. Allocated memory is still 187.7MB. Free memory was 162.5MB in the beginning and 161.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 12:39:59,531 INFO L158 Benchmark]: RCFGBuilder took 280.63ms. Allocated memory is still 187.7MB. Free memory was 161.1MB in the beginning and 148.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 12:39:59,531 INFO L158 Benchmark]: TraceAbstraction took 115911.89ms. Allocated memory was 187.7MB in the beginning and 225.4MB in the end (delta: 37.7MB). Free memory was 147.8MB in the beginning and 201.9MB in the end (delta: -54.0MB). Peak memory consumption was 115.8MB. Max. memory is 8.0GB. [2022-04-07 12:39:59,532 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory is still 154.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 168.01ms. Allocated memory is still 187.7MB. Free memory was 137.8MB in the beginning and 162.5MB in the end (delta: -24.7MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.30ms. Allocated memory is still 187.7MB. Free memory was 162.5MB in the beginning and 161.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 280.63ms. Allocated memory is still 187.7MB. Free memory was 161.1MB in the beginning and 148.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 115911.89ms. Allocated memory was 187.7MB in the beginning and 225.4MB in the end (delta: 37.7MB). Free memory was 147.8MB in the beginning and 201.9MB in the end (delta: -54.0MB). Peak memory consumption was 115.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 115.8s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 162 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 148 mSDsluCounter, 688 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 518 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 786 IncrementalHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 170 mSDtfsCounter, 786 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 202 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=6, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 46 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 22 PreInvPairs, 34 NumberOfFragments, 79 HoareAnnotationTreeSize, 22 FomulaSimplifications, 56 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 11 FomulaSimplificationsInter, 2878 FormulaSimplificationTreeSizeReductionInter, 4.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 98.8s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 262 ConstructedInterpolants, 0 QuantifiedInterpolants, 974 SizeOfPredicates, 22 NumberOfNonLiveVariables, 576 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 72/83 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: q + b * a * p == y * x && 1 <= y RESULT: Ultimate proved your program to be correct! [2022-04-07 12:39:59,563 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...