/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/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound100.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 14:27:00,581 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 14:27:00,583 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 14:27:00,625 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 14:27:00,625 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 14:27:00,626 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 14:27:00,629 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 14:27:00,631 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 14:27:00,633 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 14:27:00,637 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 14:27:00,637 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 14:27:00,639 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 14:27:00,639 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 14:27:00,641 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 14:27:00,642 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 14:27:00,644 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 14:27:00,645 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 14:27:00,645 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 14:27:00,647 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 14:27:00,652 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 14:27:00,654 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 14:27:00,654 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 14:27:00,655 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 14:27:00,656 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 14:27:00,657 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 14:27:00,663 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 14:27:00,663 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 14:27:00,663 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 14:27:00,664 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 14:27:00,664 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 14:27:00,665 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 14:27:00,666 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 14:27:00,667 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 14:27:00,668 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 14:27:00,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 14:27:00,669 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 14:27:00,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 14:27:00,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 14:27:00,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 14:27:00,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 14:27:00,670 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 14:27:00,672 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 14:27:00,673 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 14:27:00,681 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 14:27:00,682 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 14:27:00,683 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 14:27:00,683 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 14:27:00,683 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 14:27:00,683 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 14:27:00,683 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 14:27:00,683 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 14:27:00,683 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 14:27:00,684 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 14:27:00,684 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 14:27:00,684 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 14:27:00,685 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 14:27:00,685 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 14:27:00,685 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 14:27:00,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 14:27:00,685 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 14:27:00,685 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 14:27:00,685 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 14:27:00,685 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 14:27:00,686 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 14:27:00,686 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 14:27:00,686 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-15 14:27:00,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 14:27:00,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 14:27:00,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 14:27:00,925 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 14:27:00,926 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 14:27:00,927 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound100.i [2022-04-15 14:27:00,986 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b67b96753/30b3c1aa8c0440db8e822e45371b1dbb/FLAGc5dcd4e7d [2022-04-15 14:27:01,379 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 14:27:01,380 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound100.i [2022-04-15 14:27:01,387 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b67b96753/30b3c1aa8c0440db8e822e45371b1dbb/FLAGc5dcd4e7d [2022-04-15 14:27:01,782 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b67b96753/30b3c1aa8c0440db8e822e45371b1dbb [2022-04-15 14:27:01,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 14:27:01,785 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 14:27:01,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 14:27:01,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 14:27:01,791 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 14:27:01,791 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:27:01" (1/1) ... [2022-04-15 14:27:01,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64b7a311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:27:01, skipping insertion in model container [2022-04-15 14:27:01,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:27:01" (1/1) ... [2022-04-15 14:27:01,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 14:27:01,810 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 14:27:01,954 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/divbin_unwindbound100.i[950,963] [2022-04-15 14:27:01,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 14:27:01,992 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 14:27:02,002 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/divbin_unwindbound100.i[950,963] [2022-04-15 14:27:02,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 14:27:02,017 INFO L208 MainTranslator]: Completed translation [2022-04-15 14:27:02,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:27:02 WrapperNode [2022-04-15 14:27:02,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 14:27:02,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 14:27:02,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 14:27:02,019 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 14:27:02,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:27:02" (1/1) ... [2022-04-15 14:27:02,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:27:02" (1/1) ... [2022-04-15 14:27:02,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:27:02" (1/1) ... [2022-04-15 14:27:02,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:27:02" (1/1) ... [2022-04-15 14:27:02,050 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:27:02" (1/1) ... [2022-04-15 14:27:02,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:27:02" (1/1) ... [2022-04-15 14:27:02,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:27:02" (1/1) ... [2022-04-15 14:27:02,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 14:27:02,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 14:27:02,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 14:27:02,066 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 14:27:02,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:27:02" (1/1) ... [2022-04-15 14:27:02,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 14:27:02,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:27:02,092 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-15 14:27:02,101 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-15 14:27:02,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 14:27:02,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 14:27:02,131 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 14:27:02,131 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 14:27:02,132 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 14:27:02,132 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 14:27:02,132 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 14:27:02,132 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 14:27:02,132 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 14:27:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 14:27:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 14:27:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 14:27:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 14:27:02,133 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 14:27:02,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 14:27:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 14:27:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 14:27:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 14:27:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 14:27:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 14:27:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 14:27:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 14:27:02,211 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 14:27:02,213 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 14:27:02,404 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 14:27:02,412 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 14:27:02,412 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 14:27:02,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:27:02 BoogieIcfgContainer [2022-04-15 14:27:02,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 14:27:02,415 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 14:27:02,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 14:27:02,422 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 14:27:02,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 02:27:01" (1/3) ... [2022-04-15 14:27:02,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f3c018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:27:02, skipping insertion in model container [2022-04-15 14:27:02,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:27:02" (2/3) ... [2022-04-15 14:27:02,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f3c018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:27:02, skipping insertion in model container [2022-04-15 14:27:02,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:27:02" (3/3) ... [2022-04-15 14:27:02,424 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound100.i [2022-04-15 14:27:02,427 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 14:27:02,427 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 14:27:02,460 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 14:27:02,464 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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-15 14:27:02,464 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 14:27:02,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 14:27:02,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 14:27:02,484 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:27:02,484 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:27:02,485 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:27:02,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:27:02,488 INFO L85 PathProgramCache]: Analyzing trace with hash 878397729, now seen corresponding path program 1 times [2022-04-15 14:27:02,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:02,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1340722094] [2022-04-15 14:27:02,504 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:27:02,505 INFO L85 PathProgramCache]: Analyzing trace with hash 878397729, now seen corresponding path program 2 times [2022-04-15 14:27:02,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:27:02,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044053575] [2022-04-15 14:27:02,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:27:02,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:27:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:27:02,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 14:27:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:27:02,647 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {36#true} is VALID [2022-04-15 14:27:02,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-15 14:27:02,648 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-15 14:27:02,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 14:27:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:27:02,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-15 14:27:02,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-15 14:27:02,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-15 14:27:02,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-15 14:27:02,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 14:27:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:27:02,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-15 14:27:02,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-15 14:27:02,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-15 14:27:02,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-15 14:27:02,665 INFO L272 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 14:27:02,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {36#true} is VALID [2022-04-15 14:27:02,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-15 14:27:02,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-15 14:27:02,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret5 := main(); {36#true} is VALID [2022-04-15 14:27:02,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {36#true} is VALID [2022-04-15 14:27:02,666 INFO L272 TraceCheckUtils]: 6: Hoare triple {36#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {36#true} is VALID [2022-04-15 14:27:02,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-15 14:27:02,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-15 14:27:02,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-15 14:27:02,668 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-15 14:27:02,668 INFO L272 TraceCheckUtils]: 11: Hoare triple {37#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {36#true} is VALID [2022-04-15 14:27:02,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-15 14:27:02,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-15 14:27:02,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-15 14:27:02,669 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-15 14:27:02,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {37#false} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {37#false} is VALID [2022-04-15 14:27:02,669 INFO L290 TraceCheckUtils]: 17: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-15 14:27:02,669 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-15 14:27:02,670 INFO L272 TraceCheckUtils]: 19: Hoare triple {37#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {37#false} is VALID [2022-04-15 14:27:02,670 INFO L290 TraceCheckUtils]: 20: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2022-04-15 14:27:02,670 INFO L290 TraceCheckUtils]: 21: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2022-04-15 14:27:02,670 INFO L290 TraceCheckUtils]: 22: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-04-15 14:27:02,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 14:27:02,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:27:02,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044053575] [2022-04-15 14:27:02,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044053575] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:02,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:02,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:27:02,674 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:27:02,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1340722094] [2022-04-15 14:27:02,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1340722094] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:02,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:02,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:27:02,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588470750] [2022-04-15 14:27:02,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:27:02,680 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 14:27:02,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:27:02,684 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:02,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:02,706 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 14:27:02,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:02,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 14:27:02,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 14:27:02,733 INFO L87 Difference]: Start difference. First operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:02,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:02,902 INFO L93 Difference]: Finished difference Result 60 states and 84 transitions. [2022-04-15 14:27:02,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 14:27:02,903 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 14:27:02,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:27:02,904 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:02,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-15 14:27:02,911 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:02,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-15 14:27:02,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 84 transitions. [2022-04-15 14:27:03,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:03,023 INFO L225 Difference]: With dead ends: 60 [2022-04-15 14:27:03,023 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 14:27:03,025 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 14:27:03,028 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:27:03,028 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 40 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:27:03,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 14:27:03,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-04-15 14:27:03,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:27:03,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:03,055 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:03,055 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:03,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:03,058 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-15 14:27:03,059 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-15 14:27:03,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:03,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:03,060 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-15 14:27:03,060 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-15 14:27:03,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:03,062 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-15 14:27:03,062 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-15 14:27:03,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:03,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:03,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:27:03,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:27:03,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:03,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-04-15 14:27:03,067 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 23 [2022-04-15 14:27:03,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:27:03,067 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-04-15 14:27:03,067 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:03,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 34 transitions. [2022-04-15 14:27:03,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:03,101 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-15 14:27:03,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 14:27:03,102 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:27:03,102 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:27:03,103 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 14:27:03,103 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:27:03,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:27:03,104 INFO L85 PathProgramCache]: Analyzing trace with hash 994169231, now seen corresponding path program 1 times [2022-04-15 14:27:03,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:03,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [278350035] [2022-04-15 14:27:03,105 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:27:03,105 INFO L85 PathProgramCache]: Analyzing trace with hash 994169231, now seen corresponding path program 2 times [2022-04-15 14:27:03,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:27:03,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683060718] [2022-04-15 14:27:03,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:27:03,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:27:03,125 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:27:03,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1323192866] [2022-04-15 14:27:03,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:27:03,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:27:03,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:27:03,127 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-15 14:27:03,161 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-15 14:27:03,189 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 14:27:03,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:27:03,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 14:27:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:27:03,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:27:03,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {286#true} call ULTIMATE.init(); {286#true} is VALID [2022-04-15 14:27:03,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {286#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(9, 2);~counter~0 := 0; {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:03,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:03,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {294#(<= ~counter~0 0)} {286#true} #89#return; {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:03,369 INFO L272 TraceCheckUtils]: 4: Hoare triple {294#(<= ~counter~0 0)} call #t~ret5 := main(); {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:03,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {294#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:03,371 INFO L272 TraceCheckUtils]: 6: Hoare triple {294#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:03,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#(<= ~counter~0 0)} ~cond := #in~cond; {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:03,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {294#(<= ~counter~0 0)} assume !(0 == ~cond); {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:03,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:03,374 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {294#(<= ~counter~0 0)} {294#(<= ~counter~0 0)} #81#return; {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:03,375 INFO L272 TraceCheckUtils]: 11: Hoare triple {294#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:03,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {294#(<= ~counter~0 0)} ~cond := #in~cond; {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:03,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {294#(<= ~counter~0 0)} assume !(0 == ~cond); {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:03,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:03,379 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {294#(<= ~counter~0 0)} {294#(<= ~counter~0 0)} #83#return; {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:03,380 INFO L290 TraceCheckUtils]: 16: Hoare triple {294#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:03,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {294#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {343#(<= |main_#t~post3| 0)} is VALID [2022-04-15 14:27:03,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {343#(<= |main_#t~post3| 0)} assume !(#t~post3 < 100);havoc #t~post3; {287#false} is VALID [2022-04-15 14:27:03,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {287#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {287#false} is VALID [2022-04-15 14:27:03,382 INFO L290 TraceCheckUtils]: 20: Hoare triple {287#false} assume !(#t~post4 < 100);havoc #t~post4; {287#false} is VALID [2022-04-15 14:27:03,384 INFO L272 TraceCheckUtils]: 21: Hoare triple {287#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {287#false} is VALID [2022-04-15 14:27:03,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {287#false} ~cond := #in~cond; {287#false} is VALID [2022-04-15 14:27:03,385 INFO L290 TraceCheckUtils]: 23: Hoare triple {287#false} assume 0 == ~cond; {287#false} is VALID [2022-04-15 14:27:03,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {287#false} assume !false; {287#false} is VALID [2022-04-15 14:27:03,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 14:27:03,385 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:27:03,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:27:03,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683060718] [2022-04-15 14:27:03,386 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:27:03,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323192866] [2022-04-15 14:27:03,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323192866] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:03,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:03,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 14:27:03,388 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:27:03,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [278350035] [2022-04-15 14:27:03,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [278350035] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:03,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:03,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 14:27:03,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040895153] [2022-04-15 14:27:03,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:27:03,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-15 14:27:03,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:27:03,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:03,413 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-15 14:27:03,413 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 14:27:03,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:03,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 14:27:03,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 14:27:03,414 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:03,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:03,491 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-04-15 14:27:03,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 14:27:03,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-15 14:27:03,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:27:03,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:03,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-15 14:27:03,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:03,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-15 14:27:03,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2022-04-15 14:27:03,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:03,557 INFO L225 Difference]: With dead ends: 42 [2022-04-15 14:27:03,557 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 14:27:03,557 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 14:27:03,558 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:27:03,559 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:27:03,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 14:27:03,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-15 14:27:03,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:27:03,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:03,572 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:03,572 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:03,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:03,574 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-15 14:27:03,575 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-15 14:27:03,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:03,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:03,575 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-04-15 14:27:03,576 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-04-15 14:27:03,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:03,578 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-15 14:27:03,578 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-15 14:27:03,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:03,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:03,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:27:03,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:27:03,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:03,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-04-15 14:27:03,580 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 25 [2022-04-15 14:27:03,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:27:03,581 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-04-15 14:27:03,581 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:03,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 36 transitions. [2022-04-15 14:27:03,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:03,615 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-15 14:27:03,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 14:27:03,616 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:27:03,616 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:27:03,651 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-15 14:27:03,840 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-15 14:27:03,841 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:27:03,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:27:03,841 INFO L85 PathProgramCache]: Analyzing trace with hash 422434646, now seen corresponding path program 1 times [2022-04-15 14:27:03,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:03,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [519121681] [2022-04-15 14:27:03,842 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:27:03,842 INFO L85 PathProgramCache]: Analyzing trace with hash 422434646, now seen corresponding path program 2 times [2022-04-15 14:27:03,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:27:03,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116304741] [2022-04-15 14:27:03,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:27:03,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:27:03,865 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:27:03,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [456362437] [2022-04-15 14:27:03,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:27:03,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:27:03,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:27:03,869 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-15 14:27:03,870 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-15 14:27:03,906 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 14:27:03,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:27:03,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 14:27:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:27:03,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:27:04,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {568#true} is VALID [2022-04-15 14:27:04,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {568#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(9, 2);~counter~0 := 0; {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:04,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:04,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {576#(<= ~counter~0 0)} {568#true} #89#return; {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:04,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {576#(<= ~counter~0 0)} call #t~ret5 := main(); {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:04,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {576#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:04,062 INFO L272 TraceCheckUtils]: 6: Hoare triple {576#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:04,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {576#(<= ~counter~0 0)} ~cond := #in~cond; {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:04,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {576#(<= ~counter~0 0)} assume !(0 == ~cond); {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:04,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:04,064 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {576#(<= ~counter~0 0)} {576#(<= ~counter~0 0)} #81#return; {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:04,065 INFO L272 TraceCheckUtils]: 11: Hoare triple {576#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:04,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {576#(<= ~counter~0 0)} ~cond := #in~cond; {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:04,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {576#(<= ~counter~0 0)} assume !(0 == ~cond); {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:04,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:04,067 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {576#(<= ~counter~0 0)} {576#(<= ~counter~0 0)} #83#return; {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:04,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {576#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:04,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {576#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {625#(<= ~counter~0 1)} is VALID [2022-04-15 14:27:04,068 INFO L290 TraceCheckUtils]: 18: Hoare triple {625#(<= ~counter~0 1)} assume !!(#t~post3 < 100);havoc #t~post3; {625#(<= ~counter~0 1)} is VALID [2022-04-15 14:27:04,069 INFO L290 TraceCheckUtils]: 19: Hoare triple {625#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {625#(<= ~counter~0 1)} is VALID [2022-04-15 14:27:04,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {625#(<= ~counter~0 1)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {635#(<= |main_#t~post4| 1)} is VALID [2022-04-15 14:27:04,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {635#(<= |main_#t~post4| 1)} assume !(#t~post4 < 100);havoc #t~post4; {569#false} is VALID [2022-04-15 14:27:04,070 INFO L272 TraceCheckUtils]: 22: Hoare triple {569#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {569#false} is VALID [2022-04-15 14:27:04,070 INFO L290 TraceCheckUtils]: 23: Hoare triple {569#false} ~cond := #in~cond; {569#false} is VALID [2022-04-15 14:27:04,070 INFO L290 TraceCheckUtils]: 24: Hoare triple {569#false} assume 0 == ~cond; {569#false} is VALID [2022-04-15 14:27:04,071 INFO L290 TraceCheckUtils]: 25: Hoare triple {569#false} assume !false; {569#false} is VALID [2022-04-15 14:27:04,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 14:27:04,071 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:27:04,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:27:04,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116304741] [2022-04-15 14:27:04,072 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:27:04,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456362437] [2022-04-15 14:27:04,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456362437] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:04,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:04,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:27:04,072 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:27:04,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [519121681] [2022-04-15 14:27:04,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [519121681] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:04,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:04,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:27:04,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233492747] [2022-04-15 14:27:04,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:27:04,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-15 14:27:04,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:27:04,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:04,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:04,092 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 14:27:04,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:04,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 14:27:04,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 14:27:04,093 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:04,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:04,186 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-15 14:27:04,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 14:27:04,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-15 14:27:04,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:27:04,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:04,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-15 14:27:04,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:04,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-15 14:27:04,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-04-15 14:27:04,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:04,232 INFO L225 Difference]: With dead ends: 41 [2022-04-15 14:27:04,232 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 14:27:04,232 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 14:27:04,233 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:27:04,234 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 82 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:27:04,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 14:27:04,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-15 14:27:04,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:27:04,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:04,248 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:04,248 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:04,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:04,250 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-15 14:27:04,250 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-15 14:27:04,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:04,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:04,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-15 14:27:04,251 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-15 14:27:04,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:04,253 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-15 14:27:04,253 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-15 14:27:04,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:04,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:04,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:27:04,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:27:04,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:04,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-04-15 14:27:04,255 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 26 [2022-04-15 14:27:04,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:27:04,256 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-04-15 14:27:04,256 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:04,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 40 transitions. [2022-04-15 14:27:04,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:04,293 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-04-15 14:27:04,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 14:27:04,294 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:27:04,294 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:27:04,320 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-15 14:27:04,507 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-15 14:27:04,508 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:27:04,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:27:04,508 INFO L85 PathProgramCache]: Analyzing trace with hash 424222106, now seen corresponding path program 1 times [2022-04-15 14:27:04,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:04,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1001562837] [2022-04-15 14:27:04,509 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:27:04,509 INFO L85 PathProgramCache]: Analyzing trace with hash 424222106, now seen corresponding path program 2 times [2022-04-15 14:27:04,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:27:04,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115247231] [2022-04-15 14:27:04,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:27:04,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:27:04,527 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:27:04,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [736259335] [2022-04-15 14:27:04,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:27:04,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:27:04,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:27:04,529 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-15 14:27:04,547 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-15 14:27:04,593 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 14:27:04,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:27:04,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 14:27:04,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:27:04,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:27:05,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {866#true} call ULTIMATE.init(); {866#true} is VALID [2022-04-15 14:27:05,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {866#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(9, 2);~counter~0 := 0; {866#true} is VALID [2022-04-15 14:27:05,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-15 14:27:05,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {866#true} {866#true} #89#return; {866#true} is VALID [2022-04-15 14:27:05,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {866#true} call #t~ret5 := main(); {866#true} is VALID [2022-04-15 14:27:05,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {866#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {866#true} is VALID [2022-04-15 14:27:05,102 INFO L272 TraceCheckUtils]: 6: Hoare triple {866#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {866#true} is VALID [2022-04-15 14:27:05,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {866#true} ~cond := #in~cond; {866#true} is VALID [2022-04-15 14:27:05,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {866#true} assume !(0 == ~cond); {866#true} is VALID [2022-04-15 14:27:05,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-15 14:27:05,103 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {866#true} {866#true} #81#return; {866#true} is VALID [2022-04-15 14:27:05,103 INFO L272 TraceCheckUtils]: 11: Hoare triple {866#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {866#true} is VALID [2022-04-15 14:27:05,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {866#true} ~cond := #in~cond; {866#true} is VALID [2022-04-15 14:27:05,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {866#true} assume !(0 == ~cond); {866#true} is VALID [2022-04-15 14:27:05,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-15 14:27:05,104 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {866#true} {866#true} #83#return; {866#true} is VALID [2022-04-15 14:27:05,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {866#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:27:05,107 INFO L290 TraceCheckUtils]: 17: Hoare triple {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:27:05,108 INFO L290 TraceCheckUtils]: 18: Hoare triple {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post3 < 100);havoc #t~post3; {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:27:05,108 INFO L290 TraceCheckUtils]: 19: Hoare triple {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:27:05,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:27:05,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post4 < 100);havoc #t~post4; {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:27:05,110 INFO L272 TraceCheckUtils]: 22: Hoare triple {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {939#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:27:05,111 INFO L290 TraceCheckUtils]: 23: Hoare triple {939#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {943#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:27:05,111 INFO L290 TraceCheckUtils]: 24: Hoare triple {943#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {867#false} is VALID [2022-04-15 14:27:05,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {867#false} assume !false; {867#false} is VALID [2022-04-15 14:27:05,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 14:27:05,112 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:27:05,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:27:05,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115247231] [2022-04-15 14:27:05,113 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:27:05,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736259335] [2022-04-15 14:27:05,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736259335] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:05,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:05,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 14:27:05,113 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:27:05,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1001562837] [2022-04-15 14:27:05,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1001562837] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:05,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:05,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 14:27:05,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33588237] [2022-04-15 14:27:05,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:27:05,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-15 14:27:05,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:27:05,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 14:27:05,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:05,135 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 14:27:05,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:05,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 14:27:05,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 14:27:05,136 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 14:27:07,359 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 14:27:07,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:07,473 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-04-15 14:27:07,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 14:27:07,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-15 14:27:07,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:27:07,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 14:27:07,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-15 14:27:07,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 14:27:07,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-15 14:27:07,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2022-04-15 14:27:07,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:07,549 INFO L225 Difference]: With dead ends: 50 [2022-04-15 14:27:07,549 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 14:27:07,549 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-15 14:27:07,550 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 14:27:07,551 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 104 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 14:27:07,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 14:27:07,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2022-04-15 14:27:07,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:27:07,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:07,586 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:07,587 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:07,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:07,589 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-04-15 14:27:07,589 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-04-15 14:27:07,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:07,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:07,590 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 46 states. [2022-04-15 14:27:07,590 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 46 states. [2022-04-15 14:27:07,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:07,592 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-04-15 14:27:07,592 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-04-15 14:27:07,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:07,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:07,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:27:07,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:27:07,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:07,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-15 14:27:07,595 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 26 [2022-04-15 14:27:07,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:27:07,595 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-15 14:27:07,595 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 14:27:07,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 46 transitions. [2022-04-15 14:27:07,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:07,663 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-15 14:27:07,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 14:27:07,664 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:27:07,664 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:27:07,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 14:27:07,886 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-15 14:27:07,886 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:27:07,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:27:07,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1733722638, now seen corresponding path program 1 times [2022-04-15 14:27:07,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:07,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1106417096] [2022-04-15 14:27:07,888 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:27:07,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1733722638, now seen corresponding path program 2 times [2022-04-15 14:27:07,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:27:07,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101611658] [2022-04-15 14:27:07,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:27:07,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:27:07,915 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:27:07,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [370361946] [2022-04-15 14:27:07,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:27:07,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:27:07,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:27:07,925 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-15 14:27:07,926 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-15 14:27:07,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:27:07,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:27:07,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 14:27:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:27:07,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:27:08,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {1221#true} call ULTIMATE.init(); {1221#true} is VALID [2022-04-15 14:27:08,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {1221#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(9, 2);~counter~0 := 0; {1229#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:08,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {1229#(<= ~counter~0 0)} assume true; {1229#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:08,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1229#(<= ~counter~0 0)} {1221#true} #89#return; {1229#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:08,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {1229#(<= ~counter~0 0)} call #t~ret5 := main(); {1229#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:08,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {1229#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1229#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:08,199 INFO L272 TraceCheckUtils]: 6: Hoare triple {1229#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1229#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:08,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {1229#(<= ~counter~0 0)} ~cond := #in~cond; {1229#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:08,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {1229#(<= ~counter~0 0)} assume !(0 == ~cond); {1229#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:08,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {1229#(<= ~counter~0 0)} assume true; {1229#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:08,212 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1229#(<= ~counter~0 0)} {1229#(<= ~counter~0 0)} #81#return; {1229#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:08,212 INFO L272 TraceCheckUtils]: 11: Hoare triple {1229#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1229#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:08,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {1229#(<= ~counter~0 0)} ~cond := #in~cond; {1229#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:08,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {1229#(<= ~counter~0 0)} assume !(0 == ~cond); {1229#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:08,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {1229#(<= ~counter~0 0)} assume true; {1229#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:08,214 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1229#(<= ~counter~0 0)} {1229#(<= ~counter~0 0)} #83#return; {1229#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:08,215 INFO L290 TraceCheckUtils]: 16: Hoare triple {1229#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1229#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:08,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {1229#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1278#(<= ~counter~0 1)} is VALID [2022-04-15 14:27:08,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {1278#(<= ~counter~0 1)} assume !!(#t~post3 < 100);havoc #t~post3; {1278#(<= ~counter~0 1)} is VALID [2022-04-15 14:27:08,216 INFO L290 TraceCheckUtils]: 19: Hoare triple {1278#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1278#(<= ~counter~0 1)} is VALID [2022-04-15 14:27:08,217 INFO L290 TraceCheckUtils]: 20: Hoare triple {1278#(<= ~counter~0 1)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1288#(<= ~counter~0 2)} is VALID [2022-04-15 14:27:08,217 INFO L290 TraceCheckUtils]: 21: Hoare triple {1288#(<= ~counter~0 2)} assume !!(#t~post4 < 100);havoc #t~post4; {1288#(<= ~counter~0 2)} is VALID [2022-04-15 14:27:08,218 INFO L272 TraceCheckUtils]: 22: Hoare triple {1288#(<= ~counter~0 2)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1288#(<= ~counter~0 2)} is VALID [2022-04-15 14:27:08,218 INFO L290 TraceCheckUtils]: 23: Hoare triple {1288#(<= ~counter~0 2)} ~cond := #in~cond; {1288#(<= ~counter~0 2)} is VALID [2022-04-15 14:27:08,219 INFO L290 TraceCheckUtils]: 24: Hoare triple {1288#(<= ~counter~0 2)} assume !(0 == ~cond); {1288#(<= ~counter~0 2)} is VALID [2022-04-15 14:27:08,219 INFO L290 TraceCheckUtils]: 25: Hoare triple {1288#(<= ~counter~0 2)} assume true; {1288#(<= ~counter~0 2)} is VALID [2022-04-15 14:27:08,220 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1288#(<= ~counter~0 2)} {1288#(<= ~counter~0 2)} #85#return; {1288#(<= ~counter~0 2)} is VALID [2022-04-15 14:27:08,220 INFO L290 TraceCheckUtils]: 27: Hoare triple {1288#(<= ~counter~0 2)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1288#(<= ~counter~0 2)} is VALID [2022-04-15 14:27:08,221 INFO L290 TraceCheckUtils]: 28: Hoare triple {1288#(<= ~counter~0 2)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1288#(<= ~counter~0 2)} is VALID [2022-04-15 14:27:08,221 INFO L290 TraceCheckUtils]: 29: Hoare triple {1288#(<= ~counter~0 2)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1316#(<= |main_#t~post4| 2)} is VALID [2022-04-15 14:27:08,222 INFO L290 TraceCheckUtils]: 30: Hoare triple {1316#(<= |main_#t~post4| 2)} assume !(#t~post4 < 100);havoc #t~post4; {1222#false} is VALID [2022-04-15 14:27:08,222 INFO L272 TraceCheckUtils]: 31: Hoare triple {1222#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1222#false} is VALID [2022-04-15 14:27:08,222 INFO L290 TraceCheckUtils]: 32: Hoare triple {1222#false} ~cond := #in~cond; {1222#false} is VALID [2022-04-15 14:27:08,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {1222#false} assume 0 == ~cond; {1222#false} is VALID [2022-04-15 14:27:08,222 INFO L290 TraceCheckUtils]: 34: Hoare triple {1222#false} assume !false; {1222#false} is VALID [2022-04-15 14:27:08,223 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 14:27:08,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:27:08,451 INFO L290 TraceCheckUtils]: 34: Hoare triple {1222#false} assume !false; {1222#false} is VALID [2022-04-15 14:27:08,451 INFO L290 TraceCheckUtils]: 33: Hoare triple {1222#false} assume 0 == ~cond; {1222#false} is VALID [2022-04-15 14:27:08,452 INFO L290 TraceCheckUtils]: 32: Hoare triple {1222#false} ~cond := #in~cond; {1222#false} is VALID [2022-04-15 14:27:08,452 INFO L272 TraceCheckUtils]: 31: Hoare triple {1222#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1222#false} is VALID [2022-04-15 14:27:08,452 INFO L290 TraceCheckUtils]: 30: Hoare triple {1344#(< |main_#t~post4| 100)} assume !(#t~post4 < 100);havoc #t~post4; {1222#false} is VALID [2022-04-15 14:27:08,452 INFO L290 TraceCheckUtils]: 29: Hoare triple {1348#(< ~counter~0 100)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1344#(< |main_#t~post4| 100)} is VALID [2022-04-15 14:27:08,454 INFO L290 TraceCheckUtils]: 28: Hoare triple {1348#(< ~counter~0 100)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1348#(< ~counter~0 100)} is VALID [2022-04-15 14:27:08,454 INFO L290 TraceCheckUtils]: 27: Hoare triple {1348#(< ~counter~0 100)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1348#(< ~counter~0 100)} is VALID [2022-04-15 14:27:08,455 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1221#true} {1348#(< ~counter~0 100)} #85#return; {1348#(< ~counter~0 100)} is VALID [2022-04-15 14:27:08,455 INFO L290 TraceCheckUtils]: 25: Hoare triple {1221#true} assume true; {1221#true} is VALID [2022-04-15 14:27:08,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {1221#true} assume !(0 == ~cond); {1221#true} is VALID [2022-04-15 14:27:08,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {1221#true} ~cond := #in~cond; {1221#true} is VALID [2022-04-15 14:27:08,456 INFO L272 TraceCheckUtils]: 22: Hoare triple {1348#(< ~counter~0 100)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1221#true} is VALID [2022-04-15 14:27:08,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {1348#(< ~counter~0 100)} assume !!(#t~post4 < 100);havoc #t~post4; {1348#(< ~counter~0 100)} is VALID [2022-04-15 14:27:08,457 INFO L290 TraceCheckUtils]: 20: Hoare triple {1376#(< ~counter~0 99)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1348#(< ~counter~0 100)} is VALID [2022-04-15 14:27:08,457 INFO L290 TraceCheckUtils]: 19: Hoare triple {1376#(< ~counter~0 99)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1376#(< ~counter~0 99)} is VALID [2022-04-15 14:27:08,458 INFO L290 TraceCheckUtils]: 18: Hoare triple {1376#(< ~counter~0 99)} assume !!(#t~post3 < 100);havoc #t~post3; {1376#(< ~counter~0 99)} is VALID [2022-04-15 14:27:08,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {1386#(< ~counter~0 98)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1376#(< ~counter~0 99)} is VALID [2022-04-15 14:27:08,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {1386#(< ~counter~0 98)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1386#(< ~counter~0 98)} is VALID [2022-04-15 14:27:08,459 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1221#true} {1386#(< ~counter~0 98)} #83#return; {1386#(< ~counter~0 98)} is VALID [2022-04-15 14:27:08,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {1221#true} assume true; {1221#true} is VALID [2022-04-15 14:27:08,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {1221#true} assume !(0 == ~cond); {1221#true} is VALID [2022-04-15 14:27:08,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {1221#true} ~cond := #in~cond; {1221#true} is VALID [2022-04-15 14:27:08,460 INFO L272 TraceCheckUtils]: 11: Hoare triple {1386#(< ~counter~0 98)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1221#true} is VALID [2022-04-15 14:27:08,460 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1221#true} {1386#(< ~counter~0 98)} #81#return; {1386#(< ~counter~0 98)} is VALID [2022-04-15 14:27:08,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {1221#true} assume true; {1221#true} is VALID [2022-04-15 14:27:08,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {1221#true} assume !(0 == ~cond); {1221#true} is VALID [2022-04-15 14:27:08,461 INFO L290 TraceCheckUtils]: 7: Hoare triple {1221#true} ~cond := #in~cond; {1221#true} is VALID [2022-04-15 14:27:08,461 INFO L272 TraceCheckUtils]: 6: Hoare triple {1386#(< ~counter~0 98)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1221#true} is VALID [2022-04-15 14:27:08,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {1386#(< ~counter~0 98)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1386#(< ~counter~0 98)} is VALID [2022-04-15 14:27:08,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {1386#(< ~counter~0 98)} call #t~ret5 := main(); {1386#(< ~counter~0 98)} is VALID [2022-04-15 14:27:08,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1386#(< ~counter~0 98)} {1221#true} #89#return; {1386#(< ~counter~0 98)} is VALID [2022-04-15 14:27:08,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {1386#(< ~counter~0 98)} assume true; {1386#(< ~counter~0 98)} is VALID [2022-04-15 14:27:08,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {1221#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(9, 2);~counter~0 := 0; {1386#(< ~counter~0 98)} is VALID [2022-04-15 14:27:08,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {1221#true} call ULTIMATE.init(); {1221#true} is VALID [2022-04-15 14:27:08,465 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 14:27:08,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:27:08,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101611658] [2022-04-15 14:27:08,466 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:27:08,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370361946] [2022-04-15 14:27:08,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370361946] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 14:27:08,467 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 14:27:08,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-15 14:27:08,467 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:27:08,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1106417096] [2022-04-15 14:27:08,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1106417096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:08,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:08,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 14:27:08,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782172330] [2022-04-15 14:27:08,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:27:08,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-15 14:27:08,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:27:08,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:08,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:08,503 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 14:27:08,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:08,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 14:27:08,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 14:27:08,505 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:08,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:08,698 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-15 14:27:08,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 14:27:08,699 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-15 14:27:08,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:27:08,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:08,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-15 14:27:08,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:08,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-15 14:27:08,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2022-04-15 14:27:08,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:08,777 INFO L225 Difference]: With dead ends: 64 [2022-04-15 14:27:08,777 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 14:27:08,777 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-15 14:27:08,778 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 14 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:27:08,779 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 115 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:27:08,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 14:27:08,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2022-04-15 14:27:08,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:27:08,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 51 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 38 states have internal predecessors, (46), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 14:27:08,825 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 51 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 38 states have internal predecessors, (46), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 14:27:08,825 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 51 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 38 states have internal predecessors, (46), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 14:27:08,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:08,828 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2022-04-15 14:27:08,828 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2022-04-15 14:27:08,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:08,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:08,829 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 38 states have internal predecessors, (46), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 57 states. [2022-04-15 14:27:08,829 INFO L87 Difference]: Start difference. First operand has 51 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 38 states have internal predecessors, (46), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 57 states. [2022-04-15 14:27:08,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:08,832 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2022-04-15 14:27:08,832 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2022-04-15 14:27:08,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:08,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:08,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:27:08,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:27:08,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 38 states have internal predecessors, (46), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 14:27:08,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2022-04-15 14:27:08,835 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 35 [2022-04-15 14:27:08,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:27:08,835 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2022-04-15 14:27:08,835 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:08,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 60 transitions. [2022-04-15 14:27:08,898 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-15 14:27:08,899 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-04-15 14:27:08,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 14:27:08,899 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:27:08,900 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:27:08,926 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-15 14:27:09,123 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-15 14:27:09,124 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:27:09,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:27:09,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1731935178, now seen corresponding path program 1 times [2022-04-15 14:27:09,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:09,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2112578318] [2022-04-15 14:27:09,125 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:27:09,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1731935178, now seen corresponding path program 2 times [2022-04-15 14:27:09,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:27:09,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361479663] [2022-04-15 14:27:09,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:27:09,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:27:09,140 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:27:09,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1468391775] [2022-04-15 14:27:09,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:27:09,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:27:09,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:27:09,142 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 14:27:09,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 14:27:09,190 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:27:09,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:27:09,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 14:27:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:27:09,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:27:09,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {1786#true} call ULTIMATE.init(); {1786#true} is VALID [2022-04-15 14:27:09,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {1786#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(9, 2);~counter~0 := 0; {1786#true} is VALID [2022-04-15 14:27:09,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {1786#true} assume true; {1786#true} is VALID [2022-04-15 14:27:09,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1786#true} {1786#true} #89#return; {1786#true} is VALID [2022-04-15 14:27:09,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {1786#true} call #t~ret5 := main(); {1786#true} is VALID [2022-04-15 14:27:09,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {1786#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1786#true} is VALID [2022-04-15 14:27:09,304 INFO L272 TraceCheckUtils]: 6: Hoare triple {1786#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1786#true} is VALID [2022-04-15 14:27:09,304 INFO L290 TraceCheckUtils]: 7: Hoare triple {1786#true} ~cond := #in~cond; {1786#true} is VALID [2022-04-15 14:27:09,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {1786#true} assume !(0 == ~cond); {1786#true} is VALID [2022-04-15 14:27:09,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {1786#true} assume true; {1786#true} is VALID [2022-04-15 14:27:09,305 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1786#true} {1786#true} #81#return; {1786#true} is VALID [2022-04-15 14:27:09,305 INFO L272 TraceCheckUtils]: 11: Hoare triple {1786#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1786#true} is VALID [2022-04-15 14:27:09,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {1786#true} ~cond := #in~cond; {1786#true} is VALID [2022-04-15 14:27:09,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {1786#true} assume !(0 == ~cond); {1786#true} is VALID [2022-04-15 14:27:09,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {1786#true} assume true; {1786#true} is VALID [2022-04-15 14:27:09,305 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1786#true} {1786#true} #83#return; {1786#true} is VALID [2022-04-15 14:27:09,319 INFO L290 TraceCheckUtils]: 16: Hoare triple {1786#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1839#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 14:27:09,319 INFO L290 TraceCheckUtils]: 17: Hoare triple {1839#(= main_~B~0 main_~b~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1839#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 14:27:09,323 INFO L290 TraceCheckUtils]: 18: Hoare triple {1839#(= main_~B~0 main_~b~0)} assume !!(#t~post3 < 100);havoc #t~post3; {1839#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 14:27:09,323 INFO L290 TraceCheckUtils]: 19: Hoare triple {1839#(= main_~B~0 main_~b~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1839#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 14:27:09,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {1839#(= main_~B~0 main_~b~0)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1839#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 14:27:09,324 INFO L290 TraceCheckUtils]: 21: Hoare triple {1839#(= main_~B~0 main_~b~0)} assume !!(#t~post4 < 100);havoc #t~post4; {1839#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 14:27:09,324 INFO L272 TraceCheckUtils]: 22: Hoare triple {1839#(= main_~B~0 main_~b~0)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1786#true} is VALID [2022-04-15 14:27:09,324 INFO L290 TraceCheckUtils]: 23: Hoare triple {1786#true} ~cond := #in~cond; {1786#true} is VALID [2022-04-15 14:27:09,324 INFO L290 TraceCheckUtils]: 24: Hoare triple {1786#true} assume !(0 == ~cond); {1786#true} is VALID [2022-04-15 14:27:09,324 INFO L290 TraceCheckUtils]: 25: Hoare triple {1786#true} assume true; {1786#true} is VALID [2022-04-15 14:27:09,325 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1786#true} {1839#(= main_~B~0 main_~b~0)} #85#return; {1839#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 14:27:09,325 INFO L290 TraceCheckUtils]: 27: Hoare triple {1839#(= main_~B~0 main_~b~0)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1787#false} is VALID [2022-04-15 14:27:09,325 INFO L290 TraceCheckUtils]: 28: Hoare triple {1787#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1787#false} is VALID [2022-04-15 14:27:09,325 INFO L290 TraceCheckUtils]: 29: Hoare triple {1787#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1787#false} is VALID [2022-04-15 14:27:09,325 INFO L290 TraceCheckUtils]: 30: Hoare triple {1787#false} assume !!(#t~post4 < 100);havoc #t~post4; {1787#false} is VALID [2022-04-15 14:27:09,325 INFO L272 TraceCheckUtils]: 31: Hoare triple {1787#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1787#false} is VALID [2022-04-15 14:27:09,326 INFO L290 TraceCheckUtils]: 32: Hoare triple {1787#false} ~cond := #in~cond; {1787#false} is VALID [2022-04-15 14:27:09,326 INFO L290 TraceCheckUtils]: 33: Hoare triple {1787#false} assume 0 == ~cond; {1787#false} is VALID [2022-04-15 14:27:09,326 INFO L290 TraceCheckUtils]: 34: Hoare triple {1787#false} assume !false; {1787#false} is VALID [2022-04-15 14:27:09,326 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 14:27:09,326 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:27:09,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:27:09,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361479663] [2022-04-15 14:27:09,326 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:27:09,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468391775] [2022-04-15 14:27:09,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468391775] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:09,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:09,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:27:09,327 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:27:09,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2112578318] [2022-04-15 14:27:09,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2112578318] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:09,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:09,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:27:09,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978660201] [2022-04-15 14:27:09,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:27:09,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-04-15 14:27:09,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:27:09,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 14:27:09,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:09,351 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 14:27:09,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:09,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 14:27:09,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 14:27:09,352 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 14:27:11,463 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 14:27:11,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:11,543 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2022-04-15 14:27:11,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 14:27:11,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-04-15 14:27:11,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:27:11,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 14:27:11,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-15 14:27:11,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 14:27:11,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-15 14:27:11,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2022-04-15 14:27:11,593 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-15 14:27:11,593 INFO L225 Difference]: With dead ends: 72 [2022-04-15 14:27:11,594 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 14:27:11,594 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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-15 14:27:11,595 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:27:11,595 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-04-15 14:27:11,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 14:27:11,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-15 14:27:11,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:27:11,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:11,619 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:11,619 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:11,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:11,621 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-15 14:27:11,621 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-15 14:27:11,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:11,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:11,621 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-04-15 14:27:11,622 INFO L87 Difference]: Start difference. First operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-04-15 14:27:11,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:11,623 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-15 14:27:11,623 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-15 14:27:11,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:11,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:11,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:27:11,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:27:11,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:11,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-04-15 14:27:11,626 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 35 [2022-04-15 14:27:11,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:27:11,626 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-04-15 14:27:11,626 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 14:27:11,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 47 transitions. [2022-04-15 14:27:11,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:11,671 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-15 14:27:11,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 14:27:11,671 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:27:11,672 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:27:11,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-15 14:27:11,879 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:27:11,879 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:27:11,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:27:11,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1874551443, now seen corresponding path program 1 times [2022-04-15 14:27:11,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:11,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1303773637] [2022-04-15 14:27:11,880 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:27:11,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1874551443, now seen corresponding path program 2 times [2022-04-15 14:27:11,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:27:11,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956057010] [2022-04-15 14:27:11,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:27:11,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:27:11,911 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:27:11,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [166875905] [2022-04-15 14:27:11,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:27:11,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:27:11,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:27:11,915 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 14:27:11,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 14:27:11,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:27:11,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:27:11,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 14:27:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:27:11,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:27:12,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {2197#true} call ULTIMATE.init(); {2197#true} is VALID [2022-04-15 14:27:12,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {2197#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(9, 2);~counter~0 := 0; {2205#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:12,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {2205#(<= ~counter~0 0)} assume true; {2205#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:12,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2205#(<= ~counter~0 0)} {2197#true} #89#return; {2205#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:12,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {2205#(<= ~counter~0 0)} call #t~ret5 := main(); {2205#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:12,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {2205#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2205#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:12,169 INFO L272 TraceCheckUtils]: 6: Hoare triple {2205#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2205#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:12,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {2205#(<= ~counter~0 0)} ~cond := #in~cond; {2205#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:12,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {2205#(<= ~counter~0 0)} assume !(0 == ~cond); {2205#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:12,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {2205#(<= ~counter~0 0)} assume true; {2205#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:12,171 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2205#(<= ~counter~0 0)} {2205#(<= ~counter~0 0)} #81#return; {2205#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:12,172 INFO L272 TraceCheckUtils]: 11: Hoare triple {2205#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2205#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:12,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {2205#(<= ~counter~0 0)} ~cond := #in~cond; {2205#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:12,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {2205#(<= ~counter~0 0)} assume !(0 == ~cond); {2205#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:12,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {2205#(<= ~counter~0 0)} assume true; {2205#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:12,173 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2205#(<= ~counter~0 0)} {2205#(<= ~counter~0 0)} #83#return; {2205#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:12,174 INFO L290 TraceCheckUtils]: 16: Hoare triple {2205#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2205#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:12,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {2205#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2254#(<= ~counter~0 1)} is VALID [2022-04-15 14:27:12,175 INFO L290 TraceCheckUtils]: 18: Hoare triple {2254#(<= ~counter~0 1)} assume !!(#t~post3 < 100);havoc #t~post3; {2254#(<= ~counter~0 1)} is VALID [2022-04-15 14:27:12,176 INFO L290 TraceCheckUtils]: 19: Hoare triple {2254#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2254#(<= ~counter~0 1)} is VALID [2022-04-15 14:27:12,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {2254#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2264#(<= |main_#t~post3| 1)} is VALID [2022-04-15 14:27:12,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {2264#(<= |main_#t~post3| 1)} assume !(#t~post3 < 100);havoc #t~post3; {2198#false} is VALID [2022-04-15 14:27:12,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {2198#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2198#false} is VALID [2022-04-15 14:27:12,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {2198#false} assume !!(#t~post4 < 100);havoc #t~post4; {2198#false} is VALID [2022-04-15 14:27:12,177 INFO L272 TraceCheckUtils]: 24: Hoare triple {2198#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2198#false} is VALID [2022-04-15 14:27:12,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {2198#false} ~cond := #in~cond; {2198#false} is VALID [2022-04-15 14:27:12,177 INFO L290 TraceCheckUtils]: 26: Hoare triple {2198#false} assume !(0 == ~cond); {2198#false} is VALID [2022-04-15 14:27:12,177 INFO L290 TraceCheckUtils]: 27: Hoare triple {2198#false} assume true; {2198#false} is VALID [2022-04-15 14:27:12,178 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2198#false} {2198#false} #85#return; {2198#false} is VALID [2022-04-15 14:27:12,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {2198#false} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {2198#false} is VALID [2022-04-15 14:27:12,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {2198#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2198#false} is VALID [2022-04-15 14:27:12,178 INFO L290 TraceCheckUtils]: 31: Hoare triple {2198#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2198#false} is VALID [2022-04-15 14:27:12,178 INFO L290 TraceCheckUtils]: 32: Hoare triple {2198#false} assume !(#t~post4 < 100);havoc #t~post4; {2198#false} is VALID [2022-04-15 14:27:12,178 INFO L272 TraceCheckUtils]: 33: Hoare triple {2198#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2198#false} is VALID [2022-04-15 14:27:12,178 INFO L290 TraceCheckUtils]: 34: Hoare triple {2198#false} ~cond := #in~cond; {2198#false} is VALID [2022-04-15 14:27:12,179 INFO L290 TraceCheckUtils]: 35: Hoare triple {2198#false} assume 0 == ~cond; {2198#false} is VALID [2022-04-15 14:27:12,179 INFO L290 TraceCheckUtils]: 36: Hoare triple {2198#false} assume !false; {2198#false} is VALID [2022-04-15 14:27:12,179 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 14:27:12,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:27:12,388 INFO L290 TraceCheckUtils]: 36: Hoare triple {2198#false} assume !false; {2198#false} is VALID [2022-04-15 14:27:12,389 INFO L290 TraceCheckUtils]: 35: Hoare triple {2198#false} assume 0 == ~cond; {2198#false} is VALID [2022-04-15 14:27:12,389 INFO L290 TraceCheckUtils]: 34: Hoare triple {2198#false} ~cond := #in~cond; {2198#false} is VALID [2022-04-15 14:27:12,389 INFO L272 TraceCheckUtils]: 33: Hoare triple {2198#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2198#false} is VALID [2022-04-15 14:27:12,389 INFO L290 TraceCheckUtils]: 32: Hoare triple {2198#false} assume !(#t~post4 < 100);havoc #t~post4; {2198#false} is VALID [2022-04-15 14:27:12,389 INFO L290 TraceCheckUtils]: 31: Hoare triple {2198#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2198#false} is VALID [2022-04-15 14:27:12,389 INFO L290 TraceCheckUtils]: 30: Hoare triple {2198#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2198#false} is VALID [2022-04-15 14:27:12,389 INFO L290 TraceCheckUtils]: 29: Hoare triple {2198#false} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {2198#false} is VALID [2022-04-15 14:27:12,390 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2197#true} {2198#false} #85#return; {2198#false} is VALID [2022-04-15 14:27:12,390 INFO L290 TraceCheckUtils]: 27: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-15 14:27:12,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-15 14:27:12,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-15 14:27:12,390 INFO L272 TraceCheckUtils]: 24: Hoare triple {2198#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2197#true} is VALID [2022-04-15 14:27:12,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {2198#false} assume !!(#t~post4 < 100);havoc #t~post4; {2198#false} is VALID [2022-04-15 14:27:12,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {2198#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2198#false} is VALID [2022-04-15 14:27:12,393 INFO L290 TraceCheckUtils]: 21: Hoare triple {2358#(< |main_#t~post3| 100)} assume !(#t~post3 < 100);havoc #t~post3; {2198#false} is VALID [2022-04-15 14:27:12,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {2362#(< ~counter~0 100)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2358#(< |main_#t~post3| 100)} is VALID [2022-04-15 14:27:12,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {2362#(< ~counter~0 100)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2362#(< ~counter~0 100)} is VALID [2022-04-15 14:27:12,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {2362#(< ~counter~0 100)} assume !!(#t~post3 < 100);havoc #t~post3; {2362#(< ~counter~0 100)} is VALID [2022-04-15 14:27:12,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {2372#(< ~counter~0 99)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2362#(< ~counter~0 100)} is VALID [2022-04-15 14:27:12,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {2372#(< ~counter~0 99)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2372#(< ~counter~0 99)} is VALID [2022-04-15 14:27:12,396 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2197#true} {2372#(< ~counter~0 99)} #83#return; {2372#(< ~counter~0 99)} is VALID [2022-04-15 14:27:12,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-15 14:27:12,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-15 14:27:12,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-15 14:27:12,396 INFO L272 TraceCheckUtils]: 11: Hoare triple {2372#(< ~counter~0 99)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2197#true} is VALID [2022-04-15 14:27:12,397 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2197#true} {2372#(< ~counter~0 99)} #81#return; {2372#(< ~counter~0 99)} is VALID [2022-04-15 14:27:12,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-15 14:27:12,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-15 14:27:12,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-15 14:27:12,397 INFO L272 TraceCheckUtils]: 6: Hoare triple {2372#(< ~counter~0 99)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2197#true} is VALID [2022-04-15 14:27:12,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {2372#(< ~counter~0 99)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2372#(< ~counter~0 99)} is VALID [2022-04-15 14:27:12,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {2372#(< ~counter~0 99)} call #t~ret5 := main(); {2372#(< ~counter~0 99)} is VALID [2022-04-15 14:27:12,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2372#(< ~counter~0 99)} {2197#true} #89#return; {2372#(< ~counter~0 99)} is VALID [2022-04-15 14:27:12,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {2372#(< ~counter~0 99)} assume true; {2372#(< ~counter~0 99)} is VALID [2022-04-15 14:27:12,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {2197#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(9, 2);~counter~0 := 0; {2372#(< ~counter~0 99)} is VALID [2022-04-15 14:27:12,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {2197#true} call ULTIMATE.init(); {2197#true} is VALID [2022-04-15 14:27:12,399 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 14:27:12,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:27:12,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956057010] [2022-04-15 14:27:12,399 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:27:12,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166875905] [2022-04-15 14:27:12,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166875905] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 14:27:12,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 14:27:12,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-15 14:27:12,400 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:27:12,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1303773637] [2022-04-15 14:27:12,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1303773637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:12,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:12,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:27:12,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130526899] [2022-04-15 14:27:12,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:27:12,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2022-04-15 14:27:12,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:27:12,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:12,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:12,424 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 14:27:12,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:12,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 14:27:12,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-15 14:27:12,425 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:12,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:12,540 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-15 14:27:12,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 14:27:12,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2022-04-15 14:27:12,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:27:12,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:12,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-15 14:27:12,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:12,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-15 14:27:12,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2022-04-15 14:27:12,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:12,588 INFO L225 Difference]: With dead ends: 63 [2022-04-15 14:27:12,588 INFO L226 Difference]: Without dead ends: 42 [2022-04-15 14:27:12,588 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-15 14:27:12,589 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:27:12,589 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 82 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:27:12,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-15 14:27:12,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-15 14:27:12,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:27:12,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:12,615 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:12,615 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:12,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:12,617 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-15 14:27:12,617 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-15 14:27:12,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:12,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:12,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 42 states. [2022-04-15 14:27:12,617 INFO L87 Difference]: Start difference. First operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 42 states. [2022-04-15 14:27:12,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:12,619 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-15 14:27:12,619 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-15 14:27:12,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:12,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:12,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:27:12,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:27:12,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:12,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2022-04-15 14:27:12,621 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 37 [2022-04-15 14:27:12,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:27:12,621 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2022-04-15 14:27:12,621 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:12,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 49 transitions. [2022-04-15 14:27:12,670 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-15 14:27:12,670 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-15 14:27:12,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 14:27:12,671 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:27:12,671 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:27:12,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 14:27:12,887 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:27:12,888 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:27:12,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:27:12,888 INFO L85 PathProgramCache]: Analyzing trace with hash 815990494, now seen corresponding path program 1 times [2022-04-15 14:27:12,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:12,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [946101808] [2022-04-15 14:27:12,889 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:27:12,889 INFO L85 PathProgramCache]: Analyzing trace with hash 815990494, now seen corresponding path program 2 times [2022-04-15 14:27:12,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:27:12,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192003100] [2022-04-15 14:27:12,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:27:12,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:27:12,912 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:27:12,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1474545690] [2022-04-15 14:27:12,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:27:12,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:27:12,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:27:12,914 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 14:27:12,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 14:27:12,956 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:27:12,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:27:12,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 14:27:12,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:27:12,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:27:13,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {2722#true} call ULTIMATE.init(); {2722#true} is VALID [2022-04-15 14:27:13,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {2722#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(9, 2);~counter~0 := 0; {2730#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:13,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {2730#(<= ~counter~0 0)} assume true; {2730#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:13,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2730#(<= ~counter~0 0)} {2722#true} #89#return; {2730#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:13,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {2730#(<= ~counter~0 0)} call #t~ret5 := main(); {2730#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:13,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {2730#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2730#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:13,244 INFO L272 TraceCheckUtils]: 6: Hoare triple {2730#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2730#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:13,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {2730#(<= ~counter~0 0)} ~cond := #in~cond; {2730#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:13,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {2730#(<= ~counter~0 0)} assume !(0 == ~cond); {2730#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:13,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {2730#(<= ~counter~0 0)} assume true; {2730#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:13,246 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2730#(<= ~counter~0 0)} {2730#(<= ~counter~0 0)} #81#return; {2730#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:13,246 INFO L272 TraceCheckUtils]: 11: Hoare triple {2730#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2730#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:13,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {2730#(<= ~counter~0 0)} ~cond := #in~cond; {2730#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:13,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {2730#(<= ~counter~0 0)} assume !(0 == ~cond); {2730#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:13,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {2730#(<= ~counter~0 0)} assume true; {2730#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:13,248 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2730#(<= ~counter~0 0)} {2730#(<= ~counter~0 0)} #83#return; {2730#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:13,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {2730#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2730#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:13,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {2730#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2779#(<= ~counter~0 1)} is VALID [2022-04-15 14:27:13,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {2779#(<= ~counter~0 1)} assume !!(#t~post3 < 100);havoc #t~post3; {2779#(<= ~counter~0 1)} is VALID [2022-04-15 14:27:13,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {2779#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2779#(<= ~counter~0 1)} is VALID [2022-04-15 14:27:13,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {2779#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2789#(<= ~counter~0 2)} is VALID [2022-04-15 14:27:13,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {2789#(<= ~counter~0 2)} assume !!(#t~post3 < 100);havoc #t~post3; {2789#(<= ~counter~0 2)} is VALID [2022-04-15 14:27:13,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {2789#(<= ~counter~0 2)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2789#(<= ~counter~0 2)} is VALID [2022-04-15 14:27:13,253 INFO L290 TraceCheckUtils]: 23: Hoare triple {2789#(<= ~counter~0 2)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2799#(<= ~counter~0 3)} is VALID [2022-04-15 14:27:13,253 INFO L290 TraceCheckUtils]: 24: Hoare triple {2799#(<= ~counter~0 3)} assume !!(#t~post4 < 100);havoc #t~post4; {2799#(<= ~counter~0 3)} is VALID [2022-04-15 14:27:13,254 INFO L272 TraceCheckUtils]: 25: Hoare triple {2799#(<= ~counter~0 3)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2799#(<= ~counter~0 3)} is VALID [2022-04-15 14:27:13,254 INFO L290 TraceCheckUtils]: 26: Hoare triple {2799#(<= ~counter~0 3)} ~cond := #in~cond; {2799#(<= ~counter~0 3)} is VALID [2022-04-15 14:27:13,254 INFO L290 TraceCheckUtils]: 27: Hoare triple {2799#(<= ~counter~0 3)} assume !(0 == ~cond); {2799#(<= ~counter~0 3)} is VALID [2022-04-15 14:27:13,255 INFO L290 TraceCheckUtils]: 28: Hoare triple {2799#(<= ~counter~0 3)} assume true; {2799#(<= ~counter~0 3)} is VALID [2022-04-15 14:27:13,256 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2799#(<= ~counter~0 3)} {2799#(<= ~counter~0 3)} #85#return; {2799#(<= ~counter~0 3)} is VALID [2022-04-15 14:27:13,256 INFO L290 TraceCheckUtils]: 30: Hoare triple {2799#(<= ~counter~0 3)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {2799#(<= ~counter~0 3)} is VALID [2022-04-15 14:27:13,256 INFO L290 TraceCheckUtils]: 31: Hoare triple {2799#(<= ~counter~0 3)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2799#(<= ~counter~0 3)} is VALID [2022-04-15 14:27:13,257 INFO L290 TraceCheckUtils]: 32: Hoare triple {2799#(<= ~counter~0 3)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2827#(<= |main_#t~post4| 3)} is VALID [2022-04-15 14:27:13,257 INFO L290 TraceCheckUtils]: 33: Hoare triple {2827#(<= |main_#t~post4| 3)} assume !(#t~post4 < 100);havoc #t~post4; {2723#false} is VALID [2022-04-15 14:27:13,258 INFO L272 TraceCheckUtils]: 34: Hoare triple {2723#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2723#false} is VALID [2022-04-15 14:27:13,258 INFO L290 TraceCheckUtils]: 35: Hoare triple {2723#false} ~cond := #in~cond; {2723#false} is VALID [2022-04-15 14:27:13,258 INFO L290 TraceCheckUtils]: 36: Hoare triple {2723#false} assume 0 == ~cond; {2723#false} is VALID [2022-04-15 14:27:13,258 INFO L290 TraceCheckUtils]: 37: Hoare triple {2723#false} assume !false; {2723#false} is VALID [2022-04-15 14:27:13,258 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 14:27:13,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:27:13,519 INFO L290 TraceCheckUtils]: 37: Hoare triple {2723#false} assume !false; {2723#false} is VALID [2022-04-15 14:27:13,519 INFO L290 TraceCheckUtils]: 36: Hoare triple {2723#false} assume 0 == ~cond; {2723#false} is VALID [2022-04-15 14:27:13,519 INFO L290 TraceCheckUtils]: 35: Hoare triple {2723#false} ~cond := #in~cond; {2723#false} is VALID [2022-04-15 14:27:13,520 INFO L272 TraceCheckUtils]: 34: Hoare triple {2723#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2723#false} is VALID [2022-04-15 14:27:13,520 INFO L290 TraceCheckUtils]: 33: Hoare triple {2855#(< |main_#t~post4| 100)} assume !(#t~post4 < 100);havoc #t~post4; {2723#false} is VALID [2022-04-15 14:27:13,520 INFO L290 TraceCheckUtils]: 32: Hoare triple {2859#(< ~counter~0 100)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2855#(< |main_#t~post4| 100)} is VALID [2022-04-15 14:27:13,521 INFO L290 TraceCheckUtils]: 31: Hoare triple {2859#(< ~counter~0 100)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2859#(< ~counter~0 100)} is VALID [2022-04-15 14:27:13,521 INFO L290 TraceCheckUtils]: 30: Hoare triple {2859#(< ~counter~0 100)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {2859#(< ~counter~0 100)} is VALID [2022-04-15 14:27:13,522 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2722#true} {2859#(< ~counter~0 100)} #85#return; {2859#(< ~counter~0 100)} is VALID [2022-04-15 14:27:13,522 INFO L290 TraceCheckUtils]: 28: Hoare triple {2722#true} assume true; {2722#true} is VALID [2022-04-15 14:27:13,522 INFO L290 TraceCheckUtils]: 27: Hoare triple {2722#true} assume !(0 == ~cond); {2722#true} is VALID [2022-04-15 14:27:13,522 INFO L290 TraceCheckUtils]: 26: Hoare triple {2722#true} ~cond := #in~cond; {2722#true} is VALID [2022-04-15 14:27:13,522 INFO L272 TraceCheckUtils]: 25: Hoare triple {2859#(< ~counter~0 100)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2722#true} is VALID [2022-04-15 14:27:13,523 INFO L290 TraceCheckUtils]: 24: Hoare triple {2859#(< ~counter~0 100)} assume !!(#t~post4 < 100);havoc #t~post4; {2859#(< ~counter~0 100)} is VALID [2022-04-15 14:27:13,523 INFO L290 TraceCheckUtils]: 23: Hoare triple {2887#(< ~counter~0 99)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2859#(< ~counter~0 100)} is VALID [2022-04-15 14:27:13,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {2887#(< ~counter~0 99)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2887#(< ~counter~0 99)} is VALID [2022-04-15 14:27:13,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {2887#(< ~counter~0 99)} assume !!(#t~post3 < 100);havoc #t~post3; {2887#(< ~counter~0 99)} is VALID [2022-04-15 14:27:13,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {2897#(< ~counter~0 98)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2887#(< ~counter~0 99)} is VALID [2022-04-15 14:27:13,525 INFO L290 TraceCheckUtils]: 19: Hoare triple {2897#(< ~counter~0 98)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2897#(< ~counter~0 98)} is VALID [2022-04-15 14:27:13,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {2897#(< ~counter~0 98)} assume !!(#t~post3 < 100);havoc #t~post3; {2897#(< ~counter~0 98)} is VALID [2022-04-15 14:27:13,526 INFO L290 TraceCheckUtils]: 17: Hoare triple {2907#(< ~counter~0 97)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2897#(< ~counter~0 98)} is VALID [2022-04-15 14:27:13,526 INFO L290 TraceCheckUtils]: 16: Hoare triple {2907#(< ~counter~0 97)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2907#(< ~counter~0 97)} is VALID [2022-04-15 14:27:13,527 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2722#true} {2907#(< ~counter~0 97)} #83#return; {2907#(< ~counter~0 97)} is VALID [2022-04-15 14:27:13,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {2722#true} assume true; {2722#true} is VALID [2022-04-15 14:27:13,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {2722#true} assume !(0 == ~cond); {2722#true} is VALID [2022-04-15 14:27:13,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {2722#true} ~cond := #in~cond; {2722#true} is VALID [2022-04-15 14:27:13,527 INFO L272 TraceCheckUtils]: 11: Hoare triple {2907#(< ~counter~0 97)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2722#true} is VALID [2022-04-15 14:27:13,528 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2722#true} {2907#(< ~counter~0 97)} #81#return; {2907#(< ~counter~0 97)} is VALID [2022-04-15 14:27:13,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {2722#true} assume true; {2722#true} is VALID [2022-04-15 14:27:13,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {2722#true} assume !(0 == ~cond); {2722#true} is VALID [2022-04-15 14:27:13,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {2722#true} ~cond := #in~cond; {2722#true} is VALID [2022-04-15 14:27:13,528 INFO L272 TraceCheckUtils]: 6: Hoare triple {2907#(< ~counter~0 97)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2722#true} is VALID [2022-04-15 14:27:13,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {2907#(< ~counter~0 97)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2907#(< ~counter~0 97)} is VALID [2022-04-15 14:27:13,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {2907#(< ~counter~0 97)} call #t~ret5 := main(); {2907#(< ~counter~0 97)} is VALID [2022-04-15 14:27:13,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2907#(< ~counter~0 97)} {2722#true} #89#return; {2907#(< ~counter~0 97)} is VALID [2022-04-15 14:27:13,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {2907#(< ~counter~0 97)} assume true; {2907#(< ~counter~0 97)} is VALID [2022-04-15 14:27:13,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {2722#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(9, 2);~counter~0 := 0; {2907#(< ~counter~0 97)} is VALID [2022-04-15 14:27:13,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {2722#true} call ULTIMATE.init(); {2722#true} is VALID [2022-04-15 14:27:13,531 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 14:27:13,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:27:13,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192003100] [2022-04-15 14:27:13,531 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:27:13,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474545690] [2022-04-15 14:27:13,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474545690] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 14:27:13,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 14:27:13,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-15 14:27:13,532 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:27:13,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [946101808] [2022-04-15 14:27:13,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [946101808] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:13,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:13,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 14:27:13,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090006474] [2022-04-15 14:27:13,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:27:13,533 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-04-15 14:27:13,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:27:13,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:13,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:13,566 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 14:27:13,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:13,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 14:27:13,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-15 14:27:13,567 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:13,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:13,763 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-04-15 14:27:13,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 14:27:13,763 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-04-15 14:27:13,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:27:13,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:13,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2022-04-15 14:27:13,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:13,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2022-04-15 14:27:13,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 66 transitions. [2022-04-15 14:27:13,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:13,820 INFO L225 Difference]: With dead ends: 67 [2022-04-15 14:27:13,820 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 14:27:13,820 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-04-15 14:27:13,821 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 30 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:27:13,821 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 96 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:27:13,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 14:27:13,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2022-04-15 14:27:13,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:27:13,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 54 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 14:27:13,870 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 54 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 14:27:13,870 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 54 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 14:27:13,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:13,873 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-15 14:27:13,873 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-15 14:27:13,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:13,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:13,873 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 60 states. [2022-04-15 14:27:13,874 INFO L87 Difference]: Start difference. First operand has 54 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 60 states. [2022-04-15 14:27:13,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:13,875 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-15 14:27:13,876 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-15 14:27:13,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:13,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:13,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:27:13,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:27:13,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 14:27:13,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-15 14:27:13,878 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 38 [2022-04-15 14:27:13,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:27:13,878 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-15 14:27:13,879 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:13,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 63 transitions. [2022-04-15 14:27:13,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:13,948 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-15 14:27:13,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 14:27:13,949 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:27:13,949 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:27:13,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 14:27:14,149 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:27:14,150 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:27:14,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:27:14,150 INFO L85 PathProgramCache]: Analyzing trace with hash 817777954, now seen corresponding path program 1 times [2022-04-15 14:27:14,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:14,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1415555549] [2022-04-15 14:27:14,151 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:27:14,151 INFO L85 PathProgramCache]: Analyzing trace with hash 817777954, now seen corresponding path program 2 times [2022-04-15 14:27:14,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:27:14,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609770105] [2022-04-15 14:27:14,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:27:14,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:27:14,167 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:27:14,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [812156262] [2022-04-15 14:27:14,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:27:14,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:27:14,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:27:14,168 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 14:27:14,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process