/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 17:23:36,333 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 17:23:36,335 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 17:23:36,393 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 17:23:36,394 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 17:23:36,395 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 17:23:36,398 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 17:23:36,402 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 17:23:36,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 17:23:36,408 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 17:23:36,409 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 17:23:36,410 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 17:23:36,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 17:23:36,413 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 17:23:36,414 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 17:23:36,416 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 17:23:36,417 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 17:23:36,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 17:23:36,420 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 17:23:36,424 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 17:23:36,425 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 17:23:36,427 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 17:23:36,428 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 17:23:36,428 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 17:23:36,430 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 17:23:36,436 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 17:23:36,436 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 17:23:36,436 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 17:23:36,437 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 17:23:36,438 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 17:23:36,439 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 17:23:36,439 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 17:23:36,440 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 17:23:36,441 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 17:23:36,441 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 17:23:36,442 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 17:23:36,442 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 17:23:36,443 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 17:23:36,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 17:23:36,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 17:23:36,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 17:23:36,445 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 17:23:36,446 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-14 17:23:36,472 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 17:23:36,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 17:23:36,473 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 17:23:36,473 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 17:23:36,474 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 17:23:36,474 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 17:23:36,474 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 17:23:36,475 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 17:23:36,475 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 17:23:36,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 17:23:36,476 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 17:23:36,476 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 17:23:36,476 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 17:23:36,476 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 17:23:36,476 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 17:23:36,476 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 17:23:36,476 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 17:23:36,476 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 17:23:36,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 17:23:36,478 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 17:23:36,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 17:23:36,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 17:23:36,478 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 17:23:36,478 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 17:23:36,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 17:23:36,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 17:23:36,479 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 17:23:36,479 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 17:23:36,479 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 17:23:36,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 17:23:36,480 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 17:23:36,480 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 17:23:36,480 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 17:23:36,480 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-14 17:23:36,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 17:23:36,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 17:23:36,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 17:23:36,717 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 17:23:36,718 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 17:23:36,719 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound100.c [2022-04-14 17:23:36,769 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9613a2a3b/7b10833f936a47c88053f4226581144b/FLAG5b9333aeb [2022-04-14 17:23:37,197 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 17:23:37,197 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound100.c [2022-04-14 17:23:37,202 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9613a2a3b/7b10833f936a47c88053f4226581144b/FLAG5b9333aeb [2022-04-14 17:23:37,216 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9613a2a3b/7b10833f936a47c88053f4226581144b [2022-04-14 17:23:37,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 17:23:37,219 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 17:23:37,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 17:23:37,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 17:23:37,225 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 17:23:37,226 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 05:23:37" (1/1) ... [2022-04-14 17:23:37,227 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54908b01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:23:37, skipping insertion in model container [2022-04-14 17:23:37,227 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 05:23:37" (1/1) ... [2022-04-14 17:23:37,234 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 17:23:37,248 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 17:23:37,413 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound100.c[524,537] [2022-04-14 17:23:37,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 17:23:37,459 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 17:23:37,473 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound100.c[524,537] [2022-04-14 17:23:37,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 17:23:37,516 INFO L208 MainTranslator]: Completed translation [2022-04-14 17:23:37,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:23:37 WrapperNode [2022-04-14 17:23:37,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 17:23:37,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 17:23:37,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 17:23:37,518 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 17:23:37,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:23:37" (1/1) ... [2022-04-14 17:23:37,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:23:37" (1/1) ... [2022-04-14 17:23:37,542 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:23:37" (1/1) ... [2022-04-14 17:23:37,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:23:37" (1/1) ... [2022-04-14 17:23:37,555 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:23:37" (1/1) ... [2022-04-14 17:23:37,558 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:23:37" (1/1) ... [2022-04-14 17:23:37,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:23:37" (1/1) ... [2022-04-14 17:23:37,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 17:23:37,568 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 17:23:37,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 17:23:37,569 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 17:23:37,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:23:37" (1/1) ... [2022-04-14 17:23:37,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 17:23:37,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:23:37,596 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-14 17:23:37,619 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-14 17:23:37,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 17:23:37,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 17:23:37,639 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 17:23:37,640 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 17:23:37,640 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 17:23:37,640 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 17:23:37,640 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 17:23:37,641 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 17:23:37,641 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 17:23:37,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 17:23:37,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 17:23:37,641 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 17:23:37,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 17:23:37,641 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 17:23:37,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 17:23:37,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 17:23:37,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 17:23:37,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 17:23:37,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 17:23:37,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 17:23:37,700 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 17:23:37,701 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 17:23:37,907 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 17:23:37,913 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 17:23:37,913 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 17:23:37,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 05:23:37 BoogieIcfgContainer [2022-04-14 17:23:37,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 17:23:37,915 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 17:23:37,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 17:23:37,918 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 17:23:37,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 05:23:37" (1/3) ... [2022-04-14 17:23:37,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78d09612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 05:23:37, skipping insertion in model container [2022-04-14 17:23:37,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 05:23:37" (2/3) ... [2022-04-14 17:23:37,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78d09612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 05:23:37, skipping insertion in model container [2022-04-14 17:23:37,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 05:23:37" (3/3) ... [2022-04-14 17:23:37,921 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll_valuebound100.c [2022-04-14 17:23:37,925 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 17:23:37,925 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 17:23:37,980 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 17:23:37,993 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-14 17:23:37,993 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 17:23:38,014 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 17:23:38,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-14 17:23:38,019 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:23:38,019 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:23:38,020 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:23:38,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:23:38,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1738134960, now seen corresponding path program 1 times [2022-04-14 17:23:38,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:23:38,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078750667] [2022-04-14 17:23:38,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:23:38,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:23:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:23:38,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 17:23:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:23:38,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(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); {37#true} is VALID [2022-04-14 17:23:38,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-14 17:23:38,250 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #83#return; {37#true} is VALID [2022-04-14 17:23:38,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 17:23:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:23:38,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-14 17:23:38,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-14 17:23:38,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-14 17:23:38,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} #71#return; {38#false} is VALID [2022-04-14 17:23:38,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-14 17:23:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:23:38,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-14 17:23:38,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-14 17:23:38,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-14 17:23:38,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #73#return; {38#false} is VALID [2022-04-14 17:23:38,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-14 17:23:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:23:38,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-14 17:23:38,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-14 17:23:38,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-14 17:23:38,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #75#return; {38#false} is VALID [2022-04-14 17:23:38,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 17:23:38,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(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); {37#true} is VALID [2022-04-14 17:23:38,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-14 17:23:38,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #83#return; {37#true} is VALID [2022-04-14 17:23:38,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret6 := main(); {37#true} is VALID [2022-04-14 17:23:38,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#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; {37#true} is VALID [2022-04-14 17:23:38,298 INFO L272 TraceCheckUtils]: 6: Hoare triple {37#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {37#true} is VALID [2022-04-14 17:23:38,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-14 17:23:38,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-14 17:23:38,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-14 17:23:38,300 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38#false} {37#true} #71#return; {38#false} is VALID [2022-04-14 17:23:38,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {38#false} is VALID [2022-04-14 17:23:38,300 INFO L272 TraceCheckUtils]: 12: Hoare triple {38#false} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {37#true} is VALID [2022-04-14 17:23:38,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-14 17:23:38,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-14 17:23:38,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-14 17:23:38,301 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38#false} {38#false} #73#return; {38#false} is VALID [2022-04-14 17:23:38,301 INFO L272 TraceCheckUtils]: 17: Hoare triple {38#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {37#true} is VALID [2022-04-14 17:23:38,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-14 17:23:38,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-14 17:23:38,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-14 17:23:38,303 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {38#false} {38#false} #75#return; {38#false} is VALID [2022-04-14 17:23:38,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {38#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {38#false} is VALID [2022-04-14 17:23:38,303 INFO L290 TraceCheckUtils]: 23: Hoare triple {38#false} assume !true; {38#false} is VALID [2022-04-14 17:23:38,304 INFO L272 TraceCheckUtils]: 24: Hoare triple {38#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {38#false} is VALID [2022-04-14 17:23:38,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2022-04-14 17:23:38,305 INFO L290 TraceCheckUtils]: 26: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2022-04-14 17:23:38,306 INFO L290 TraceCheckUtils]: 27: Hoare triple {38#false} assume !false; {38#false} is VALID [2022-04-14 17:23:38,306 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 17:23:38,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:23:38,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078750667] [2022-04-14 17:23:38,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078750667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 17:23:38,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 17:23:38,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 17:23:38,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22299548] [2022-04-14 17:23:38,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 17:23:38,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-14 17:23:38,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:23:38,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 17:23:38,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:23:38,357 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 17:23:38,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:23:38,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 17:23:38,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 17:23:38,382 INFO L87 Difference]: Start difference. First operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 17:23:38,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:23:38,515 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2022-04-14 17:23:38,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 17:23:38,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-14 17:23:38,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:23:38,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 17:23:38,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-04-14 17:23:38,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 17:23:38,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-04-14 17:23:38,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2022-04-14 17:23:38,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:23:38,650 INFO L225 Difference]: With dead ends: 61 [2022-04-14 17:23:38,650 INFO L226 Difference]: Without dead ends: 29 [2022-04-14 17:23:38,653 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-14 17:23:38,655 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 17:23:38,656 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 38 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 17:23:38,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-14 17:23:38,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-14 17:23:38,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:23:38,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:23:38,692 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:23:38,693 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:23:38,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:23:38,698 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-14 17:23:38,698 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-14 17:23:38,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:23:38,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:23:38,700 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-14 17:23:38,700 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-14 17:23:38,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:23:38,705 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-14 17:23:38,705 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-14 17:23:38,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:23:38,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:23:38,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:23:38,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:23:38,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 17:23:38,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-04-14 17:23:38,719 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 28 [2022-04-14 17:23:38,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:23:38,720 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-04-14 17:23:38,720 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 17:23:38,720 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-14 17:23:38,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-14 17:23:38,721 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:23:38,721 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:23:38,721 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 17:23:38,722 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:23:38,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:23:38,722 INFO L85 PathProgramCache]: Analyzing trace with hash 567203544, now seen corresponding path program 1 times [2022-04-14 17:23:38,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:23:38,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057125157] [2022-04-14 17:23:38,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:23:38,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:23:38,744 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:23:38,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [930794989] [2022-04-14 17:23:38,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:23:38,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:23:38,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:23:38,747 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-14 17:23:38,748 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-14 17:23:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:23:38,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-14 17:23:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:23:38,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:23:39,331 INFO L272 TraceCheckUtils]: 0: Hoare triple {239#true} call ULTIMATE.init(); {239#true} is VALID [2022-04-14 17:23:39,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {239#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); {239#true} is VALID [2022-04-14 17:23:39,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {239#true} assume true; {239#true} is VALID [2022-04-14 17:23:39,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {239#true} {239#true} #83#return; {239#true} is VALID [2022-04-14 17:23:39,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {239#true} call #t~ret6 := main(); {239#true} is VALID [2022-04-14 17:23:39,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {239#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; {239#true} is VALID [2022-04-14 17:23:39,336 INFO L272 TraceCheckUtils]: 6: Hoare triple {239#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {239#true} is VALID [2022-04-14 17:23:39,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {239#true} ~cond := #in~cond; {265#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 17:23:39,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {265#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {269#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:23:39,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {269#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {269#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:23:39,340 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {269#(not (= |assume_abort_if_not_#in~cond| 0))} {239#true} #71#return; {276#(and (<= 0 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-14 17:23:39,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {276#(and (<= 0 main_~x~0) (<= main_~x~0 100))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {276#(and (<= 0 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-14 17:23:39,343 INFO L272 TraceCheckUtils]: 12: Hoare triple {276#(and (<= 0 main_~x~0) (<= main_~x~0 100))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {239#true} is VALID [2022-04-14 17:23:39,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {239#true} ~cond := #in~cond; {239#true} is VALID [2022-04-14 17:23:39,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {239#true} assume !(0 == ~cond); {239#true} is VALID [2022-04-14 17:23:39,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {239#true} assume true; {239#true} is VALID [2022-04-14 17:23:39,344 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {239#true} {276#(and (<= 0 main_~x~0) (<= main_~x~0 100))} #73#return; {276#(and (<= 0 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-14 17:23:39,345 INFO L272 TraceCheckUtils]: 17: Hoare triple {276#(and (<= 0 main_~x~0) (<= main_~x~0 100))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {239#true} is VALID [2022-04-14 17:23:39,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {239#true} ~cond := #in~cond; {265#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 17:23:39,346 INFO L290 TraceCheckUtils]: 19: Hoare triple {265#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {269#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:23:39,346 INFO L290 TraceCheckUtils]: 20: Hoare triple {269#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {269#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:23:39,347 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {269#(not (= |assume_abort_if_not_#in~cond| 0))} {276#(and (<= 0 main_~x~0) (<= main_~x~0 100))} #75#return; {310#(and (<= 0 main_~x~0) (<= main_~x~0 100) (<= 1 main_~y~0))} is VALID [2022-04-14 17:23:39,348 INFO L290 TraceCheckUtils]: 22: Hoare triple {310#(and (<= 0 main_~x~0) (<= main_~x~0 100) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {314#(and (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 100) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 17:23:39,349 INFO L290 TraceCheckUtils]: 23: Hoare triple {314#(and (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 100) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {314#(and (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 100) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 17:23:39,350 INFO L272 TraceCheckUtils]: 24: Hoare triple {314#(and (<= 0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~x~0 100) (<= 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)); {321#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:23:39,350 INFO L290 TraceCheckUtils]: 25: Hoare triple {321#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {325#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:23:39,351 INFO L290 TraceCheckUtils]: 26: Hoare triple {325#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {240#false} is VALID [2022-04-14 17:23:39,351 INFO L290 TraceCheckUtils]: 27: Hoare triple {240#false} assume !false; {240#false} is VALID [2022-04-14 17:23:39,352 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-14 17:23:39,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:23:39,654 INFO L290 TraceCheckUtils]: 27: Hoare triple {240#false} assume !false; {240#false} is VALID [2022-04-14 17:23:39,654 INFO L290 TraceCheckUtils]: 26: Hoare triple {325#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {240#false} is VALID [2022-04-14 17:23:39,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {321#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {325#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:23:39,657 INFO L272 TraceCheckUtils]: 24: Hoare triple {341#(= (+ 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)); {321#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:23:39,657 INFO L290 TraceCheckUtils]: 23: Hoare triple {341#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !false; {341#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-14 17:23:39,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {239#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {341#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-14 17:23:39,658 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {239#true} {239#true} #75#return; {239#true} is VALID [2022-04-14 17:23:39,659 INFO L290 TraceCheckUtils]: 20: Hoare triple {239#true} assume true; {239#true} is VALID [2022-04-14 17:23:39,659 INFO L290 TraceCheckUtils]: 19: Hoare triple {239#true} assume !(0 == ~cond); {239#true} is VALID [2022-04-14 17:23:39,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {239#true} ~cond := #in~cond; {239#true} is VALID [2022-04-14 17:23:39,659 INFO L272 TraceCheckUtils]: 17: Hoare triple {239#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {239#true} is VALID [2022-04-14 17:23:39,659 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {239#true} {239#true} #73#return; {239#true} is VALID [2022-04-14 17:23:39,659 INFO L290 TraceCheckUtils]: 15: Hoare triple {239#true} assume true; {239#true} is VALID [2022-04-14 17:23:39,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {239#true} assume !(0 == ~cond); {239#true} is VALID [2022-04-14 17:23:39,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {239#true} ~cond := #in~cond; {239#true} is VALID [2022-04-14 17:23:39,660 INFO L272 TraceCheckUtils]: 12: Hoare triple {239#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {239#true} is VALID [2022-04-14 17:23:39,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {239#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {239#true} is VALID [2022-04-14 17:23:39,660 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {239#true} {239#true} #71#return; {239#true} is VALID [2022-04-14 17:23:39,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {239#true} assume true; {239#true} is VALID [2022-04-14 17:23:39,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {239#true} assume !(0 == ~cond); {239#true} is VALID [2022-04-14 17:23:39,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {239#true} ~cond := #in~cond; {239#true} is VALID [2022-04-14 17:23:39,661 INFO L272 TraceCheckUtils]: 6: Hoare triple {239#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {239#true} is VALID [2022-04-14 17:23:39,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {239#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; {239#true} is VALID [2022-04-14 17:23:39,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {239#true} call #t~ret6 := main(); {239#true} is VALID [2022-04-14 17:23:39,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {239#true} {239#true} #83#return; {239#true} is VALID [2022-04-14 17:23:39,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {239#true} assume true; {239#true} is VALID [2022-04-14 17:23:39,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {239#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); {239#true} is VALID [2022-04-14 17:23:39,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {239#true} call ULTIMATE.init(); {239#true} is VALID [2022-04-14 17:23:39,662 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 17:23:39,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:23:39,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057125157] [2022-04-14 17:23:39,663 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:23:39,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930794989] [2022-04-14 17:23:39,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930794989] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 17:23:39,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:23:39,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-14 17:23:39,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736327067] [2022-04-14 17:23:39,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 17:23:39,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-14 17:23:39,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:23:39,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-14 17:23:39,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:23:39,684 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 17:23:39,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:23:39,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 17:23:39,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-14 17:23:39,685 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-14 17:23:40,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:23:40,038 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-14 17:23:40,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 17:23:40,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-14 17:23:40,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:23:40,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-14 17:23:40,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-14 17:23:40,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-14 17:23:40,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-14 17:23:40,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-14 17:23:40,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:23:40,150 INFO L225 Difference]: With dead ends: 35 [2022-04-14 17:23:40,150 INFO L226 Difference]: Without dead ends: 33 [2022-04-14 17:23:40,151 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-14 17:23:40,152 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-14 17:23:40,152 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 83 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-14 17:23:40,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-14 17:23:40,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-14 17:23:40,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:23:40,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 8 states have call successors, (8), 5 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-14 17:23:40,159 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 8 states have call successors, (8), 5 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-14 17:23:40,159 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 8 states have call successors, (8), 5 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-14 17:23:40,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:23:40,162 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-14 17:23:40,162 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-14 17:23:40,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:23:40,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:23:40,163 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 8 states have call successors, (8), 5 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 33 states. [2022-04-14 17:23:40,163 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 8 states have call successors, (8), 5 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 33 states. [2022-04-14 17:23:40,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:23:40,165 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-14 17:23:40,166 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-14 17:23:40,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:23:40,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:23:40,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:23:40,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:23:40,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 8 states have call successors, (8), 5 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-14 17:23:40,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-04-14 17:23:40,169 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 28 [2022-04-14 17:23:40,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:23:40,169 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-04-14 17:23:40,170 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-14 17:23:40,170 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-04-14 17:23:40,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-14 17:23:40,171 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:23:40,171 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:23:40,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-14 17:23:40,387 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-14 17:23:40,388 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:23:40,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:23:40,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1139707498, now seen corresponding path program 1 times [2022-04-14 17:23:40,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:23:40,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807468661] [2022-04-14 17:23:40,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:23:40,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:23:40,409 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:23:40,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1916055023] [2022-04-14 17:23:40,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:23:40,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:23:40,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:23:40,411 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-14 17:23:40,430 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-14 17:23:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:23:40,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-14 17:23:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:23:40,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:23:50,765 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-14 17:23:51,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {580#true} call ULTIMATE.init(); {580#true} is VALID [2022-04-14 17:23:51,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {580#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); {580#true} is VALID [2022-04-14 17:23:51,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {580#true} assume true; {580#true} is VALID [2022-04-14 17:23:51,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {580#true} {580#true} #83#return; {580#true} is VALID [2022-04-14 17:23:51,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {580#true} call #t~ret6 := main(); {580#true} is VALID [2022-04-14 17:23:51,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {580#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; {580#true} is VALID [2022-04-14 17:23:51,306 INFO L272 TraceCheckUtils]: 6: Hoare triple {580#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {580#true} is VALID [2022-04-14 17:23:51,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {580#true} ~cond := #in~cond; {580#true} is VALID [2022-04-14 17:23:51,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {580#true} assume !(0 == ~cond); {580#true} is VALID [2022-04-14 17:23:51,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {580#true} assume true; {580#true} is VALID [2022-04-14 17:23:51,307 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {580#true} {580#true} #71#return; {580#true} is VALID [2022-04-14 17:23:51,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {580#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {580#true} is VALID [2022-04-14 17:23:51,307 INFO L272 TraceCheckUtils]: 12: Hoare triple {580#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {580#true} is VALID [2022-04-14 17:23:51,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {580#true} ~cond := #in~cond; {580#true} is VALID [2022-04-14 17:23:51,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {580#true} assume !(0 == ~cond); {580#true} is VALID [2022-04-14 17:23:51,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {580#true} assume true; {580#true} is VALID [2022-04-14 17:23:51,308 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {580#true} {580#true} #73#return; {580#true} is VALID [2022-04-14 17:23:51,308 INFO L272 TraceCheckUtils]: 17: Hoare triple {580#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {580#true} is VALID [2022-04-14 17:23:51,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {580#true} ~cond := #in~cond; {639#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 17:23:51,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {639#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {643#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:23:51,309 INFO L290 TraceCheckUtils]: 20: Hoare triple {643#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {643#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:23:51,310 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {643#(not (= |assume_abort_if_not_#in~cond| 0))} {580#true} #75#return; {650#(<= 1 main_~y~0)} is VALID [2022-04-14 17:23:51,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {650#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {654#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-14 17:23:51,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {654#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !false; {654#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-14 17:23:51,312 INFO L272 TraceCheckUtils]: 24: Hoare triple {654#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= 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)); {580#true} is VALID [2022-04-14 17:23:51,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {580#true} ~cond := #in~cond; {664#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:23:51,312 INFO L290 TraceCheckUtils]: 26: Hoare triple {664#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:23:51,313 INFO L290 TraceCheckUtils]: 27: Hoare triple {668#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:23:53,316 WARN L284 TraceCheckUtils]: 28: Hoare quadruple {668#(not (= |__VERIFIER_assert_#in~cond| 0))} {654#(and (<= 1 main_~p~0) (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} #77#return; {675#(and (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (<= 1 (div (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0))) (not (= main_~a~0 0))) (and (= 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-14 17:23:53,317 INFO L290 TraceCheckUtils]: 29: Hoare triple {675#(and (<= main_~q~0 0) (<= main_~a~0 main_~x~0) (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (<= 1 (div (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0))) (not (= main_~a~0 0))) (and (= 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); {679#(and (<= 0 main_~x~0) (<= main_~q~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (<= 1 main_~y~0))} is VALID [2022-04-14 17:23:53,318 INFO L272 TraceCheckUtils]: 30: Hoare triple {679#(and (<= 0 main_~x~0) (<= main_~q~0 0) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {683#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:23:53,318 INFO L290 TraceCheckUtils]: 31: Hoare triple {683#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {687#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:23:53,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {687#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {581#false} is VALID [2022-04-14 17:23:53,319 INFO L290 TraceCheckUtils]: 33: Hoare triple {581#false} assume !false; {581#false} is VALID [2022-04-14 17:23:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-14 17:23:53,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:24:35,949 INFO L290 TraceCheckUtils]: 33: Hoare triple {581#false} assume !false; {581#false} is VALID [2022-04-14 17:24:35,949 INFO L290 TraceCheckUtils]: 32: Hoare triple {687#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {581#false} is VALID [2022-04-14 17:24:35,950 INFO L290 TraceCheckUtils]: 31: Hoare triple {683#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {687#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:24:35,950 INFO L272 TraceCheckUtils]: 30: Hoare triple {703#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {683#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:24:35,951 INFO L290 TraceCheckUtils]: 29: Hoare triple {707#(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); {703#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-14 17:24:35,952 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {668#(not (= |__VERIFIER_assert_#in~cond| 0))} {580#true} #77#return; {707#(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-14 17:24:35,953 INFO L290 TraceCheckUtils]: 27: Hoare triple {668#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:24:35,953 INFO L290 TraceCheckUtils]: 26: Hoare triple {720#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 17:24:35,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {580#true} ~cond := #in~cond; {720#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 17:24:35,954 INFO L272 TraceCheckUtils]: 24: Hoare triple {580#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {580#true} is VALID [2022-04-14 17:24:35,954 INFO L290 TraceCheckUtils]: 23: Hoare triple {580#true} assume !false; {580#true} is VALID [2022-04-14 17:24:35,954 INFO L290 TraceCheckUtils]: 22: Hoare triple {580#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {580#true} is VALID [2022-04-14 17:24:35,954 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {580#true} {580#true} #75#return; {580#true} is VALID [2022-04-14 17:24:35,955 INFO L290 TraceCheckUtils]: 20: Hoare triple {580#true} assume true; {580#true} is VALID [2022-04-14 17:24:35,955 INFO L290 TraceCheckUtils]: 19: Hoare triple {580#true} assume !(0 == ~cond); {580#true} is VALID [2022-04-14 17:24:35,955 INFO L290 TraceCheckUtils]: 18: Hoare triple {580#true} ~cond := #in~cond; {580#true} is VALID [2022-04-14 17:24:35,955 INFO L272 TraceCheckUtils]: 17: Hoare triple {580#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {580#true} is VALID [2022-04-14 17:24:35,955 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {580#true} {580#true} #73#return; {580#true} is VALID [2022-04-14 17:24:35,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {580#true} assume true; {580#true} is VALID [2022-04-14 17:24:35,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {580#true} assume !(0 == ~cond); {580#true} is VALID [2022-04-14 17:24:35,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {580#true} ~cond := #in~cond; {580#true} is VALID [2022-04-14 17:24:35,956 INFO L272 TraceCheckUtils]: 12: Hoare triple {580#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {580#true} is VALID [2022-04-14 17:24:35,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {580#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {580#true} is VALID [2022-04-14 17:24:35,956 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {580#true} {580#true} #71#return; {580#true} is VALID [2022-04-14 17:24:35,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {580#true} assume true; {580#true} is VALID [2022-04-14 17:24:35,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {580#true} assume !(0 == ~cond); {580#true} is VALID [2022-04-14 17:24:35,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {580#true} ~cond := #in~cond; {580#true} is VALID [2022-04-14 17:24:35,957 INFO L272 TraceCheckUtils]: 6: Hoare triple {580#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {580#true} is VALID [2022-04-14 17:24:35,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {580#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; {580#true} is VALID [2022-04-14 17:24:35,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {580#true} call #t~ret6 := main(); {580#true} is VALID [2022-04-14 17:24:35,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {580#true} {580#true} #83#return; {580#true} is VALID [2022-04-14 17:24:35,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {580#true} assume true; {580#true} is VALID [2022-04-14 17:24:35,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {580#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); {580#true} is VALID [2022-04-14 17:24:35,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {580#true} call ULTIMATE.init(); {580#true} is VALID [2022-04-14 17:24:35,958 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 17:24:35,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:24:35,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807468661] [2022-04-14 17:24:35,959 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:24:35,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916055023] [2022-04-14 17:24:35,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916055023] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 17:24:35,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 17:24:35,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2022-04-14 17:24:35,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357564938] [2022-04-14 17:24:35,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 17:24:35,960 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 34 [2022-04-14 17:24:35,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:24:35,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 17:24:37,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 39 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 17:24:38,000 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-14 17:24:38,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:24:38,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-14 17:24:38,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-14 17:24:38,001 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 17:24:39,831 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 17:24:46,479 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 17:24:48,510 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 17:24:48,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:24:48,635 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-04-14 17:24:48,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-14 17:24:48,635 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 34 [2022-04-14 17:24:48,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:24:48,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 17:24:48,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-14 17:24:48,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 17:24:48,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-14 17:24:48,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 58 transitions. [2022-04-14 17:24:48,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:24:48,703 INFO L225 Difference]: With dead ends: 49 [2022-04-14 17:24:48,704 INFO L226 Difference]: Without dead ends: 43 [2022-04-14 17:24:48,704 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2022-04-14 17:24:48,707 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 33 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 22 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-04-14 17:24:48,710 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 153 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 279 Invalid, 2 Unknown, 0 Unchecked, 7.1s Time] [2022-04-14 17:24:48,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-14 17:24:48,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2022-04-14 17:24:48,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:24:48,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 17:24:48,735 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 17:24:48,735 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 17:24:48,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:24:48,738 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-14 17:24:48,738 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-04-14 17:24:48,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:24:48,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:24:48,739 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 43 states. [2022-04-14 17:24:48,739 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 43 states. [2022-04-14 17:24:48,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:24:48,744 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-14 17:24:48,744 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-04-14 17:24:48,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:24:48,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:24:48,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:24:48,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:24:48,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 17:24:48,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-04-14 17:24:48,757 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 34 [2022-04-14 17:24:48,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:24:48,757 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-04-14 17:24:48,758 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 11 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 17:24:48,758 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-04-14 17:24:48,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-14 17:24:48,762 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:24:48,763 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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-14 17:24:48,789 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-14 17:24:48,979 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-14 17:24:48,980 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:24:48,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:24:48,980 INFO L85 PathProgramCache]: Analyzing trace with hash -624978355, now seen corresponding path program 1 times [2022-04-14 17:24:48,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:24:48,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321142386] [2022-04-14 17:24:48,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:24:48,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:24:49,021 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:24:49,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1658074309] [2022-04-14 17:24:49,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:24:49,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:24:49,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:24:49,032 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-14 17:24:49,033 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-14 17:24:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:24:49,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-14 17:24:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:24:49,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:24:49,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {1025#true} call ULTIMATE.init(); {1025#true} is VALID [2022-04-14 17:24:49,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {1025#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); {1025#true} is VALID [2022-04-14 17:24:49,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-14 17:24:49,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1025#true} {1025#true} #83#return; {1025#true} is VALID [2022-04-14 17:24:49,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {1025#true} call #t~ret6 := main(); {1025#true} is VALID [2022-04-14 17:24:49,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {1025#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; {1025#true} is VALID [2022-04-14 17:24:49,514 INFO L272 TraceCheckUtils]: 6: Hoare triple {1025#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {1025#true} is VALID [2022-04-14 17:24:49,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {1025#true} ~cond := #in~cond; {1051#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 17:24:49,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {1051#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1055#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:24:49,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {1055#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1055#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:24:49,521 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1055#(not (= |assume_abort_if_not_#in~cond| 0))} {1025#true} #71#return; {1062#(and (<= 0 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-14 17:24:49,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {1062#(and (<= 0 main_~x~0) (<= main_~x~0 100))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1062#(and (<= 0 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-14 17:24:49,522 INFO L272 TraceCheckUtils]: 12: Hoare triple {1062#(and (<= 0 main_~x~0) (<= main_~x~0 100))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {1025#true} is VALID [2022-04-14 17:24:49,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-14 17:24:49,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-14 17:24:49,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-14 17:24:49,525 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1025#true} {1062#(and (<= 0 main_~x~0) (<= main_~x~0 100))} #73#return; {1062#(and (<= 0 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-14 17:24:49,526 INFO L272 TraceCheckUtils]: 17: Hoare triple {1062#(and (<= 0 main_~x~0) (<= main_~x~0 100))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1025#true} is VALID [2022-04-14 17:24:49,526 INFO L290 TraceCheckUtils]: 18: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-14 17:24:49,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-14 17:24:49,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-14 17:24:49,529 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1025#true} {1062#(and (<= 0 main_~x~0) (<= main_~x~0 100))} #75#return; {1062#(and (<= 0 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-14 17:24:49,530 INFO L290 TraceCheckUtils]: 22: Hoare triple {1062#(and (<= 0 main_~x~0) (<= main_~x~0 100))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1099#(<= 0 main_~a~0)} is VALID [2022-04-14 17:24:49,530 INFO L290 TraceCheckUtils]: 23: Hoare triple {1099#(<= 0 main_~a~0)} assume !false; {1099#(<= 0 main_~a~0)} is VALID [2022-04-14 17:24:49,531 INFO L272 TraceCheckUtils]: 24: Hoare triple {1099#(<= 0 main_~a~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1025#true} is VALID [2022-04-14 17:24:49,531 INFO L290 TraceCheckUtils]: 25: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-14 17:24:49,531 INFO L290 TraceCheckUtils]: 26: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-14 17:24:49,531 INFO L290 TraceCheckUtils]: 27: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-14 17:24:49,534 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1025#true} {1099#(<= 0 main_~a~0)} #77#return; {1099#(<= 0 main_~a~0)} is VALID [2022-04-14 17:24:49,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {1099#(<= 0 main_~a~0)} assume !!(0 != ~a~0 && 0 != ~b~0); {1121#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-14 17:24:49,536 INFO L290 TraceCheckUtils]: 30: Hoare triple {1121#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (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);~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; {1121#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-14 17:24:49,536 INFO L290 TraceCheckUtils]: 31: Hoare triple {1121#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} assume !false; {1121#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-14 17:24:49,537 INFO L272 TraceCheckUtils]: 32: Hoare triple {1121#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (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)); {1025#true} is VALID [2022-04-14 17:24:49,537 INFO L290 TraceCheckUtils]: 33: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-14 17:24:49,537 INFO L290 TraceCheckUtils]: 34: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-14 17:24:49,537 INFO L290 TraceCheckUtils]: 35: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-14 17:24:49,538 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1025#true} {1121#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} #77#return; {1121#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-14 17:24:49,538 INFO L290 TraceCheckUtils]: 37: Hoare triple {1121#(and (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= main_~a~0 0)))} assume !(0 != ~a~0 && 0 != ~b~0); {1026#false} is VALID [2022-04-14 17:24:49,538 INFO L272 TraceCheckUtils]: 38: Hoare triple {1026#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1026#false} is VALID [2022-04-14 17:24:49,539 INFO L290 TraceCheckUtils]: 39: Hoare triple {1026#false} ~cond := #in~cond; {1026#false} is VALID [2022-04-14 17:24:49,539 INFO L290 TraceCheckUtils]: 40: Hoare triple {1026#false} assume !(0 == ~cond); {1026#false} is VALID [2022-04-14 17:24:49,539 INFO L290 TraceCheckUtils]: 41: Hoare triple {1026#false} assume true; {1026#false} is VALID [2022-04-14 17:24:49,539 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1026#false} {1026#false} #79#return; {1026#false} is VALID [2022-04-14 17:24:49,539 INFO L272 TraceCheckUtils]: 43: Hoare triple {1026#false} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {1026#false} is VALID [2022-04-14 17:24:49,539 INFO L290 TraceCheckUtils]: 44: Hoare triple {1026#false} ~cond := #in~cond; {1026#false} is VALID [2022-04-14 17:24:49,539 INFO L290 TraceCheckUtils]: 45: Hoare triple {1026#false} assume 0 == ~cond; {1026#false} is VALID [2022-04-14 17:24:49,540 INFO L290 TraceCheckUtils]: 46: Hoare triple {1026#false} assume !false; {1026#false} is VALID [2022-04-14 17:24:49,540 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-14 17:24:49,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:24:50,654 INFO L290 TraceCheckUtils]: 46: Hoare triple {1026#false} assume !false; {1026#false} is VALID [2022-04-14 17:24:50,654 INFO L290 TraceCheckUtils]: 45: Hoare triple {1026#false} assume 0 == ~cond; {1026#false} is VALID [2022-04-14 17:24:50,654 INFO L290 TraceCheckUtils]: 44: Hoare triple {1026#false} ~cond := #in~cond; {1026#false} is VALID [2022-04-14 17:24:50,654 INFO L272 TraceCheckUtils]: 43: Hoare triple {1026#false} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {1026#false} is VALID [2022-04-14 17:24:50,654 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1025#true} {1026#false} #79#return; {1026#false} is VALID [2022-04-14 17:24:50,654 INFO L290 TraceCheckUtils]: 41: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-14 17:24:50,655 INFO L290 TraceCheckUtils]: 40: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-14 17:24:50,655 INFO L290 TraceCheckUtils]: 39: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-14 17:24:50,655 INFO L272 TraceCheckUtils]: 38: Hoare triple {1026#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1025#true} is VALID [2022-04-14 17:24:50,655 INFO L290 TraceCheckUtils]: 37: Hoare triple {1200#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} assume !(0 != ~a~0 && 0 != ~b~0); {1026#false} is VALID [2022-04-14 17:24:50,656 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1025#true} {1200#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} #77#return; {1200#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-14 17:24:50,656 INFO L290 TraceCheckUtils]: 35: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-14 17:24:50,656 INFO L290 TraceCheckUtils]: 34: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-14 17:24:50,656 INFO L290 TraceCheckUtils]: 33: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-14 17:24:50,657 INFO L272 TraceCheckUtils]: 32: Hoare triple {1200#(and (not (= main_~b~0 0)) (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)); {1025#true} is VALID [2022-04-14 17:24:50,657 INFO L290 TraceCheckUtils]: 31: Hoare triple {1200#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} assume !false; {1200#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-14 17:24:50,658 INFO L290 TraceCheckUtils]: 30: Hoare triple {1222#(or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0)) (and (not (<= (div main_~a~0 2) 0)) (not (= (div 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; {1200#(and (not (= main_~b~0 0)) (not (= main_~a~0 0)))} is VALID [2022-04-14 17:24:50,659 INFO L290 TraceCheckUtils]: 29: Hoare triple {1226#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} assume !!(0 != ~a~0 && 0 != ~b~0); {1222#(or (not (= (mod main_~b~0 2) 0)) (not (= (mod main_~a~0 2) 0)) (and (not (<= (div main_~a~0 2) 0)) (not (= (div main_~b~0 2) 0))))} is VALID [2022-04-14 17:24:50,660 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1025#true} {1226#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} #77#return; {1226#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-14 17:24:50,660 INFO L290 TraceCheckUtils]: 27: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-14 17:24:50,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-14 17:24:50,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-14 17:24:50,660 INFO L272 TraceCheckUtils]: 24: Hoare triple {1226#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1025#true} is VALID [2022-04-14 17:24:50,663 INFO L290 TraceCheckUtils]: 23: Hoare triple {1226#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} assume !false; {1226#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-14 17:24:50,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {1248#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1226#(or (not (= (mod main_~b~0 2) 0)) (= main_~a~0 0) (not (<= (div main_~a~0 2) 0)) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-14 17:24:50,665 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1025#true} {1248#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} #75#return; {1248#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} is VALID [2022-04-14 17:24:50,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-14 17:24:50,665 INFO L290 TraceCheckUtils]: 19: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-14 17:24:50,665 INFO L290 TraceCheckUtils]: 18: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-14 17:24:50,671 INFO L272 TraceCheckUtils]: 17: Hoare triple {1248#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1025#true} is VALID [2022-04-14 17:24:50,672 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1025#true} {1248#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} #73#return; {1248#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} is VALID [2022-04-14 17:24:50,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-14 17:24:50,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {1025#true} assume !(0 == ~cond); {1025#true} is VALID [2022-04-14 17:24:50,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {1025#true} ~cond := #in~cond; {1025#true} is VALID [2022-04-14 17:24:50,673 INFO L272 TraceCheckUtils]: 12: Hoare triple {1248#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {1025#true} is VALID [2022-04-14 17:24:50,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {1248#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1248#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} is VALID [2022-04-14 17:24:50,674 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1055#(not (= |assume_abort_if_not_#in~cond| 0))} {1025#true} #71#return; {1248#(<= 0 (+ (div (+ (- 1) main_~x~0) 2) 1))} is VALID [2022-04-14 17:24:50,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {1055#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1055#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:24:50,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {1294#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1055#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:24:50,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {1025#true} ~cond := #in~cond; {1294#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-14 17:24:50,677 INFO L272 TraceCheckUtils]: 6: Hoare triple {1025#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {1025#true} is VALID [2022-04-14 17:24:50,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {1025#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; {1025#true} is VALID [2022-04-14 17:24:50,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {1025#true} call #t~ret6 := main(); {1025#true} is VALID [2022-04-14 17:24:50,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1025#true} {1025#true} #83#return; {1025#true} is VALID [2022-04-14 17:24:50,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {1025#true} assume true; {1025#true} is VALID [2022-04-14 17:24:50,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {1025#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); {1025#true} is VALID [2022-04-14 17:24:50,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {1025#true} call ULTIMATE.init(); {1025#true} is VALID [2022-04-14 17:24:50,678 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-14 17:24:50,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:24:50,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321142386] [2022-04-14 17:24:50,679 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:24:50,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658074309] [2022-04-14 17:24:50,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658074309] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 17:24:50,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 17:24:50,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2022-04-14 17:24:50,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177621533] [2022-04-14 17:24:50,679 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 17:24:50,680 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) Word has length 47 [2022-04-14 17:24:50,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:24:50,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-14 17:24:50,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:24:50,741 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-14 17:24:50,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:24:50,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-14 17:24:50,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-14 17:24:50,743 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-14 17:24:51,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:24:51,100 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-04-14 17:24:51,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 17:24:51,101 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) Word has length 47 [2022-04-14 17:24:51,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:24:51,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-14 17:24:51,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-14 17:24:51,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-14 17:24:51,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-14 17:24:51,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 49 transitions. [2022-04-14 17:24:51,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:24:51,155 INFO L225 Difference]: With dead ends: 51 [2022-04-14 17:24:51,155 INFO L226 Difference]: Without dead ends: 41 [2022-04-14 17:24:51,156 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-04-14 17:24:51,156 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 21 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 17:24:51,157 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 137 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 17:24:51,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-14 17:24:51,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2022-04-14 17:24:51,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:24:51,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 17:24:51,186 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 17:24:51,186 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 17:24:51,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:24:51,188 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-14 17:24:51,188 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-14 17:24:51,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:24:51,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:24:51,189 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-14 17:24:51,189 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-14 17:24:51,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:24:51,191 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-14 17:24:51,191 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-14 17:24:51,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:24:51,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:24:51,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:24:51,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:24:51,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 17:24:51,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-04-14 17:24:51,194 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 47 [2022-04-14 17:24:51,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:24:51,194 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-04-14 17:24:51,194 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-14 17:24:51,194 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-04-14 17:24:51,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-14 17:24:51,195 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 17:24:51,195 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 17:24:51,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-14 17:24:51,407 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-14 17:24:51,408 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 17:24:51,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 17:24:51,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2091386113, now seen corresponding path program 1 times [2022-04-14 17:24:51,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 17:24:51,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594141433] [2022-04-14 17:24:51,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:24:51,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 17:24:51,435 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 17:24:51,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2083297330] [2022-04-14 17:24:51,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 17:24:51,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 17:24:51,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 17:24:51,436 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-14 17:24:51,458 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-14 17:24:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:24:51,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-14 17:24:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 17:24:51,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 17:24:51,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {1535#true} call ULTIMATE.init(); {1535#true} is VALID [2022-04-14 17:24:51,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {1535#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); {1535#true} is VALID [2022-04-14 17:24:51,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {1535#true} assume true; {1535#true} is VALID [2022-04-14 17:24:51,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1535#true} {1535#true} #83#return; {1535#true} is VALID [2022-04-14 17:24:51,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {1535#true} call #t~ret6 := main(); {1535#true} is VALID [2022-04-14 17:24:51,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {1535#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; {1535#true} is VALID [2022-04-14 17:24:51,753 INFO L272 TraceCheckUtils]: 6: Hoare triple {1535#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {1535#true} is VALID [2022-04-14 17:24:51,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {1535#true} ~cond := #in~cond; {1535#true} is VALID [2022-04-14 17:24:51,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {1535#true} assume !(0 == ~cond); {1535#true} is VALID [2022-04-14 17:24:51,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {1535#true} assume true; {1535#true} is VALID [2022-04-14 17:24:51,753 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1535#true} {1535#true} #71#return; {1535#true} is VALID [2022-04-14 17:24:51,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {1535#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1535#true} is VALID [2022-04-14 17:24:51,753 INFO L272 TraceCheckUtils]: 12: Hoare triple {1535#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {1535#true} is VALID [2022-04-14 17:24:51,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {1535#true} ~cond := #in~cond; {1579#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 17:24:51,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {1579#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1583#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:24:51,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {1583#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1583#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 17:24:51,755 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1583#(not (= |assume_abort_if_not_#in~cond| 0))} {1535#true} #73#return; {1590#(and (<= 0 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-14 17:24:51,755 INFO L272 TraceCheckUtils]: 17: Hoare triple {1590#(and (<= 0 main_~y~0) (<= main_~y~0 100))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1535#true} is VALID [2022-04-14 17:24:51,755 INFO L290 TraceCheckUtils]: 18: Hoare triple {1535#true} ~cond := #in~cond; {1535#true} is VALID [2022-04-14 17:24:51,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {1535#true} assume !(0 == ~cond); {1535#true} is VALID [2022-04-14 17:24:51,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {1535#true} assume true; {1535#true} is VALID [2022-04-14 17:24:51,756 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1535#true} {1590#(and (<= 0 main_~y~0) (<= main_~y~0 100))} #75#return; {1590#(and (<= 0 main_~y~0) (<= main_~y~0 100))} is VALID [2022-04-14 17:24:51,756 INFO L290 TraceCheckUtils]: 22: Hoare triple {1590#(and (<= 0 main_~y~0) (<= main_~y~0 100))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1609#(<= 0 main_~b~0)} is VALID [2022-04-14 17:24:51,757 INFO L290 TraceCheckUtils]: 23: Hoare triple {1609#(<= 0 main_~b~0)} assume !false; {1609#(<= 0 main_~b~0)} is VALID [2022-04-14 17:24:51,757 INFO L272 TraceCheckUtils]: 24: Hoare triple {1609#(<= 0 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1535#true} is VALID [2022-04-14 17:24:51,757 INFO L290 TraceCheckUtils]: 25: Hoare triple {1535#true} ~cond := #in~cond; {1535#true} is VALID [2022-04-14 17:24:51,757 INFO L290 TraceCheckUtils]: 26: Hoare triple {1535#true} assume !(0 == ~cond); {1535#true} is VALID [2022-04-14 17:24:51,757 INFO L290 TraceCheckUtils]: 27: Hoare triple {1535#true} assume true; {1535#true} is VALID [2022-04-14 17:24:51,758 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1535#true} {1609#(<= 0 main_~b~0)} #77#return; {1609#(<= 0 main_~b~0)} is VALID [2022-04-14 17:24:51,758 INFO L290 TraceCheckUtils]: 29: Hoare triple {1609#(<= 0 main_~b~0)} assume !!(0 != ~a~0 && 0 != ~b~0); {1631#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-14 17:24:51,759 INFO L290 TraceCheckUtils]: 30: Hoare triple {1631#(and (not (= main_~b~0 0)) (<= 0 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)); {1631#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-14 17:24:51,768 INFO L290 TraceCheckUtils]: 31: Hoare triple {1631#(and (not (= main_~b~0 0)) (<= 0 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);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {1631#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-14 17:24:51,768 INFO L290 TraceCheckUtils]: 32: Hoare triple {1631#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !false; {1631#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-14 17:24:51,768 INFO L272 TraceCheckUtils]: 33: Hoare triple {1631#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1535#true} is VALID [2022-04-14 17:24:51,768 INFO L290 TraceCheckUtils]: 34: Hoare triple {1535#true} ~cond := #in~cond; {1535#true} is VALID [2022-04-14 17:24:51,768 INFO L290 TraceCheckUtils]: 35: Hoare triple {1535#true} assume !(0 == ~cond); {1535#true} is VALID [2022-04-14 17:24:51,769 INFO L290 TraceCheckUtils]: 36: Hoare triple {1535#true} assume true; {1535#true} is VALID [2022-04-14 17:24:51,770 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1535#true} {1631#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} #77#return; {1631#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-14 17:24:51,770 INFO L290 TraceCheckUtils]: 38: Hoare triple {1631#(and (not (= main_~b~0 0)) (<= 0 main_~b~0))} assume !(0 != ~a~0 && 0 != ~b~0); {1659#(and (= main_~a~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-14 17:24:51,770 INFO L272 TraceCheckUtils]: 39: Hoare triple {1659#(and (= main_~a~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1535#true} is VALID [2022-04-14 17:24:51,771 INFO L290 TraceCheckUtils]: 40: Hoare triple {1535#true} ~cond := #in~cond; {1535#true} is VALID [2022-04-14 17:24:51,771 INFO L290 TraceCheckUtils]: 41: Hoare triple {1535#true} assume !(0 == ~cond); {1535#true} is VALID [2022-04-14 17:24:51,771 INFO L290 TraceCheckUtils]: 42: Hoare triple {1535#true} assume true; {1535#true} is VALID [2022-04-14 17:24:51,772 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1535#true} {1659#(and (= main_~a~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} #79#return; {1659#(and (= main_~a~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-14 17:24:51,773 INFO L272 TraceCheckUtils]: 44: Hoare triple {1659#(and (= main_~a~0 0) (not (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {1678#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:24:51,773 INFO L290 TraceCheckUtils]: 45: Hoare triple {1678#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1682#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:24:51,774 INFO L290 TraceCheckUtils]: 46: Hoare triple {1682#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1536#false} is VALID [2022-04-14 17:24:51,774 INFO L290 TraceCheckUtils]: 47: Hoare triple {1536#false} assume !false; {1536#false} is VALID [2022-04-14 17:24:51,776 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-14 17:24:51,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 17:24:52,047 INFO L290 TraceCheckUtils]: 47: Hoare triple {1536#false} assume !false; {1536#false} is VALID [2022-04-14 17:24:52,047 INFO L290 TraceCheckUtils]: 46: Hoare triple {1682#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1536#false} is VALID [2022-04-14 17:24:52,047 INFO L290 TraceCheckUtils]: 45: Hoare triple {1678#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1682#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 17:24:52,048 INFO L272 TraceCheckUtils]: 44: Hoare triple {1698#(= (* main_~b~0 main_~a~0) 0)} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {1678#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 17:24:52,048 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1535#true} {1698#(= (* main_~b~0 main_~a~0) 0)} #79#return; {1698#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-14 17:24:52,049 INFO L290 TraceCheckUtils]: 42: Hoare triple {1535#true} assume true; {1535#true} is VALID [2022-04-14 17:24:52,049 INFO L290 TraceCheckUtils]: 41: Hoare triple {1535#true} assume !(0 == ~cond); {1535#true} is VALID [2022-04-14 17:24:52,049 INFO L290 TraceCheckUtils]: 40: Hoare triple {1535#true} ~cond := #in~cond; {1535#true} is VALID [2022-04-14 17:24:52,049 INFO L272 TraceCheckUtils]: 39: Hoare triple {1698#(= (* main_~b~0 main_~a~0) 0)} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1535#true} is VALID [2022-04-14 17:24:52,050 INFO L290 TraceCheckUtils]: 38: Hoare triple {1535#true} assume !(0 != ~a~0 && 0 != ~b~0); {1698#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-14 17:24:52,050 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1535#true} {1535#true} #77#return; {1535#true} is VALID [2022-04-14 17:24:52,050 INFO L290 TraceCheckUtils]: 36: Hoare triple {1535#true} assume true; {1535#true} is VALID [2022-04-14 17:24:52,050 INFO L290 TraceCheckUtils]: 35: Hoare triple {1535#true} assume !(0 == ~cond); {1535#true} is VALID [2022-04-14 17:24:52,050 INFO L290 TraceCheckUtils]: 34: Hoare triple {1535#true} ~cond := #in~cond; {1535#true} is VALID [2022-04-14 17:24:52,050 INFO L272 TraceCheckUtils]: 33: Hoare triple {1535#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1535#true} is VALID [2022-04-14 17:24:52,050 INFO L290 TraceCheckUtils]: 32: Hoare triple {1535#true} assume !false; {1535#true} is VALID [2022-04-14 17:24:52,050 INFO L290 TraceCheckUtils]: 31: Hoare triple {1535#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);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {1535#true} is VALID [2022-04-14 17:24:52,051 INFO L290 TraceCheckUtils]: 30: Hoare triple {1535#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)); {1535#true} is VALID [2022-04-14 17:24:52,051 INFO L290 TraceCheckUtils]: 29: Hoare triple {1535#true} assume !!(0 != ~a~0 && 0 != ~b~0); {1535#true} is VALID [2022-04-14 17:24:52,051 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1535#true} {1535#true} #77#return; {1535#true} is VALID [2022-04-14 17:24:52,051 INFO L290 TraceCheckUtils]: 27: Hoare triple {1535#true} assume true; {1535#true} is VALID [2022-04-14 17:24:52,051 INFO L290 TraceCheckUtils]: 26: Hoare triple {1535#true} assume !(0 == ~cond); {1535#true} is VALID [2022-04-14 17:24:52,051 INFO L290 TraceCheckUtils]: 25: Hoare triple {1535#true} ~cond := #in~cond; {1535#true} is VALID [2022-04-14 17:24:52,051 INFO L272 TraceCheckUtils]: 24: Hoare triple {1535#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1535#true} is VALID [2022-04-14 17:24:52,051 INFO L290 TraceCheckUtils]: 23: Hoare triple {1535#true} assume !false; {1535#true} is VALID [2022-04-14 17:24:52,051 INFO L290 TraceCheckUtils]: 22: Hoare triple {1535#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1535#true} is VALID [2022-04-14 17:24:52,051 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1535#true} {1535#true} #75#return; {1535#true} is VALID [2022-04-14 17:24:52,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {1535#true} assume true; {1535#true} is VALID [2022-04-14 17:24:52,052 INFO L290 TraceCheckUtils]: 19: Hoare triple {1535#true} assume !(0 == ~cond); {1535#true} is VALID [2022-04-14 17:24:52,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {1535#true} ~cond := #in~cond; {1535#true} is VALID [2022-04-14 17:24:52,052 INFO L272 TraceCheckUtils]: 17: Hoare triple {1535#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1535#true} is VALID [2022-04-14 17:24:52,052 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1535#true} {1535#true} #73#return; {1535#true} is VALID [2022-04-14 17:24:52,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {1535#true} assume true; {1535#true} is VALID [2022-04-14 17:24:52,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {1535#true} assume !(0 == ~cond); {1535#true} is VALID [2022-04-14 17:24:52,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {1535#true} ~cond := #in~cond; {1535#true} is VALID [2022-04-14 17:24:52,053 INFO L272 TraceCheckUtils]: 12: Hoare triple {1535#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 100 then 1 else 0)); {1535#true} is VALID [2022-04-14 17:24:52,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {1535#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1535#true} is VALID [2022-04-14 17:24:52,053 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1535#true} {1535#true} #71#return; {1535#true} is VALID [2022-04-14 17:24:52,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {1535#true} assume true; {1535#true} is VALID [2022-04-14 17:24:52,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {1535#true} assume !(0 == ~cond); {1535#true} is VALID [2022-04-14 17:24:52,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {1535#true} ~cond := #in~cond; {1535#true} is VALID [2022-04-14 17:24:52,053 INFO L272 TraceCheckUtils]: 6: Hoare triple {1535#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 100 then 1 else 0)); {1535#true} is VALID [2022-04-14 17:24:52,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {1535#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; {1535#true} is VALID [2022-04-14 17:24:52,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {1535#true} call #t~ret6 := main(); {1535#true} is VALID [2022-04-14 17:24:52,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1535#true} {1535#true} #83#return; {1535#true} is VALID [2022-04-14 17:24:52,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {1535#true} assume true; {1535#true} is VALID [2022-04-14 17:24:52,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {1535#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); {1535#true} is VALID [2022-04-14 17:24:52,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {1535#true} call ULTIMATE.init(); {1535#true} is VALID [2022-04-14 17:24:52,054 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-14 17:24:52,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 17:24:52,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594141433] [2022-04-14 17:24:52,055 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 17:24:52,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083297330] [2022-04-14 17:24:52,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083297330] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 17:24:52,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 17:24:52,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-04-14 17:24:52,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244363677] [2022-04-14 17:24:52,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 17:24:52,056 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2022-04-14 17:24:52,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 17:24:52,056 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 17:24:52,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:24:52,085 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 17:24:52,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 17:24:52,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 17:24:52,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-14 17:24:52,086 INFO L87 Difference]: Start difference. First operand 38 states and 44 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 17:24:52,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:24:52,403 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-04-14 17:24:52,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 17:24:52,404 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2022-04-14 17:24:52,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 17:24:52,404 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 17:24:52,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-14 17:24:52,406 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 17:24:52,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-14 17:24:52,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2022-04-14 17:24:52,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 17:24:52,441 INFO L225 Difference]: With dead ends: 38 [2022-04-14 17:24:52,441 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 17:24:52,441 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-14 17:24:52,442 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 116 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-14 17:24:52,442 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 116 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 17:24:52,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 17:24:52,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 17:24:52,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 17:24:52,443 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-14 17:24:52,443 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-14 17:24:52,443 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-14 17:24:52,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:24:52,444 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 17:24:52,444 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 17:24:52,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:24:52,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:24:52,444 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-14 17:24:52,444 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-14 17:24:52,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 17:24:52,444 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 17:24:52,444 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 17:24:52,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:24:52,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 17:24:52,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 17:24:52,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 17:24:52,445 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-14 17:24:52,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 17:24:52,445 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2022-04-14 17:24:52,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 17:24:52,445 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 17:24:52,445 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 17:24:52,445 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 17:24:52,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 17:24:52,448 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 17:24:52,473 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-14 17:24:52,663 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-14 17:24:52,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-14 17:24:53,214 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-14 17:24:53,214 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-14 17:24:53,214 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-14 17:24:53,214 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-14 17:24:53,214 INFO L882 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-04-14 17:24:53,214 INFO L882 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-04-14 17:24:53,214 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-04-14 17:24:53,214 INFO L882 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2022-04-14 17:24:53,214 INFO L882 garLoopResultBuilder]: For program point L58(line 58) no Hoare annotation was computed. [2022-04-14 17:24:53,214 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 19 60) no Hoare annotation was computed. [2022-04-14 17:24:53,214 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 19 60) no Hoare annotation was computed. [2022-04-14 17:24:53,214 INFO L882 garLoopResultBuilder]: For program point L44(lines 44 54) no Hoare annotation was computed. [2022-04-14 17:24:53,214 INFO L882 garLoopResultBuilder]: For program point L40(lines 40 54) no Hoare annotation was computed. [2022-04-14 17:24:53,215 INFO L878 garLoopResultBuilder]: At program point L34-2(lines 34 55) the Hoare annotation is: (and (<= 0 main_~x~0) (<= 0 main_~a~0) (= main_~q~0 (* main_~y~0 main_~x~0)) (<= main_~x~0 100) (<= 1 main_~y~0) (= (* main_~b~0 main_~a~0) 0)) [2022-04-14 17:24:53,215 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 19 60) the Hoare annotation is: true [2022-04-14 17:24:53,215 INFO L878 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: (and (<= 0 main_~x~0) (<= main_~x~0 100)) [2022-04-14 17:24:53,215 INFO L878 garLoopResultBuilder]: At program point L26-1(line 26) the Hoare annotation is: (and (<= 0 main_~x~0) (<= main_~x~0 100)) [2022-04-14 17:24:53,215 INFO L878 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (and (<= 0 main_~x~0) (<= 0 main_~a~0) (= main_~q~0 (* main_~y~0 main_~x~0)) (<= main_~x~0 100) (<= 1 main_~y~0) (= (* main_~b~0 main_~a~0) 0)) [2022-04-14 17:24:53,215 INFO L885 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: true [2022-04-14 17:24:53,215 INFO L882 garLoopResultBuilder]: For program point L24-1(line 24) no Hoare annotation was computed. [2022-04-14 17:24:53,215 INFO L882 garLoopResultBuilder]: For program point L47(lines 47 54) no Hoare annotation was computed. [2022-04-14 17:24:53,215 INFO L878 garLoopResultBuilder]: At program point L47-2(lines 34 55) the Hoare annotation is: (and (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (<= 0 main_~a~0) (<= main_~x~0 100) (<= 1 main_~y~0)) [2022-04-14 17:24:53,215 INFO L878 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (and (<= 0 main_~x~0) (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (<= 0 main_~a~0) (<= main_~x~0 100) (<= 1 main_~y~0)) [2022-04-14 17:24:53,215 INFO L882 garLoopResultBuilder]: For program point L35-1(lines 34 55) no Hoare annotation was computed. [2022-04-14 17:24:53,215 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-14 17:24:53,215 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-14 17:24:53,215 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-14 17:24:53,215 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-14 17:24:53,216 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-14 17:24:53,216 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-14 17:24:53,216 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-14 17:24:53,216 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-14 17:24:53,216 INFO L882 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-04-14 17:24:53,216 INFO L882 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-04-14 17:24:53,216 INFO L882 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-04-14 17:24:53,216 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-04-14 17:24:53,216 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-04-14 17:24:53,218 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-14 17:24:53,219 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 17:24:53,224 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-14 17:24:53,224 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-14 17:24:53,225 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-14 17:24:53,225 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-14 17:24:53,225 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-14 17:24:53,225 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-14 17:24:53,225 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-14 17:24:53,225 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-14 17:24:53,226 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-14 17:24:53,226 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-14 17:24:53,226 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-14 17:24:53,226 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-14 17:24:53,226 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-14 17:24:53,226 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-14 17:24:53,226 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-14 17:24:53,226 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-14 17:24:53,226 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-14 17:24:53,226 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-14 17:24:53,226 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-14 17:24:53,226 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-14 17:24:53,226 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-14 17:24:53,226 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-14 17:24:53,227 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 17:24:53,227 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 17:24:53,227 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 17:24:53,227 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-14 17:24:53,227 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-04-14 17:24:53,227 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-14 17:24:53,227 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-14 17:24:53,227 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-04-14 17:24:53,227 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-04-14 17:24:53,231 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-14 17:24:53,231 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-14 17:24:53,231 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-14 17:24:53,231 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-14 17:24:53,231 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-14 17:24:53,231 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-14 17:24:53,231 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-14 17:24:53,231 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-14 17:24:53,231 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-14 17:24:53,231 INFO L163 areAnnotationChecker]: CFG has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-14 17:24:53,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 05:24:53 BoogieIcfgContainer [2022-04-14 17:24:53,240 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 17:24:53,241 INFO L158 Benchmark]: Toolchain (without parser) took 76021.73ms. Allocated memory was 174.1MB in the beginning and 210.8MB in the end (delta: 36.7MB). Free memory was 122.8MB in the beginning and 93.8MB in the end (delta: 29.0MB). Peak memory consumption was 66.3MB. Max. memory is 8.0GB. [2022-04-14 17:24:53,241 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 174.1MB. Free memory is still 139.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 17:24:53,242 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.02ms. Allocated memory is still 174.1MB. Free memory was 122.6MB in the beginning and 147.7MB in the end (delta: -25.1MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. [2022-04-14 17:24:53,243 INFO L158 Benchmark]: Boogie Preprocessor took 50.21ms. Allocated memory is still 174.1MB. Free memory was 147.7MB in the beginning and 146.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 17:24:53,243 INFO L158 Benchmark]: RCFGBuilder took 345.81ms. Allocated memory is still 174.1MB. Free memory was 146.2MB in the beginning and 133.3MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-14 17:24:53,244 INFO L158 Benchmark]: TraceAbstraction took 75324.26ms. Allocated memory was 174.1MB in the beginning and 210.8MB in the end (delta: 36.7MB). Free memory was 132.8MB in the beginning and 93.8MB in the end (delta: 39.0MB). Peak memory consumption was 76.3MB. Max. memory is 8.0GB. [2022-04-14 17:24:53,246 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 174.1MB. Free memory is still 139.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 297.02ms. Allocated memory is still 174.1MB. Free memory was 122.6MB in the beginning and 147.7MB in the end (delta: -25.1MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.21ms. Allocated memory is still 174.1MB. Free memory was 147.7MB in the beginning and 146.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 345.81ms. Allocated memory is still 174.1MB. Free memory was 146.2MB in the beginning and 133.3MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 75324.26ms. Allocated memory was 174.1MB in the beginning and 210.8MB in the end (delta: 36.7MB). Free memory was 132.8MB in the beginning and 93.8MB in the end (delta: 39.0MB). Peak memory consumption was 76.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 75.2s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 95 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 86 mSDsluCounter, 527 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 387 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 453 IncrementalHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 140 mSDtfsCounter, 453 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 337 GetRequests, 280 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=3, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 27 PreInvPairs, 37 NumberOfFragments, 119 HoareAnnotationTreeSize, 27 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 438 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 58.6s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 333 ConstructedInterpolants, 0 QuantifiedInterpolants, 957 SizeOfPredicates, 18 NumberOfNonLiveVariables, 459 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 173/196 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: 34]: Loop Invariant Derived loop invariant: (((0 <= x && q + b * a * p == y * x) && 0 <= a) && x <= 100) && 1 <= y RESULT: Ultimate proved your program to be correct! [2022-04-14 17:24:53,270 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...