/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 06:38:05,549 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 06:38:05,551 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 06:38:05,595 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 06:38:05,597 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 06:38:05,599 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 06:38:05,602 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 06:38:05,608 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 06:38:05,610 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 06:38:05,616 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 06:38:05,617 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 06:38:05,618 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 06:38:05,618 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 06:38:05,619 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 06:38:05,619 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 06:38:05,620 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 06:38:05,621 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 06:38:05,621 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 06:38:05,623 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 06:38:05,624 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 06:38:05,626 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 06:38:05,630 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 06:38:05,632 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 06:38:05,635 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 06:38:05,637 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 06:38:05,646 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 06:38:05,646 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 06:38:05,646 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 06:38:05,648 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 06:38:05,648 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 06:38:05,650 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 06:38:05,651 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 06:38:05,652 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 06:38:05,653 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 06:38:05,653 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 06:38:05,654 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 06:38:05,654 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 06:38:05,655 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 06:38:05,655 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 06:38:05,655 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 06:38:05,656 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 06:38:05,659 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 06:38:05,660 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 06:38:05,677 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 06:38:05,677 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 06:38:05,678 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 06:38:05,679 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 06:38:05,679 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 06:38:05,679 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 06:38:05,679 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 06:38:05,679 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 06:38:05,680 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 06:38:05,680 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 06:38:05,681 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 06:38:05,681 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 06:38:05,681 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 06:38:05,681 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 06:38:05,681 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 06:38:05,681 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 06:38:05,682 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 06:38:05,682 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 06:38:05,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 06:38:05,682 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 06:38:05,682 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 06:38:05,682 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 06:38:05,682 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 06:38:05,683 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 06:38:05,683 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 06:38:05,683 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-08 06:38:05,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 06:38:05,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 06:38:05,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 06:38:05,967 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 06:38:05,968 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 06:38:05,970 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound5.c [2022-04-08 06:38:06,037 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4aed27e4f/c5db6ff5f3044a0eb18629268471f0fa/FLAGc4e017d83 [2022-04-08 06:38:06,465 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 06:38:06,466 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_valuebound5.c [2022-04-08 06:38:06,474 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4aed27e4f/c5db6ff5f3044a0eb18629268471f0fa/FLAGc4e017d83 [2022-04-08 06:38:06,840 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4aed27e4f/c5db6ff5f3044a0eb18629268471f0fa [2022-04-08 06:38:06,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 06:38:06,847 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 06:38:06,848 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 06:38:06,848 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 06:38:06,851 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 06:38:06,853 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 06:38:06" (1/1) ... [2022-04-08 06:38:06,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4afe309f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:38:06, skipping insertion in model container [2022-04-08 06:38:06,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 06:38:06" (1/1) ... [2022-04-08 06:38:06,861 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 06:38:06,874 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 06:38:07,052 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/hard-u_valuebound5.c[537,550] [2022-04-08 06:38:07,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 06:38:07,105 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 06:38:07,123 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/hard-u_valuebound5.c[537,550] [2022-04-08 06:38:07,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 06:38:07,162 INFO L208 MainTranslator]: Completed translation [2022-04-08 06:38:07,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:38:07 WrapperNode [2022-04-08 06:38:07,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 06:38:07,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 06:38:07,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 06:38:07,165 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 06:38:07,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:38:07" (1/1) ... [2022-04-08 06:38:07,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:38:07" (1/1) ... [2022-04-08 06:38:07,189 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:38:07" (1/1) ... [2022-04-08 06:38:07,190 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:38:07" (1/1) ... [2022-04-08 06:38:07,204 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:38:07" (1/1) ... [2022-04-08 06:38:07,208 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:38:07" (1/1) ... [2022-04-08 06:38:07,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:38:07" (1/1) ... [2022-04-08 06:38:07,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 06:38:07,212 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 06:38:07,212 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 06:38:07,212 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 06:38:07,213 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:38:07" (1/1) ... [2022-04-08 06:38:07,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 06:38:07,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:38:07,241 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-08 06:38:07,268 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-08 06:38:07,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 06:38:07,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 06:38:07,285 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 06:38:07,285 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 06:38:07,285 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 06:38:07,285 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 06:38:07,285 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 06:38:07,286 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 06:38:07,286 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 06:38:07,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 06:38:07,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 06:38:07,287 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 06:38:07,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 06:38:07,288 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 06:38:07,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 06:38:07,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 06:38:07,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 06:38:07,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 06:38:07,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 06:38:07,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 06:38:07,353 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 06:38:07,355 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 06:38:07,536 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 06:38:07,542 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 06:38:07,543 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 06:38:07,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 06:38:07 BoogieIcfgContainer [2022-04-08 06:38:07,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 06:38:07,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 06:38:07,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 06:38:07,550 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 06:38:07,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 06:38:06" (1/3) ... [2022-04-08 06:38:07,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a2be221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 06:38:07, skipping insertion in model container [2022-04-08 06:38:07,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:38:07" (2/3) ... [2022-04-08 06:38:07,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a2be221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 06:38:07, skipping insertion in model container [2022-04-08 06:38:07,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 06:38:07" (3/3) ... [2022-04-08 06:38:07,552 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u_valuebound5.c [2022-04-08 06:38:07,557 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 06:38:07,558 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 06:38:07,616 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 06:38:07,622 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-08 06:38:07,622 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 06:38:07,640 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 06:38:07,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 06:38:07,647 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:38:07,648 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:38:07,648 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:38:07,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:38:07,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1784424332, now seen corresponding path program 1 times [2022-04-08 06:38:07,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:07,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [418595719] [2022-04-08 06:38:07,685 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:38:07,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1784424332, now seen corresponding path program 2 times [2022-04-08 06:38:07,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:38:07,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045553712] [2022-04-08 06:38:07,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:38:07,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:38:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:07,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 06:38:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:07,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {41#true} is VALID [2022-04-08 06:38:07,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-08 06:38:07,900 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #101#return; {41#true} is VALID [2022-04-08 06:38:07,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 06:38:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:07,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-08 06:38:07,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-08 06:38:07,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-08 06:38:07,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-08 06:38:07,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 06:38:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:07,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-08 06:38:07,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-08 06:38:07,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-08 06:38:07,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-08 06:38:07,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 06:38:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:07,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-08 06:38:07,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-08 06:38:07,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-08 06:38:07,963 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {42#false} #85#return; {42#false} is VALID [2022-04-08 06:38:07,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 06:38:07,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {41#true} is VALID [2022-04-08 06:38:07,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-08 06:38:07,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #101#return; {41#true} is VALID [2022-04-08 06:38:07,967 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret6 := main(); {41#true} is VALID [2022-04-08 06:38:07,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {41#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {41#true} is VALID [2022-04-08 06:38:07,967 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 5 then 1 else 0)); {41#true} is VALID [2022-04-08 06:38:07,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-08 06:38:07,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-08 06:38:07,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-08 06:38:07,970 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-08 06:38:07,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {42#false} ~B~0 := #t~nondet5;havoc #t~nondet5; {42#false} is VALID [2022-04-08 06:38:07,971 INFO L272 TraceCheckUtils]: 12: Hoare triple {42#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 5 then 1 else 0)); {41#true} is VALID [2022-04-08 06:38:07,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-08 06:38:07,972 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-08 06:38:07,972 INFO L290 TraceCheckUtils]: 15: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-08 06:38:07,973 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-08 06:38:07,974 INFO L272 TraceCheckUtils]: 17: Hoare triple {42#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {41#true} is VALID [2022-04-08 06:38:07,974 INFO L290 TraceCheckUtils]: 18: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-08 06:38:07,976 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-08 06:38:07,976 INFO L290 TraceCheckUtils]: 20: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-08 06:38:07,977 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {42#false} {42#false} #85#return; {42#false} is VALID [2022-04-08 06:38:07,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {42#false} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {42#false} is VALID [2022-04-08 06:38:07,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-08 06:38:07,978 INFO L272 TraceCheckUtils]: 24: Hoare triple {42#false} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {42#false} is VALID [2022-04-08 06:38:07,979 INFO L290 TraceCheckUtils]: 25: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2022-04-08 06:38:07,979 INFO L290 TraceCheckUtils]: 26: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2022-04-08 06:38:07,979 INFO L290 TraceCheckUtils]: 27: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-08 06:38:07,980 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 06:38:07,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:38:07,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045553712] [2022-04-08 06:38:07,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045553712] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:38:07,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:38:07,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 06:38:07,986 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:38:07,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [418595719] [2022-04-08 06:38:07,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [418595719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:38:07,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:38:07,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 06:38:07,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582343059] [2022-04-08 06:38:07,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:38:07,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-08 06:38:07,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:38:08,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 06:38:08,050 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-08 06:38:08,050 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 06:38:08,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:08,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 06:38:08,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 06:38:08,077 INFO L87 Difference]: Start difference. First operand has 38 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 06:38:08,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:08,255 INFO L93 Difference]: Finished difference Result 69 states and 110 transitions. [2022-04-08 06:38:08,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 06:38:08,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-08 06:38:08,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:38:08,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 06:38:08,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-04-08 06:38:08,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 06:38:08,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-04-08 06:38:08,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2022-04-08 06:38:08,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:08,428 INFO L225 Difference]: With dead ends: 69 [2022-04-08 06:38:08,428 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 06:38:08,431 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 06:38:08,434 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:38:08,435 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 41 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:38:08,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 06:38:08,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-08 06:38:08,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:38:08,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 06:38:08,467 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 06:38:08,467 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 06:38:08,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:08,472 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-08 06:38:08,472 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-08 06:38:08,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:08,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:08,474 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 33 states. [2022-04-08 06:38:08,474 INFO L87 Difference]: Start difference. First operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 33 states. [2022-04-08 06:38:08,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:08,478 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-08 06:38:08,478 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-08 06:38:08,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:08,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:08,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:38:08,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:38:08,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 06:38:08,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-04-08 06:38:08,511 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 28 [2022-04-08 06:38:08,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:38:08,511 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-04-08 06:38:08,512 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 06:38:08,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 43 transitions. [2022-04-08 06:38:08,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:08,613 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-08 06:38:08,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 06:38:08,614 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:38:08,614 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:38:08,614 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 06:38:08,615 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:38:08,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:38:08,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1361835634, now seen corresponding path program 1 times [2022-04-08 06:38:08,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:08,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [933802875] [2022-04-08 06:38:08,617 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:38:08,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1361835634, now seen corresponding path program 2 times [2022-04-08 06:38:08,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:38:08,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252441967] [2022-04-08 06:38:08,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:38:08,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:38:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:08,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 06:38:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:08,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {351#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {331#true} is VALID [2022-04-08 06:38:08,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {331#true} assume true; {331#true} is VALID [2022-04-08 06:38:08,711 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {331#true} {331#true} #101#return; {331#true} is VALID [2022-04-08 06:38:08,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 06:38:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:08,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {331#true} ~cond := #in~cond; {331#true} is VALID [2022-04-08 06:38:08,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {331#true} assume !(0 == ~cond); {331#true} is VALID [2022-04-08 06:38:08,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {331#true} assume true; {331#true} is VALID [2022-04-08 06:38:08,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {331#true} {331#true} #81#return; {331#true} is VALID [2022-04-08 06:38:08,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 06:38:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:08,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {331#true} ~cond := #in~cond; {331#true} is VALID [2022-04-08 06:38:08,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {331#true} assume !(0 == ~cond); {331#true} is VALID [2022-04-08 06:38:08,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {331#true} assume true; {331#true} is VALID [2022-04-08 06:38:08,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {331#true} {331#true} #83#return; {331#true} is VALID [2022-04-08 06:38:08,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 06:38:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:08,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {331#true} ~cond := #in~cond; {331#true} is VALID [2022-04-08 06:38:08,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {331#true} assume !(0 == ~cond); {331#true} is VALID [2022-04-08 06:38:08,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {331#true} assume true; {331#true} is VALID [2022-04-08 06:38:08,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {331#true} {331#true} #85#return; {331#true} is VALID [2022-04-08 06:38:08,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {331#true} call ULTIMATE.init(); {351#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 06:38:08,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {351#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {331#true} is VALID [2022-04-08 06:38:08,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {331#true} assume true; {331#true} is VALID [2022-04-08 06:38:08,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {331#true} {331#true} #101#return; {331#true} is VALID [2022-04-08 06:38:08,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {331#true} call #t~ret6 := main(); {331#true} is VALID [2022-04-08 06:38:08,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {331#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {331#true} is VALID [2022-04-08 06:38:08,738 INFO L272 TraceCheckUtils]: 6: Hoare triple {331#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 5 then 1 else 0)); {331#true} is VALID [2022-04-08 06:38:08,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {331#true} ~cond := #in~cond; {331#true} is VALID [2022-04-08 06:38:08,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {331#true} assume !(0 == ~cond); {331#true} is VALID [2022-04-08 06:38:08,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {331#true} assume true; {331#true} is VALID [2022-04-08 06:38:08,739 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {331#true} {331#true} #81#return; {331#true} is VALID [2022-04-08 06:38:08,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {331#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {331#true} is VALID [2022-04-08 06:38:08,739 INFO L272 TraceCheckUtils]: 12: Hoare triple {331#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 5 then 1 else 0)); {331#true} is VALID [2022-04-08 06:38:08,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {331#true} ~cond := #in~cond; {331#true} is VALID [2022-04-08 06:38:08,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {331#true} assume !(0 == ~cond); {331#true} is VALID [2022-04-08 06:38:08,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {331#true} assume true; {331#true} is VALID [2022-04-08 06:38:08,740 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {331#true} {331#true} #83#return; {331#true} is VALID [2022-04-08 06:38:08,740 INFO L272 TraceCheckUtils]: 17: Hoare triple {331#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {331#true} is VALID [2022-04-08 06:38:08,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {331#true} ~cond := #in~cond; {331#true} is VALID [2022-04-08 06:38:08,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {331#true} assume !(0 == ~cond); {331#true} is VALID [2022-04-08 06:38:08,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {331#true} assume true; {331#true} is VALID [2022-04-08 06:38:08,741 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {331#true} {331#true} #85#return; {331#true} is VALID [2022-04-08 06:38:08,742 INFO L290 TraceCheckUtils]: 22: Hoare triple {331#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {348#(= main_~q~0 0)} is VALID [2022-04-08 06:38:08,743 INFO L290 TraceCheckUtils]: 23: Hoare triple {348#(= main_~q~0 0)} assume !false; {348#(= main_~q~0 0)} is VALID [2022-04-08 06:38:08,743 INFO L272 TraceCheckUtils]: 24: Hoare triple {348#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {349#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:38:08,744 INFO L290 TraceCheckUtils]: 25: Hoare triple {349#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {350#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 06:38:08,744 INFO L290 TraceCheckUtils]: 26: Hoare triple {350#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {332#false} is VALID [2022-04-08 06:38:08,745 INFO L290 TraceCheckUtils]: 27: Hoare triple {332#false} assume !false; {332#false} is VALID [2022-04-08 06:38:08,745 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 06:38:08,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:38:08,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252441967] [2022-04-08 06:38:08,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252441967] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:38:08,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:38:08,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 06:38:08,747 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:38:08,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [933802875] [2022-04-08 06:38:08,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [933802875] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:38:08,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:38:08,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 06:38:08,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699598346] [2022-04-08 06:38:08,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:38:08,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-08 06:38:08,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:38:08,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 06:38:08,770 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-08 06:38:08,771 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 06:38:08,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:08,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 06:38:08,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 06:38:08,772 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 06:38:09,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:09,263 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-04-08 06:38:09,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 06:38:09,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-08 06:38:09,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:38:09,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 06:38:09,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-08 06:38:09,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 06:38:09,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-08 06:38:09,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2022-04-08 06:38:09,348 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-08 06:38:09,350 INFO L225 Difference]: With dead ends: 46 [2022-04-08 06:38:09,351 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 06:38:09,351 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 06:38:09,352 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 38 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 06:38:09,353 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 48 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 06:38:09,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 06:38:09,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2022-04-08 06:38:09,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:38:09,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 06:38:09,362 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 06:38:09,363 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 06:38:09,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:09,366 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-08 06:38:09,366 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-08 06:38:09,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:09,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:09,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 44 states. [2022-04-08 06:38:09,368 INFO L87 Difference]: Start difference. First operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 44 states. [2022-04-08 06:38:09,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:09,371 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-08 06:38:09,371 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-08 06:38:09,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:09,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:09,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:38:09,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:38:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 06:38:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2022-04-08 06:38:09,376 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 28 [2022-04-08 06:38:09,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:38:09,376 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-04-08 06:38:09,376 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 06:38:09,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 46 transitions. [2022-04-08 06:38:09,433 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-08 06:38:09,434 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-04-08 06:38:09,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 06:38:09,435 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:38:09,435 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:38:09,435 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 06:38:09,435 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:38:09,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:38:09,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1382067636, now seen corresponding path program 1 times [2022-04-08 06:38:09,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:09,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1049022310] [2022-04-08 06:38:09,437 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:38:09,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1382067636, now seen corresponding path program 2 times [2022-04-08 06:38:09,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:38:09,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455299190] [2022-04-08 06:38:09,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:38:09,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:38:09,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:09,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 06:38:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:09,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {640#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {616#true} is VALID [2022-04-08 06:38:09,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {616#true} assume true; {616#true} is VALID [2022-04-08 06:38:09,592 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {616#true} {616#true} #101#return; {616#true} is VALID [2022-04-08 06:38:09,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 06:38:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:09,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {616#true} ~cond := #in~cond; {616#true} is VALID [2022-04-08 06:38:09,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {616#true} assume !(0 == ~cond); {616#true} is VALID [2022-04-08 06:38:09,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {616#true} assume true; {616#true} is VALID [2022-04-08 06:38:09,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {616#true} {616#true} #81#return; {616#true} is VALID [2022-04-08 06:38:09,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 06:38:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:09,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {616#true} ~cond := #in~cond; {616#true} is VALID [2022-04-08 06:38:09,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {616#true} assume !(0 == ~cond); {616#true} is VALID [2022-04-08 06:38:09,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {616#true} assume true; {616#true} is VALID [2022-04-08 06:38:09,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {616#true} {616#true} #83#return; {616#true} is VALID [2022-04-08 06:38:09,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 06:38:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:09,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {616#true} ~cond := #in~cond; {616#true} is VALID [2022-04-08 06:38:09,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {616#true} assume !(0 == ~cond); {616#true} is VALID [2022-04-08 06:38:09,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {616#true} assume true; {616#true} is VALID [2022-04-08 06:38:09,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {616#true} {616#true} #85#return; {616#true} is VALID [2022-04-08 06:38:09,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-08 06:38:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:09,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {616#true} ~cond := #in~cond; {616#true} is VALID [2022-04-08 06:38:09,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {616#true} assume !(0 == ~cond); {616#true} is VALID [2022-04-08 06:38:09,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {616#true} assume true; {616#true} is VALID [2022-04-08 06:38:09,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {616#true} {633#(= main_~A~0 main_~r~0)} #87#return; {633#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 06:38:09,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {616#true} call ULTIMATE.init(); {640#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 06:38:09,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {640#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {616#true} is VALID [2022-04-08 06:38:09,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {616#true} assume true; {616#true} is VALID [2022-04-08 06:38:09,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {616#true} {616#true} #101#return; {616#true} is VALID [2022-04-08 06:38:09,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {616#true} call #t~ret6 := main(); {616#true} is VALID [2022-04-08 06:38:09,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {616#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {616#true} is VALID [2022-04-08 06:38:09,633 INFO L272 TraceCheckUtils]: 6: Hoare triple {616#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 5 then 1 else 0)); {616#true} is VALID [2022-04-08 06:38:09,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {616#true} ~cond := #in~cond; {616#true} is VALID [2022-04-08 06:38:09,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {616#true} assume !(0 == ~cond); {616#true} is VALID [2022-04-08 06:38:09,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {616#true} assume true; {616#true} is VALID [2022-04-08 06:38:09,634 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {616#true} {616#true} #81#return; {616#true} is VALID [2022-04-08 06:38:09,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {616#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {616#true} is VALID [2022-04-08 06:38:09,634 INFO L272 TraceCheckUtils]: 12: Hoare triple {616#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 5 then 1 else 0)); {616#true} is VALID [2022-04-08 06:38:09,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {616#true} ~cond := #in~cond; {616#true} is VALID [2022-04-08 06:38:09,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {616#true} assume !(0 == ~cond); {616#true} is VALID [2022-04-08 06:38:09,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {616#true} assume true; {616#true} is VALID [2022-04-08 06:38:09,635 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {616#true} {616#true} #83#return; {616#true} is VALID [2022-04-08 06:38:09,635 INFO L272 TraceCheckUtils]: 17: Hoare triple {616#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {616#true} is VALID [2022-04-08 06:38:09,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {616#true} ~cond := #in~cond; {616#true} is VALID [2022-04-08 06:38:09,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {616#true} assume !(0 == ~cond); {616#true} is VALID [2022-04-08 06:38:09,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {616#true} assume true; {616#true} is VALID [2022-04-08 06:38:09,636 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {616#true} {616#true} #85#return; {616#true} is VALID [2022-04-08 06:38:09,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {616#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {633#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 06:38:09,637 INFO L290 TraceCheckUtils]: 23: Hoare triple {633#(= main_~A~0 main_~r~0)} assume !false; {633#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 06:38:09,637 INFO L272 TraceCheckUtils]: 24: Hoare triple {633#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {616#true} is VALID [2022-04-08 06:38:09,637 INFO L290 TraceCheckUtils]: 25: Hoare triple {616#true} ~cond := #in~cond; {616#true} is VALID [2022-04-08 06:38:09,637 INFO L290 TraceCheckUtils]: 26: Hoare triple {616#true} assume !(0 == ~cond); {616#true} is VALID [2022-04-08 06:38:09,637 INFO L290 TraceCheckUtils]: 27: Hoare triple {616#true} assume true; {616#true} is VALID [2022-04-08 06:38:09,638 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {616#true} {633#(= main_~A~0 main_~r~0)} #87#return; {633#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 06:38:09,639 INFO L272 TraceCheckUtils]: 29: Hoare triple {633#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {638#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:38:09,643 INFO L290 TraceCheckUtils]: 30: Hoare triple {638#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {639#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 06:38:09,644 INFO L290 TraceCheckUtils]: 31: Hoare triple {639#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {617#false} is VALID [2022-04-08 06:38:09,644 INFO L290 TraceCheckUtils]: 32: Hoare triple {617#false} assume !false; {617#false} is VALID [2022-04-08 06:38:09,644 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 06:38:09,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:38:09,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455299190] [2022-04-08 06:38:09,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455299190] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:38:09,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:38:09,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 06:38:09,646 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:38:09,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1049022310] [2022-04-08 06:38:09,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1049022310] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:38:09,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:38:09,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 06:38:09,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590000074] [2022-04-08 06:38:09,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:38:09,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-08 06:38:09,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:38:09,647 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), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 06:38:09,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:09,683 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 06:38:09,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:09,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 06:38:09,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 06:38:09,686 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 06:38:10,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:10,256 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-04-08 06:38:10,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 06:38:10,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-08 06:38:10,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:38:10,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 06:38:10,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-08 06:38:10,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 06:38:10,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-08 06:38:10,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2022-04-08 06:38:10,375 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-08 06:38:10,377 INFO L225 Difference]: With dead ends: 50 [2022-04-08 06:38:10,377 INFO L226 Difference]: Without dead ends: 48 [2022-04-08 06:38:10,377 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 06:38:10,378 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 33 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 06:38:10,379 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 48 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 06:38:10,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-08 06:38:10,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2022-04-08 06:38:10,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:38:10,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 06:38:10,387 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 06:38:10,387 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 06:38:10,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:10,390 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-08 06:38:10,390 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-04-08 06:38:10,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:10,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:10,391 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 48 states. [2022-04-08 06:38:10,391 INFO L87 Difference]: Start difference. First operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 48 states. [2022-04-08 06:38:10,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:10,394 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-08 06:38:10,394 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-04-08 06:38:10,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:10,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:10,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:38:10,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:38:10,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 06:38:10,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2022-04-08 06:38:10,397 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 33 [2022-04-08 06:38:10,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:38:10,398 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2022-04-08 06:38:10,398 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 06:38:10,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 49 transitions. [2022-04-08 06:38:10,493 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-08 06:38:10,494 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-04-08 06:38:10,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 06:38:10,494 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:38:10,495 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:38:10,495 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 06:38:10,495 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:38:10,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:38:10,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1455208590, now seen corresponding path program 1 times [2022-04-08 06:38:10,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:10,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [587409548] [2022-04-08 06:38:10,497 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:38:10,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1455208590, now seen corresponding path program 2 times [2022-04-08 06:38:10,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:38:10,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472780299] [2022-04-08 06:38:10,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:38:10,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:38:10,524 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:38:10,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [270265428] [2022-04-08 06:38:10,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:38:10,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:38:10,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:38:10,536 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-08 06:38:10,538 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-08 06:38:10,592 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:38:10,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:38:10,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 06:38:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:10,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:38:10,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {929#true} call ULTIMATE.init(); {929#true} is VALID [2022-04-08 06:38:10,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {929#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);call #Ultimate.allocInit(12, 3); {929#true} is VALID [2022-04-08 06:38:10,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {929#true} assume true; {929#true} is VALID [2022-04-08 06:38:10,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {929#true} {929#true} #101#return; {929#true} is VALID [2022-04-08 06:38:10,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {929#true} call #t~ret6 := main(); {929#true} is VALID [2022-04-08 06:38:10,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {929#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {929#true} is VALID [2022-04-08 06:38:10,850 INFO L272 TraceCheckUtils]: 6: Hoare triple {929#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 5 then 1 else 0)); {929#true} is VALID [2022-04-08 06:38:10,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {929#true} ~cond := #in~cond; {929#true} is VALID [2022-04-08 06:38:10,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {929#true} assume !(0 == ~cond); {929#true} is VALID [2022-04-08 06:38:10,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {929#true} assume true; {929#true} is VALID [2022-04-08 06:38:10,850 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {929#true} {929#true} #81#return; {929#true} is VALID [2022-04-08 06:38:10,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {929#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {929#true} is VALID [2022-04-08 06:38:10,851 INFO L272 TraceCheckUtils]: 12: Hoare triple {929#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 5 then 1 else 0)); {929#true} is VALID [2022-04-08 06:38:10,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {929#true} ~cond := #in~cond; {929#true} is VALID [2022-04-08 06:38:10,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {929#true} assume !(0 == ~cond); {929#true} is VALID [2022-04-08 06:38:10,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {929#true} assume true; {929#true} is VALID [2022-04-08 06:38:10,851 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {929#true} {929#true} #83#return; {929#true} is VALID [2022-04-08 06:38:10,851 INFO L272 TraceCheckUtils]: 17: Hoare triple {929#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {929#true} is VALID [2022-04-08 06:38:10,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {929#true} ~cond := #in~cond; {929#true} is VALID [2022-04-08 06:38:10,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {929#true} assume !(0 == ~cond); {929#true} is VALID [2022-04-08 06:38:10,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {929#true} assume true; {929#true} is VALID [2022-04-08 06:38:10,852 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {929#true} {929#true} #85#return; {929#true} is VALID [2022-04-08 06:38:10,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {929#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1000#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 06:38:10,853 INFO L290 TraceCheckUtils]: 23: Hoare triple {1000#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !false; {1000#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 06:38:10,853 INFO L272 TraceCheckUtils]: 24: Hoare triple {1000#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {929#true} is VALID [2022-04-08 06:38:10,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {929#true} ~cond := #in~cond; {929#true} is VALID [2022-04-08 06:38:10,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {929#true} assume !(0 == ~cond); {929#true} is VALID [2022-04-08 06:38:10,854 INFO L290 TraceCheckUtils]: 27: Hoare triple {929#true} assume true; {929#true} is VALID [2022-04-08 06:38:10,855 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {929#true} {1000#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #87#return; {1000#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 06:38:10,855 INFO L272 TraceCheckUtils]: 29: Hoare triple {1000#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {929#true} is VALID [2022-04-08 06:38:10,855 INFO L290 TraceCheckUtils]: 30: Hoare triple {929#true} ~cond := #in~cond; {929#true} is VALID [2022-04-08 06:38:10,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {929#true} assume !(0 == ~cond); {929#true} is VALID [2022-04-08 06:38:10,855 INFO L290 TraceCheckUtils]: 32: Hoare triple {929#true} assume true; {929#true} is VALID [2022-04-08 06:38:10,856 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {929#true} {1000#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #89#return; {1000#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 06:38:10,857 INFO L272 TraceCheckUtils]: 34: Hoare triple {1000#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1037#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:38:10,858 INFO L290 TraceCheckUtils]: 35: Hoare triple {1037#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1041#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:38:10,858 INFO L290 TraceCheckUtils]: 36: Hoare triple {1041#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {930#false} is VALID [2022-04-08 06:38:10,858 INFO L290 TraceCheckUtils]: 37: Hoare triple {930#false} assume !false; {930#false} is VALID [2022-04-08 06:38:10,859 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 06:38:10,859 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 06:38:10,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:38:10,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472780299] [2022-04-08 06:38:10,859 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:38:10,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270265428] [2022-04-08 06:38:10,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270265428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:38:10,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:38:10,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:38:10,860 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:38:10,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [587409548] [2022-04-08 06:38:10,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [587409548] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:38:10,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:38:10,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:38:10,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371574221] [2022-04-08 06:38:10,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:38:10,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2022-04-08 06:38:10,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:38:10,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 06:38:10,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:10,887 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 06:38:10,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:10,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 06:38:10,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 06:38:10,888 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 06:38:13,072 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-08 06:38:13,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:13,355 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2022-04-08 06:38:13,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 06:38:13,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2022-04-08 06:38:13,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:38:13,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 06:38:13,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 06:38:13,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 06:38:13,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 06:38:13,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-08 06:38:13,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:13,439 INFO L225 Difference]: With dead ends: 58 [2022-04-08 06:38:13,439 INFO L226 Difference]: Without dead ends: 55 [2022-04-08 06:38:13,439 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 06:38:13,440 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-08 06:38:13,441 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 142 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-08 06:38:13,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-08 06:38:13,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-08 06:38:13,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:38:13,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 06:38:13,456 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 06:38:13,456 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 06:38:13,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:13,461 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-08 06:38:13,461 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-08 06:38:13,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:13,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:13,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 55 states. [2022-04-08 06:38:13,469 INFO L87 Difference]: Start difference. First operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 55 states. [2022-04-08 06:38:13,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:13,473 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-08 06:38:13,473 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-08 06:38:13,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:13,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:13,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:38:13,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:38:13,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 06:38:13,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2022-04-08 06:38:13,477 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 38 [2022-04-08 06:38:13,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:38:13,477 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2022-04-08 06:38:13,478 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), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 06:38:13,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 69 transitions. [2022-04-08 06:38:13,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:13,588 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-08 06:38:13,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 06:38:13,589 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:38:13,589 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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, 1] [2022-04-08 06:38:13,619 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-08 06:38:13,790 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:38:13,791 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:38:13,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:38:13,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1688067263, now seen corresponding path program 1 times [2022-04-08 06:38:13,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:13,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [14678871] [2022-04-08 06:38:13,792 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:38:13,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1688067263, now seen corresponding path program 2 times [2022-04-08 06:38:13,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:38:13,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076337852] [2022-04-08 06:38:13,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:38:13,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:38:13,808 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:38:13,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1214200054] [2022-04-08 06:38:13,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:38:13,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:38:13,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:38:13,818 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-08 06:38:13,826 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-08 06:38:13,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:38:13,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:38:13,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 06:38:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:13,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:38:15,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {1385#true} call ULTIMATE.init(); {1385#true} is VALID [2022-04-08 06:38:15,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {1385#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);call #Ultimate.allocInit(12, 3); {1385#true} is VALID [2022-04-08 06:38:15,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {1385#true} assume true; {1385#true} is VALID [2022-04-08 06:38:15,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1385#true} {1385#true} #101#return; {1385#true} is VALID [2022-04-08 06:38:15,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {1385#true} call #t~ret6 := main(); {1385#true} is VALID [2022-04-08 06:38:15,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {1385#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {1385#true} is VALID [2022-04-08 06:38:15,708 INFO L272 TraceCheckUtils]: 6: Hoare triple {1385#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 5 then 1 else 0)); {1385#true} is VALID [2022-04-08 06:38:15,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {1385#true} ~cond := #in~cond; {1385#true} is VALID [2022-04-08 06:38:15,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {1385#true} assume !(0 == ~cond); {1385#true} is VALID [2022-04-08 06:38:15,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {1385#true} assume true; {1385#true} is VALID [2022-04-08 06:38:15,709 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1385#true} {1385#true} #81#return; {1385#true} is VALID [2022-04-08 06:38:15,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {1385#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {1385#true} is VALID [2022-04-08 06:38:15,709 INFO L272 TraceCheckUtils]: 12: Hoare triple {1385#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 5 then 1 else 0)); {1385#true} is VALID [2022-04-08 06:38:15,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {1385#true} ~cond := #in~cond; {1429#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 06:38:15,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {1429#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1433#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:38:15,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {1433#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1433#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:38:15,720 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1433#(not (= |assume_abort_if_not_#in~cond| 0))} {1385#true} #83#return; {1440#(<= (mod main_~B~0 4294967296) 5)} is VALID [2022-04-08 06:38:15,720 INFO L272 TraceCheckUtils]: 17: Hoare triple {1440#(<= (mod main_~B~0 4294967296) 5)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1385#true} is VALID [2022-04-08 06:38:15,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {1385#true} ~cond := #in~cond; {1385#true} is VALID [2022-04-08 06:38:15,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {1385#true} assume !(0 == ~cond); {1385#true} is VALID [2022-04-08 06:38:15,721 INFO L290 TraceCheckUtils]: 20: Hoare triple {1385#true} assume true; {1385#true} is VALID [2022-04-08 06:38:15,721 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1385#true} {1440#(<= (mod main_~B~0 4294967296) 5)} #85#return; {1440#(<= (mod main_~B~0 4294967296) 5)} is VALID [2022-04-08 06:38:15,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {1440#(<= (mod main_~B~0 4294967296) 5)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1459#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-08 06:38:15,723 INFO L290 TraceCheckUtils]: 23: Hoare triple {1459#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (= main_~q~0 0) (= main_~B~0 main_~d~0))} assume !false; {1459#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-08 06:38:15,723 INFO L272 TraceCheckUtils]: 24: Hoare triple {1459#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1385#true} is VALID [2022-04-08 06:38:15,723 INFO L290 TraceCheckUtils]: 25: Hoare triple {1385#true} ~cond := #in~cond; {1385#true} is VALID [2022-04-08 06:38:15,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {1385#true} assume !(0 == ~cond); {1385#true} is VALID [2022-04-08 06:38:15,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {1385#true} assume true; {1385#true} is VALID [2022-04-08 06:38:15,724 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1385#true} {1459#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #87#return; {1459#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-08 06:38:15,724 INFO L272 TraceCheckUtils]: 29: Hoare triple {1459#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1385#true} is VALID [2022-04-08 06:38:15,724 INFO L290 TraceCheckUtils]: 30: Hoare triple {1385#true} ~cond := #in~cond; {1385#true} is VALID [2022-04-08 06:38:15,725 INFO L290 TraceCheckUtils]: 31: Hoare triple {1385#true} assume !(0 == ~cond); {1385#true} is VALID [2022-04-08 06:38:15,725 INFO L290 TraceCheckUtils]: 32: Hoare triple {1385#true} assume true; {1385#true} is VALID [2022-04-08 06:38:15,726 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1385#true} {1459#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #89#return; {1459#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-08 06:38:15,726 INFO L272 TraceCheckUtils]: 34: Hoare triple {1459#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1385#true} is VALID [2022-04-08 06:38:15,726 INFO L290 TraceCheckUtils]: 35: Hoare triple {1385#true} ~cond := #in~cond; {1385#true} is VALID [2022-04-08 06:38:15,726 INFO L290 TraceCheckUtils]: 36: Hoare triple {1385#true} assume !(0 == ~cond); {1385#true} is VALID [2022-04-08 06:38:15,726 INFO L290 TraceCheckUtils]: 37: Hoare triple {1385#true} assume true; {1385#true} is VALID [2022-04-08 06:38:15,727 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1385#true} {1459#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #91#return; {1459#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-08 06:38:15,728 INFO L290 TraceCheckUtils]: 39: Hoare triple {1459#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (= main_~q~0 0) (= main_~B~0 main_~d~0))} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {1511#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-08 06:38:15,728 INFO L290 TraceCheckUtils]: 40: Hoare triple {1511#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} assume !false; {1511#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-08 06:38:15,729 INFO L272 TraceCheckUtils]: 41: Hoare triple {1511#(and (= main_~A~0 main_~r~0) (<= (mod main_~B~0 4294967296) 5) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {1518#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:38:15,730 INFO L290 TraceCheckUtils]: 42: Hoare triple {1518#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1522#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:38:15,730 INFO L290 TraceCheckUtils]: 43: Hoare triple {1522#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1386#false} is VALID [2022-04-08 06:38:15,730 INFO L290 TraceCheckUtils]: 44: Hoare triple {1386#false} assume !false; {1386#false} is VALID [2022-04-08 06:38:15,731 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-08 06:38:15,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:38:16,347 INFO L290 TraceCheckUtils]: 44: Hoare triple {1386#false} assume !false; {1386#false} is VALID [2022-04-08 06:38:16,348 INFO L290 TraceCheckUtils]: 43: Hoare triple {1522#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1386#false} is VALID [2022-04-08 06:38:16,348 INFO L290 TraceCheckUtils]: 42: Hoare triple {1518#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1522#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:38:16,350 INFO L272 TraceCheckUtils]: 41: Hoare triple {1538#(= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {1518#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:38:16,350 INFO L290 TraceCheckUtils]: 40: Hoare triple {1538#(= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296))} assume !false; {1538#(= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296))} is VALID [2022-04-08 06:38:16,351 INFO L290 TraceCheckUtils]: 39: Hoare triple {1545#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {1538#(= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296))} is VALID [2022-04-08 06:38:16,351 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1385#true} {1545#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} #91#return; {1545#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-08 06:38:16,351 INFO L290 TraceCheckUtils]: 37: Hoare triple {1385#true} assume true; {1385#true} is VALID [2022-04-08 06:38:16,351 INFO L290 TraceCheckUtils]: 36: Hoare triple {1385#true} assume !(0 == ~cond); {1385#true} is VALID [2022-04-08 06:38:16,352 INFO L290 TraceCheckUtils]: 35: Hoare triple {1385#true} ~cond := #in~cond; {1385#true} is VALID [2022-04-08 06:38:16,352 INFO L272 TraceCheckUtils]: 34: Hoare triple {1545#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1385#true} is VALID [2022-04-08 06:38:16,352 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1385#true} {1545#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} #89#return; {1545#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-08 06:38:16,353 INFO L290 TraceCheckUtils]: 32: Hoare triple {1385#true} assume true; {1385#true} is VALID [2022-04-08 06:38:16,353 INFO L290 TraceCheckUtils]: 31: Hoare triple {1385#true} assume !(0 == ~cond); {1385#true} is VALID [2022-04-08 06:38:16,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {1385#true} ~cond := #in~cond; {1385#true} is VALID [2022-04-08 06:38:16,353 INFO L272 TraceCheckUtils]: 29: Hoare triple {1545#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1385#true} is VALID [2022-04-08 06:38:16,354 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1385#true} {1545#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} #87#return; {1545#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-08 06:38:16,354 INFO L290 TraceCheckUtils]: 27: Hoare triple {1385#true} assume true; {1385#true} is VALID [2022-04-08 06:38:16,354 INFO L290 TraceCheckUtils]: 26: Hoare triple {1385#true} assume !(0 == ~cond); {1385#true} is VALID [2022-04-08 06:38:16,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {1385#true} ~cond := #in~cond; {1385#true} is VALID [2022-04-08 06:38:16,354 INFO L272 TraceCheckUtils]: 24: Hoare triple {1545#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1385#true} is VALID [2022-04-08 06:38:16,355 INFO L290 TraceCheckUtils]: 23: Hoare triple {1545#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} assume !false; {1545#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-08 06:38:16,356 INFO L290 TraceCheckUtils]: 22: Hoare triple {1385#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1545#(or (= (mod (+ (* main_~B~0 main_~q~0) main_~r~0) 4294967296) (mod main_~A~0 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-08 06:38:16,356 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1385#true} {1385#true} #85#return; {1385#true} is VALID [2022-04-08 06:38:16,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {1385#true} assume true; {1385#true} is VALID [2022-04-08 06:38:16,356 INFO L290 TraceCheckUtils]: 19: Hoare triple {1385#true} assume !(0 == ~cond); {1385#true} is VALID [2022-04-08 06:38:16,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {1385#true} ~cond := #in~cond; {1385#true} is VALID [2022-04-08 06:38:16,356 INFO L272 TraceCheckUtils]: 17: Hoare triple {1385#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1385#true} is VALID [2022-04-08 06:38:16,356 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1385#true} {1385#true} #83#return; {1385#true} is VALID [2022-04-08 06:38:16,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {1385#true} assume true; {1385#true} is VALID [2022-04-08 06:38:16,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {1385#true} assume !(0 == ~cond); {1385#true} is VALID [2022-04-08 06:38:16,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {1385#true} ~cond := #in~cond; {1385#true} is VALID [2022-04-08 06:38:16,357 INFO L272 TraceCheckUtils]: 12: Hoare triple {1385#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 5 then 1 else 0)); {1385#true} is VALID [2022-04-08 06:38:16,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {1385#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {1385#true} is VALID [2022-04-08 06:38:16,357 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1385#true} {1385#true} #81#return; {1385#true} is VALID [2022-04-08 06:38:16,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {1385#true} assume true; {1385#true} is VALID [2022-04-08 06:38:16,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {1385#true} assume !(0 == ~cond); {1385#true} is VALID [2022-04-08 06:38:16,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {1385#true} ~cond := #in~cond; {1385#true} is VALID [2022-04-08 06:38:16,358 INFO L272 TraceCheckUtils]: 6: Hoare triple {1385#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 5 then 1 else 0)); {1385#true} is VALID [2022-04-08 06:38:16,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {1385#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {1385#true} is VALID [2022-04-08 06:38:16,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {1385#true} call #t~ret6 := main(); {1385#true} is VALID [2022-04-08 06:38:16,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1385#true} {1385#true} #101#return; {1385#true} is VALID [2022-04-08 06:38:16,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {1385#true} assume true; {1385#true} is VALID [2022-04-08 06:38:16,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {1385#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);call #Ultimate.allocInit(12, 3); {1385#true} is VALID [2022-04-08 06:38:16,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {1385#true} call ULTIMATE.init(); {1385#true} is VALID [2022-04-08 06:38:16,359 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 06:38:16,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:38:16,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076337852] [2022-04-08 06:38:16,360 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:38:16,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214200054] [2022-04-08 06:38:16,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214200054] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 06:38:16,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 06:38:16,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-08 06:38:16,360 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:38:16,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [14678871] [2022-04-08 06:38:16,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [14678871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:38:16,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:38:16,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 06:38:16,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407620890] [2022-04-08 06:38:16,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:38:16,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 45 [2022-04-08 06:38:16,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:38:16,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 06:38:16,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:16,396 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 06:38:16,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:16,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 06:38:16,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-08 06:38:16,397 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 06:38:18,953 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:38:19,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:19,132 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2022-04-08 06:38:19,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 06:38:19,132 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 45 [2022-04-08 06:38:19,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:38:19,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 06:38:19,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-08 06:38:19,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 06:38:19,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-08 06:38:19,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2022-04-08 06:38:19,218 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-08 06:38:19,221 INFO L225 Difference]: With dead ends: 68 [2022-04-08 06:38:19,221 INFO L226 Difference]: Without dead ends: 66 [2022-04-08 06:38:19,221 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-08 06:38:19,222 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 12 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 06:38:19,222 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 151 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 06:38:19,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-08 06:38:19,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-04-08 06:38:19,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:38:19,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 06:38:19,248 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 06:38:19,250 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 06:38:19,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:19,257 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-04-08 06:38:19,257 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-04-08 06:38:19,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:19,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:19,260 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 66 states. [2022-04-08 06:38:19,261 INFO L87 Difference]: Start difference. First operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 66 states. [2022-04-08 06:38:19,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:19,264 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-04-08 06:38:19,264 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-04-08 06:38:19,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:19,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:19,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:38:19,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:38:19,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 06:38:19,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2022-04-08 06:38:19,268 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 45 [2022-04-08 06:38:19,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:38:19,268 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2022-04-08 06:38:19,268 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 06:38:19,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 81 transitions. [2022-04-08 06:38:19,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:19,386 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2022-04-08 06:38:19,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-08 06:38:19,387 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:38:19,387 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:38:19,414 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-08 06:38:19,587 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:38:19,588 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:38:19,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:38:19,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1471734606, now seen corresponding path program 1 times [2022-04-08 06:38:19,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:19,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1661246450] [2022-04-08 06:38:19,589 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:38:19,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1471734606, now seen corresponding path program 2 times [2022-04-08 06:38:19,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:38:19,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57893650] [2022-04-08 06:38:19,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:38:19,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:38:19,603 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:38:19,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [841262996] [2022-04-08 06:38:19,604 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:38:19,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:38:19,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:38:19,605 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-08 06:38:19,643 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-08 06:38:19,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:38:19,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:38:19,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-08 06:38:19,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:19,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:38:20,043 INFO L272 TraceCheckUtils]: 0: Hoare triple {2063#true} call ULTIMATE.init(); {2063#true} is VALID [2022-04-08 06:38:20,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {2063#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);call #Ultimate.allocInit(12, 3); {2063#true} is VALID [2022-04-08 06:38:20,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {2063#true} assume true; {2063#true} is VALID [2022-04-08 06:38:20,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2063#true} {2063#true} #101#return; {2063#true} is VALID [2022-04-08 06:38:20,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {2063#true} call #t~ret6 := main(); {2063#true} is VALID [2022-04-08 06:38:20,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {2063#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {2063#true} is VALID [2022-04-08 06:38:20,044 INFO L272 TraceCheckUtils]: 6: Hoare triple {2063#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 5 then 1 else 0)); {2063#true} is VALID [2022-04-08 06:38:20,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {2063#true} ~cond := #in~cond; {2063#true} is VALID [2022-04-08 06:38:20,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {2063#true} assume !(0 == ~cond); {2063#true} is VALID [2022-04-08 06:38:20,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {2063#true} assume true; {2063#true} is VALID [2022-04-08 06:38:20,045 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2063#true} {2063#true} #81#return; {2063#true} is VALID [2022-04-08 06:38:20,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {2063#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {2063#true} is VALID [2022-04-08 06:38:20,045 INFO L272 TraceCheckUtils]: 12: Hoare triple {2063#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 5 then 1 else 0)); {2063#true} is VALID [2022-04-08 06:38:20,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {2063#true} ~cond := #in~cond; {2063#true} is VALID [2022-04-08 06:38:20,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {2063#true} assume !(0 == ~cond); {2063#true} is VALID [2022-04-08 06:38:20,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {2063#true} assume true; {2063#true} is VALID [2022-04-08 06:38:20,046 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2063#true} {2063#true} #83#return; {2063#true} is VALID [2022-04-08 06:38:20,046 INFO L272 TraceCheckUtils]: 17: Hoare triple {2063#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2063#true} is VALID [2022-04-08 06:38:20,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {2063#true} ~cond := #in~cond; {2063#true} is VALID [2022-04-08 06:38:20,046 INFO L290 TraceCheckUtils]: 19: Hoare triple {2063#true} assume !(0 == ~cond); {2063#true} is VALID [2022-04-08 06:38:20,046 INFO L290 TraceCheckUtils]: 20: Hoare triple {2063#true} assume true; {2063#true} is VALID [2022-04-08 06:38:20,046 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2063#true} {2063#true} #85#return; {2063#true} is VALID [2022-04-08 06:38:20,047 INFO L290 TraceCheckUtils]: 22: Hoare triple {2063#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2134#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 06:38:20,047 INFO L290 TraceCheckUtils]: 23: Hoare triple {2134#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !false; {2134#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 06:38:20,047 INFO L272 TraceCheckUtils]: 24: Hoare triple {2134#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2063#true} is VALID [2022-04-08 06:38:20,048 INFO L290 TraceCheckUtils]: 25: Hoare triple {2063#true} ~cond := #in~cond; {2063#true} is VALID [2022-04-08 06:38:20,048 INFO L290 TraceCheckUtils]: 26: Hoare triple {2063#true} assume !(0 == ~cond); {2063#true} is VALID [2022-04-08 06:38:20,048 INFO L290 TraceCheckUtils]: 27: Hoare triple {2063#true} assume true; {2063#true} is VALID [2022-04-08 06:38:20,049 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2063#true} {2134#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #87#return; {2134#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 06:38:20,049 INFO L272 TraceCheckUtils]: 29: Hoare triple {2134#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2063#true} is VALID [2022-04-08 06:38:20,049 INFO L290 TraceCheckUtils]: 30: Hoare triple {2063#true} ~cond := #in~cond; {2063#true} is VALID [2022-04-08 06:38:20,049 INFO L290 TraceCheckUtils]: 31: Hoare triple {2063#true} assume !(0 == ~cond); {2063#true} is VALID [2022-04-08 06:38:20,049 INFO L290 TraceCheckUtils]: 32: Hoare triple {2063#true} assume true; {2063#true} is VALID [2022-04-08 06:38:20,050 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2063#true} {2134#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #89#return; {2134#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 06:38:20,050 INFO L272 TraceCheckUtils]: 34: Hoare triple {2134#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2063#true} is VALID [2022-04-08 06:38:20,050 INFO L290 TraceCheckUtils]: 35: Hoare triple {2063#true} ~cond := #in~cond; {2174#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:38:20,051 INFO L290 TraceCheckUtils]: 36: Hoare triple {2174#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2178#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:38:20,051 INFO L290 TraceCheckUtils]: 37: Hoare triple {2178#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2178#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:38:20,052 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2178#(not (= |__VERIFIER_assert_#in~cond| 0))} {2134#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #91#return; {2134#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 06:38:20,052 INFO L290 TraceCheckUtils]: 39: Hoare triple {2134#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2188#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-08 06:38:20,053 INFO L290 TraceCheckUtils]: 40: Hoare triple {2188#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} assume !false; {2188#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-08 06:38:20,053 INFO L272 TraceCheckUtils]: 41: Hoare triple {2188#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2063#true} is VALID [2022-04-08 06:38:20,053 INFO L290 TraceCheckUtils]: 42: Hoare triple {2063#true} ~cond := #in~cond; {2063#true} is VALID [2022-04-08 06:38:20,053 INFO L290 TraceCheckUtils]: 43: Hoare triple {2063#true} assume !(0 == ~cond); {2063#true} is VALID [2022-04-08 06:38:20,053 INFO L290 TraceCheckUtils]: 44: Hoare triple {2063#true} assume true; {2063#true} is VALID [2022-04-08 06:38:20,054 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2063#true} {2188#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} #87#return; {2188#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-08 06:38:20,054 INFO L272 TraceCheckUtils]: 46: Hoare triple {2188#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2063#true} is VALID [2022-04-08 06:38:20,054 INFO L290 TraceCheckUtils]: 47: Hoare triple {2063#true} ~cond := #in~cond; {2063#true} is VALID [2022-04-08 06:38:20,054 INFO L290 TraceCheckUtils]: 48: Hoare triple {2063#true} assume !(0 == ~cond); {2063#true} is VALID [2022-04-08 06:38:20,055 INFO L290 TraceCheckUtils]: 49: Hoare triple {2063#true} assume true; {2063#true} is VALID [2022-04-08 06:38:20,055 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2063#true} {2188#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} #89#return; {2188#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-08 06:38:20,058 INFO L272 TraceCheckUtils]: 51: Hoare triple {2188#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2225#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:38:20,058 INFO L290 TraceCheckUtils]: 52: Hoare triple {2225#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2229#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:38:20,059 INFO L290 TraceCheckUtils]: 53: Hoare triple {2229#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2064#false} is VALID [2022-04-08 06:38:20,059 INFO L290 TraceCheckUtils]: 54: Hoare triple {2064#false} assume !false; {2064#false} is VALID [2022-04-08 06:38:20,059 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 06:38:20,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:38:21,841 INFO L290 TraceCheckUtils]: 54: Hoare triple {2064#false} assume !false; {2064#false} is VALID [2022-04-08 06:38:21,842 INFO L290 TraceCheckUtils]: 53: Hoare triple {2229#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2064#false} is VALID [2022-04-08 06:38:21,842 INFO L290 TraceCheckUtils]: 52: Hoare triple {2225#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2229#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:38:21,843 INFO L272 TraceCheckUtils]: 51: Hoare triple {2245#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2225#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:38:21,844 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2063#true} {2245#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #89#return; {2245#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-08 06:38:21,844 INFO L290 TraceCheckUtils]: 49: Hoare triple {2063#true} assume true; {2063#true} is VALID [2022-04-08 06:38:21,844 INFO L290 TraceCheckUtils]: 48: Hoare triple {2063#true} assume !(0 == ~cond); {2063#true} is VALID [2022-04-08 06:38:21,844 INFO L290 TraceCheckUtils]: 47: Hoare triple {2063#true} ~cond := #in~cond; {2063#true} is VALID [2022-04-08 06:38:21,845 INFO L272 TraceCheckUtils]: 46: Hoare triple {2245#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2063#true} is VALID [2022-04-08 06:38:21,845 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2063#true} {2245#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #87#return; {2245#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-08 06:38:21,845 INFO L290 TraceCheckUtils]: 44: Hoare triple {2063#true} assume true; {2063#true} is VALID [2022-04-08 06:38:21,845 INFO L290 TraceCheckUtils]: 43: Hoare triple {2063#true} assume !(0 == ~cond); {2063#true} is VALID [2022-04-08 06:38:21,846 INFO L290 TraceCheckUtils]: 42: Hoare triple {2063#true} ~cond := #in~cond; {2063#true} is VALID [2022-04-08 06:38:21,846 INFO L272 TraceCheckUtils]: 41: Hoare triple {2245#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2063#true} is VALID [2022-04-08 06:38:21,852 INFO L290 TraceCheckUtils]: 40: Hoare triple {2245#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} assume !false; {2245#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-08 06:38:23,871 WARN L290 TraceCheckUtils]: 39: Hoare triple {2282#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2245#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is UNKNOWN [2022-04-08 06:38:24,000 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2178#(not (= |__VERIFIER_assert_#in~cond| 0))} {2063#true} #91#return; {2282#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-08 06:38:24,000 INFO L290 TraceCheckUtils]: 37: Hoare triple {2178#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2178#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:38:24,001 INFO L290 TraceCheckUtils]: 36: Hoare triple {2295#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2178#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:38:24,001 INFO L290 TraceCheckUtils]: 35: Hoare triple {2063#true} ~cond := #in~cond; {2295#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 06:38:24,001 INFO L272 TraceCheckUtils]: 34: Hoare triple {2063#true} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2063#true} is VALID [2022-04-08 06:38:24,001 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2063#true} {2063#true} #89#return; {2063#true} is VALID [2022-04-08 06:38:24,001 INFO L290 TraceCheckUtils]: 32: Hoare triple {2063#true} assume true; {2063#true} is VALID [2022-04-08 06:38:24,002 INFO L290 TraceCheckUtils]: 31: Hoare triple {2063#true} assume !(0 == ~cond); {2063#true} is VALID [2022-04-08 06:38:24,002 INFO L290 TraceCheckUtils]: 30: Hoare triple {2063#true} ~cond := #in~cond; {2063#true} is VALID [2022-04-08 06:38:24,002 INFO L272 TraceCheckUtils]: 29: Hoare triple {2063#true} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2063#true} is VALID [2022-04-08 06:38:24,002 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2063#true} {2063#true} #87#return; {2063#true} is VALID [2022-04-08 06:38:24,002 INFO L290 TraceCheckUtils]: 27: Hoare triple {2063#true} assume true; {2063#true} is VALID [2022-04-08 06:38:24,002 INFO L290 TraceCheckUtils]: 26: Hoare triple {2063#true} assume !(0 == ~cond); {2063#true} is VALID [2022-04-08 06:38:24,002 INFO L290 TraceCheckUtils]: 25: Hoare triple {2063#true} ~cond := #in~cond; {2063#true} is VALID [2022-04-08 06:38:24,002 INFO L272 TraceCheckUtils]: 24: Hoare triple {2063#true} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2063#true} is VALID [2022-04-08 06:38:24,003 INFO L290 TraceCheckUtils]: 23: Hoare triple {2063#true} assume !false; {2063#true} is VALID [2022-04-08 06:38:24,003 INFO L290 TraceCheckUtils]: 22: Hoare triple {2063#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2063#true} is VALID [2022-04-08 06:38:24,003 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2063#true} {2063#true} #85#return; {2063#true} is VALID [2022-04-08 06:38:24,003 INFO L290 TraceCheckUtils]: 20: Hoare triple {2063#true} assume true; {2063#true} is VALID [2022-04-08 06:38:24,003 INFO L290 TraceCheckUtils]: 19: Hoare triple {2063#true} assume !(0 == ~cond); {2063#true} is VALID [2022-04-08 06:38:24,003 INFO L290 TraceCheckUtils]: 18: Hoare triple {2063#true} ~cond := #in~cond; {2063#true} is VALID [2022-04-08 06:38:24,003 INFO L272 TraceCheckUtils]: 17: Hoare triple {2063#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2063#true} is VALID [2022-04-08 06:38:24,003 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2063#true} {2063#true} #83#return; {2063#true} is VALID [2022-04-08 06:38:24,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {2063#true} assume true; {2063#true} is VALID [2022-04-08 06:38:24,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {2063#true} assume !(0 == ~cond); {2063#true} is VALID [2022-04-08 06:38:24,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {2063#true} ~cond := #in~cond; {2063#true} is VALID [2022-04-08 06:38:24,004 INFO L272 TraceCheckUtils]: 12: Hoare triple {2063#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 5 then 1 else 0)); {2063#true} is VALID [2022-04-08 06:38:24,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {2063#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {2063#true} is VALID [2022-04-08 06:38:24,004 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2063#true} {2063#true} #81#return; {2063#true} is VALID [2022-04-08 06:38:24,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {2063#true} assume true; {2063#true} is VALID [2022-04-08 06:38:24,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {2063#true} assume !(0 == ~cond); {2063#true} is VALID [2022-04-08 06:38:24,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {2063#true} ~cond := #in~cond; {2063#true} is VALID [2022-04-08 06:38:24,005 INFO L272 TraceCheckUtils]: 6: Hoare triple {2063#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 5 then 1 else 0)); {2063#true} is VALID [2022-04-08 06:38:24,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {2063#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {2063#true} is VALID [2022-04-08 06:38:24,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {2063#true} call #t~ret6 := main(); {2063#true} is VALID [2022-04-08 06:38:24,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2063#true} {2063#true} #101#return; {2063#true} is VALID [2022-04-08 06:38:24,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {2063#true} assume true; {2063#true} is VALID [2022-04-08 06:38:24,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {2063#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);call #Ultimate.allocInit(12, 3); {2063#true} is VALID [2022-04-08 06:38:24,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {2063#true} call ULTIMATE.init(); {2063#true} is VALID [2022-04-08 06:38:24,006 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 06:38:24,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:38:24,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57893650] [2022-04-08 06:38:24,006 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:38:24,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841262996] [2022-04-08 06:38:24,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841262996] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:38:24,007 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:38:24,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-04-08 06:38:24,008 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:38:24,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1661246450] [2022-04-08 06:38:24,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1661246450] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:38:24,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:38:24,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 06:38:24,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16701372] [2022-04-08 06:38:24,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:38:24,009 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 55 [2022-04-08 06:38:24,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:38:24,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 06:38:24,243 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-08 06:38:24,243 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 06:38:24,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:24,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 06:38:24,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-08 06:38:24,244 INFO L87 Difference]: Start difference. First operand 64 states and 81 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 06:38:27,727 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-08 06:38:32,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:32,999 INFO L93 Difference]: Finished difference Result 85 states and 109 transitions. [2022-04-08 06:38:32,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 06:38:32,999 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 55 [2022-04-08 06:38:33,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:38:33,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 06:38:33,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-04-08 06:38:33,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 06:38:33,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-04-08 06:38:33,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 88 transitions. [2022-04-08 06:38:35,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 87 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:35,490 INFO L225 Difference]: With dead ends: 85 [2022-04-08 06:38:35,490 INFO L226 Difference]: Without dead ends: 77 [2022-04-08 06:38:35,491 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-08 06:38:35,491 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 14 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-04-08 06:38:35,492 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 186 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 222 Invalid, 1 Unknown, 0 Unchecked, 7.7s Time] [2022-04-08 06:38:35,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-08 06:38:35,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-04-08 06:38:35,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:38:35,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 77 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 45 states have internal predecessors, (52), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 06:38:35,516 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 77 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 45 states have internal predecessors, (52), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 06:38:35,516 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 77 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 45 states have internal predecessors, (52), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 06:38:35,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:35,520 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2022-04-08 06:38:35,520 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 99 transitions. [2022-04-08 06:38:35,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:35,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:35,521 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 45 states have internal predecessors, (52), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 77 states. [2022-04-08 06:38:35,521 INFO L87 Difference]: Start difference. First operand has 77 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 45 states have internal predecessors, (52), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 77 states. [2022-04-08 06:38:35,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:35,525 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2022-04-08 06:38:35,525 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 99 transitions. [2022-04-08 06:38:35,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:35,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:35,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:38:35,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:38:35,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 45 states have internal predecessors, (52), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 06:38:35,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 99 transitions. [2022-04-08 06:38:35,530 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 99 transitions. Word has length 55 [2022-04-08 06:38:35,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:38:35,530 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 99 transitions. [2022-04-08 06:38:35,530 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 06:38:35,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 99 transitions. [2022-04-08 06:38:35,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:35,722 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 99 transitions. [2022-04-08 06:38:35,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-08 06:38:35,723 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:38:35,723 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2022-04-08 06:38:35,731 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-08 06:38:35,924 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:38:35,924 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:38:35,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:38:35,925 INFO L85 PathProgramCache]: Analyzing trace with hash -682689219, now seen corresponding path program 1 times [2022-04-08 06:38:35,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:35,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1029208334] [2022-04-08 06:38:35,925 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:38:35,925 INFO L85 PathProgramCache]: Analyzing trace with hash -682689219, now seen corresponding path program 2 times [2022-04-08 06:38:35,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:38:35,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56080636] [2022-04-08 06:38:35,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:38:35,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:38:35,942 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:38:35,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [620588831] [2022-04-08 06:38:35,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:38:35,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:38:35,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:38:35,943 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-08 06:38:35,948 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-08 06:38:36,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:38:36,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:38:36,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 06:38:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:38:36,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:38:38,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {2885#true} call ULTIMATE.init(); {2885#true} is VALID [2022-04-08 06:38:38,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {2885#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);call #Ultimate.allocInit(12, 3); {2885#true} is VALID [2022-04-08 06:38:38,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {2885#true} assume true; {2885#true} is VALID [2022-04-08 06:38:38,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2885#true} {2885#true} #101#return; {2885#true} is VALID [2022-04-08 06:38:38,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {2885#true} call #t~ret6 := main(); {2885#true} is VALID [2022-04-08 06:38:38,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {2885#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {2885#true} is VALID [2022-04-08 06:38:38,519 INFO L272 TraceCheckUtils]: 6: Hoare triple {2885#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 5 then 1 else 0)); {2885#true} is VALID [2022-04-08 06:38:38,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {2885#true} ~cond := #in~cond; {2885#true} is VALID [2022-04-08 06:38:38,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {2885#true} assume !(0 == ~cond); {2885#true} is VALID [2022-04-08 06:38:38,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {2885#true} assume true; {2885#true} is VALID [2022-04-08 06:38:38,519 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2885#true} {2885#true} #81#return; {2885#true} is VALID [2022-04-08 06:38:38,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {2885#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {2885#true} is VALID [2022-04-08 06:38:38,519 INFO L272 TraceCheckUtils]: 12: Hoare triple {2885#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 5 then 1 else 0)); {2885#true} is VALID [2022-04-08 06:38:38,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {2885#true} ~cond := #in~cond; {2929#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 06:38:38,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {2929#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2933#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:38:38,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {2933#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2933#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 06:38:38,524 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2933#(not (= |assume_abort_if_not_#in~cond| 0))} {2885#true} #83#return; {2940#(<= (mod main_~B~0 4294967296) 5)} is VALID [2022-04-08 06:38:38,524 INFO L272 TraceCheckUtils]: 17: Hoare triple {2940#(<= (mod main_~B~0 4294967296) 5)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2885#true} is VALID [2022-04-08 06:38:38,524 INFO L290 TraceCheckUtils]: 18: Hoare triple {2885#true} ~cond := #in~cond; {2885#true} is VALID [2022-04-08 06:38:38,525 INFO L290 TraceCheckUtils]: 19: Hoare triple {2885#true} assume !(0 == ~cond); {2885#true} is VALID [2022-04-08 06:38:38,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {2885#true} assume true; {2885#true} is VALID [2022-04-08 06:38:38,532 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2885#true} {2940#(<= (mod main_~B~0 4294967296) 5)} #85#return; {2940#(<= (mod main_~B~0 4294967296) 5)} is VALID [2022-04-08 06:38:38,532 INFO L290 TraceCheckUtils]: 22: Hoare triple {2940#(<= (mod main_~B~0 4294967296) 5)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2959#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} is VALID [2022-04-08 06:38:38,533 INFO L290 TraceCheckUtils]: 23: Hoare triple {2959#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} assume !false; {2959#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} is VALID [2022-04-08 06:38:38,533 INFO L272 TraceCheckUtils]: 24: Hoare triple {2959#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2885#true} is VALID [2022-04-08 06:38:38,533 INFO L290 TraceCheckUtils]: 25: Hoare triple {2885#true} ~cond := #in~cond; {2885#true} is VALID [2022-04-08 06:38:38,533 INFO L290 TraceCheckUtils]: 26: Hoare triple {2885#true} assume !(0 == ~cond); {2885#true} is VALID [2022-04-08 06:38:38,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {2885#true} assume true; {2885#true} is VALID [2022-04-08 06:38:38,534 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2885#true} {2959#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} #87#return; {2959#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} is VALID [2022-04-08 06:38:38,534 INFO L272 TraceCheckUtils]: 29: Hoare triple {2959#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2885#true} is VALID [2022-04-08 06:38:38,534 INFO L290 TraceCheckUtils]: 30: Hoare triple {2885#true} ~cond := #in~cond; {2885#true} is VALID [2022-04-08 06:38:38,534 INFO L290 TraceCheckUtils]: 31: Hoare triple {2885#true} assume !(0 == ~cond); {2885#true} is VALID [2022-04-08 06:38:38,535 INFO L290 TraceCheckUtils]: 32: Hoare triple {2885#true} assume true; {2885#true} is VALID [2022-04-08 06:38:38,535 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2885#true} {2959#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} #89#return; {2959#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} is VALID [2022-04-08 06:38:38,535 INFO L272 TraceCheckUtils]: 34: Hoare triple {2959#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2885#true} is VALID [2022-04-08 06:38:38,535 INFO L290 TraceCheckUtils]: 35: Hoare triple {2885#true} ~cond := #in~cond; {2885#true} is VALID [2022-04-08 06:38:38,536 INFO L290 TraceCheckUtils]: 36: Hoare triple {2885#true} assume !(0 == ~cond); {2885#true} is VALID [2022-04-08 06:38:38,536 INFO L290 TraceCheckUtils]: 37: Hoare triple {2885#true} assume true; {2885#true} is VALID [2022-04-08 06:38:38,536 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2885#true} {2959#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} #91#return; {2959#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} is VALID [2022-04-08 06:38:38,537 INFO L290 TraceCheckUtils]: 39: Hoare triple {2959#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {3011#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} is VALID [2022-04-08 06:38:38,537 INFO L290 TraceCheckUtils]: 40: Hoare triple {3011#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} assume !false; {3011#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} is VALID [2022-04-08 06:38:38,538 INFO L272 TraceCheckUtils]: 41: Hoare triple {3011#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {2885#true} is VALID [2022-04-08 06:38:38,538 INFO L290 TraceCheckUtils]: 42: Hoare triple {2885#true} ~cond := #in~cond; {2885#true} is VALID [2022-04-08 06:38:38,538 INFO L290 TraceCheckUtils]: 43: Hoare triple {2885#true} assume !(0 == ~cond); {2885#true} is VALID [2022-04-08 06:38:38,538 INFO L290 TraceCheckUtils]: 44: Hoare triple {2885#true} assume true; {2885#true} is VALID [2022-04-08 06:38:38,539 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2885#true} {3011#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} #93#return; {3011#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} is VALID [2022-04-08 06:38:38,539 INFO L272 TraceCheckUtils]: 46: Hoare triple {3011#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2885#true} is VALID [2022-04-08 06:38:38,539 INFO L290 TraceCheckUtils]: 47: Hoare triple {2885#true} ~cond := #in~cond; {2885#true} is VALID [2022-04-08 06:38:38,539 INFO L290 TraceCheckUtils]: 48: Hoare triple {2885#true} assume !(0 == ~cond); {2885#true} is VALID [2022-04-08 06:38:38,539 INFO L290 TraceCheckUtils]: 49: Hoare triple {2885#true} assume true; {2885#true} is VALID [2022-04-08 06:38:38,540 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2885#true} {3011#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} #95#return; {3011#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} is VALID [2022-04-08 06:38:38,541 INFO L290 TraceCheckUtils]: 51: Hoare triple {3011#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} assume !(1 != ~p~0 % 4294967296); {3011#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} is VALID [2022-04-08 06:38:38,541 INFO L272 TraceCheckUtils]: 52: Hoare triple {3011#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0) (<= (mod main_~d~0 4294967296) 5))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {3051#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:38:38,542 INFO L290 TraceCheckUtils]: 53: Hoare triple {3051#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3055#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:38:38,542 INFO L290 TraceCheckUtils]: 54: Hoare triple {3055#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2886#false} is VALID [2022-04-08 06:38:38,542 INFO L290 TraceCheckUtils]: 55: Hoare triple {2886#false} assume !false; {2886#false} is VALID [2022-04-08 06:38:38,543 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-08 06:38:38,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:38:40,360 INFO L290 TraceCheckUtils]: 55: Hoare triple {2886#false} assume !false; {2886#false} is VALID [2022-04-08 06:38:40,361 INFO L290 TraceCheckUtils]: 54: Hoare triple {3055#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2886#false} is VALID [2022-04-08 06:38:40,361 INFO L290 TraceCheckUtils]: 53: Hoare triple {3051#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3055#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:38:40,362 INFO L272 TraceCheckUtils]: 52: Hoare triple {3071#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {3051#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:38:40,363 INFO L290 TraceCheckUtils]: 51: Hoare triple {3071#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} assume !(1 != ~p~0 % 4294967296); {3071#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-08 06:38:40,363 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2885#true} {3071#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} #95#return; {3071#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-08 06:38:40,363 INFO L290 TraceCheckUtils]: 49: Hoare triple {2885#true} assume true; {2885#true} is VALID [2022-04-08 06:38:40,363 INFO L290 TraceCheckUtils]: 48: Hoare triple {2885#true} assume !(0 == ~cond); {2885#true} is VALID [2022-04-08 06:38:40,363 INFO L290 TraceCheckUtils]: 47: Hoare triple {2885#true} ~cond := #in~cond; {2885#true} is VALID [2022-04-08 06:38:40,364 INFO L272 TraceCheckUtils]: 46: Hoare triple {3071#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2885#true} is VALID [2022-04-08 06:38:40,364 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2885#true} {3071#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} #93#return; {3071#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-08 06:38:40,364 INFO L290 TraceCheckUtils]: 44: Hoare triple {2885#true} assume true; {2885#true} is VALID [2022-04-08 06:38:40,364 INFO L290 TraceCheckUtils]: 43: Hoare triple {2885#true} assume !(0 == ~cond); {2885#true} is VALID [2022-04-08 06:38:40,364 INFO L290 TraceCheckUtils]: 42: Hoare triple {2885#true} ~cond := #in~cond; {2885#true} is VALID [2022-04-08 06:38:40,364 INFO L272 TraceCheckUtils]: 41: Hoare triple {3071#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {2885#true} is VALID [2022-04-08 06:38:40,365 INFO L290 TraceCheckUtils]: 40: Hoare triple {3071#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} assume !false; {3071#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-08 06:38:40,365 INFO L290 TraceCheckUtils]: 39: Hoare triple {3111#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {3071#(= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296))} is VALID [2022-04-08 06:38:40,366 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2885#true} {3111#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} #91#return; {3111#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-08 06:38:40,366 INFO L290 TraceCheckUtils]: 37: Hoare triple {2885#true} assume true; {2885#true} is VALID [2022-04-08 06:38:40,366 INFO L290 TraceCheckUtils]: 36: Hoare triple {2885#true} assume !(0 == ~cond); {2885#true} is VALID [2022-04-08 06:38:40,366 INFO L290 TraceCheckUtils]: 35: Hoare triple {2885#true} ~cond := #in~cond; {2885#true} is VALID [2022-04-08 06:38:40,366 INFO L272 TraceCheckUtils]: 34: Hoare triple {3111#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2885#true} is VALID [2022-04-08 06:38:40,367 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2885#true} {3111#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} #89#return; {3111#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-08 06:38:40,367 INFO L290 TraceCheckUtils]: 32: Hoare triple {2885#true} assume true; {2885#true} is VALID [2022-04-08 06:38:40,367 INFO L290 TraceCheckUtils]: 31: Hoare triple {2885#true} assume !(0 == ~cond); {2885#true} is VALID [2022-04-08 06:38:40,367 INFO L290 TraceCheckUtils]: 30: Hoare triple {2885#true} ~cond := #in~cond; {2885#true} is VALID [2022-04-08 06:38:40,367 INFO L272 TraceCheckUtils]: 29: Hoare triple {3111#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2885#true} is VALID [2022-04-08 06:38:40,368 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2885#true} {3111#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} #87#return; {3111#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-08 06:38:40,368 INFO L290 TraceCheckUtils]: 27: Hoare triple {2885#true} assume true; {2885#true} is VALID [2022-04-08 06:38:40,368 INFO L290 TraceCheckUtils]: 26: Hoare triple {2885#true} assume !(0 == ~cond); {2885#true} is VALID [2022-04-08 06:38:40,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {2885#true} ~cond := #in~cond; {2885#true} is VALID [2022-04-08 06:38:40,368 INFO L272 TraceCheckUtils]: 24: Hoare triple {3111#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2885#true} is VALID [2022-04-08 06:38:40,369 INFO L290 TraceCheckUtils]: 23: Hoare triple {3111#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} assume !false; {3111#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-08 06:38:40,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {2885#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3111#(or (= (mod main_~A~0 4294967296) (mod (+ (* main_~d~0 main_~q~0) main_~r~0) 4294967296)) (<= (mod main_~d~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-08 06:38:40,369 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2885#true} {2885#true} #85#return; {2885#true} is VALID [2022-04-08 06:38:40,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {2885#true} assume true; {2885#true} is VALID [2022-04-08 06:38:40,369 INFO L290 TraceCheckUtils]: 19: Hoare triple {2885#true} assume !(0 == ~cond); {2885#true} is VALID [2022-04-08 06:38:40,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {2885#true} ~cond := #in~cond; {2885#true} is VALID [2022-04-08 06:38:40,369 INFO L272 TraceCheckUtils]: 17: Hoare triple {2885#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2885#true} is VALID [2022-04-08 06:38:40,370 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2885#true} {2885#true} #83#return; {2885#true} is VALID [2022-04-08 06:38:40,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {2885#true} assume true; {2885#true} is VALID [2022-04-08 06:38:40,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {2885#true} assume !(0 == ~cond); {2885#true} is VALID [2022-04-08 06:38:40,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {2885#true} ~cond := #in~cond; {2885#true} is VALID [2022-04-08 06:38:40,370 INFO L272 TraceCheckUtils]: 12: Hoare triple {2885#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 5 then 1 else 0)); {2885#true} is VALID [2022-04-08 06:38:40,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {2885#true} ~B~0 := #t~nondet5;havoc #t~nondet5; {2885#true} is VALID [2022-04-08 06:38:40,370 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2885#true} {2885#true} #81#return; {2885#true} is VALID [2022-04-08 06:38:40,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {2885#true} assume true; {2885#true} is VALID [2022-04-08 06:38:40,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {2885#true} assume !(0 == ~cond); {2885#true} is VALID [2022-04-08 06:38:40,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {2885#true} ~cond := #in~cond; {2885#true} is VALID [2022-04-08 06:38:40,371 INFO L272 TraceCheckUtils]: 6: Hoare triple {2885#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 5 then 1 else 0)); {2885#true} is VALID [2022-04-08 06:38:40,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {2885#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4; {2885#true} is VALID [2022-04-08 06:38:40,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {2885#true} call #t~ret6 := main(); {2885#true} is VALID [2022-04-08 06:38:40,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2885#true} {2885#true} #101#return; {2885#true} is VALID [2022-04-08 06:38:40,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {2885#true} assume true; {2885#true} is VALID [2022-04-08 06:38:40,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {2885#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);call #Ultimate.allocInit(12, 3); {2885#true} is VALID [2022-04-08 06:38:40,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {2885#true} call ULTIMATE.init(); {2885#true} is VALID [2022-04-08 06:38:40,372 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-08 06:38:40,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:38:40,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56080636] [2022-04-08 06:38:40,372 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:38:40,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620588831] [2022-04-08 06:38:40,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620588831] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 06:38:40,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 06:38:40,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-08 06:38:40,373 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:38:40,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1029208334] [2022-04-08 06:38:40,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1029208334] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:38:40,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:38:40,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 06:38:40,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006267596] [2022-04-08 06:38:40,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:38:40,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 56 [2022-04-08 06:38:40,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:38:40,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 06:38:40,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:40,418 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 06:38:40,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:40,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 06:38:40,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-08 06:38:40,418 INFO L87 Difference]: Start difference. First operand 77 states and 99 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 06:38:45,807 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:38:48,862 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:38:49,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:49,013 INFO L93 Difference]: Finished difference Result 83 states and 104 transitions. [2022-04-08 06:38:49,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 06:38:49,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 56 [2022-04-08 06:38:49,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:38:49,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 06:38:49,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 06:38:49,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 06:38:49,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-08 06:38:49,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-08 06:38:49,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:49,096 INFO L225 Difference]: With dead ends: 83 [2022-04-08 06:38:49,096 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 06:38:49,096 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-08 06:38:49,097 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 9 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-04-08 06:38:49,097 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 148 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 2 Unknown, 0 Unchecked, 5.7s Time] [2022-04-08 06:38:49,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 06:38:49,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2022-04-08 06:38:49,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:38:49,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 75 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 24 states have call successors, (24), 9 states have call predecessors, (24), 8 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 06:38:49,120 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 75 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 24 states have call successors, (24), 9 states have call predecessors, (24), 8 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 06:38:49,120 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 75 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 24 states have call successors, (24), 9 states have call predecessors, (24), 8 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 06:38:49,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:49,125 INFO L93 Difference]: Finished difference Result 76 states and 97 transitions. [2022-04-08 06:38:49,125 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2022-04-08 06:38:49,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:49,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:49,126 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 24 states have call successors, (24), 9 states have call predecessors, (24), 8 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand 76 states. [2022-04-08 06:38:49,126 INFO L87 Difference]: Start difference. First operand has 75 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 24 states have call successors, (24), 9 states have call predecessors, (24), 8 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand 76 states. [2022-04-08 06:38:49,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:38:49,130 INFO L93 Difference]: Finished difference Result 76 states and 97 transitions. [2022-04-08 06:38:49,130 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2022-04-08 06:38:49,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:38:49,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:38:49,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:38:49,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:38:49,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 24 states have call successors, (24), 9 states have call predecessors, (24), 8 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 06:38:49,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2022-04-08 06:38:49,135 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 56 [2022-04-08 06:38:49,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:38:49,135 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2022-04-08 06:38:49,135 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 06:38:49,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 96 transitions. [2022-04-08 06:38:49,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:38:49,727 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2022-04-08 06:38:49,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-08 06:38:49,728 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:38:49,728 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:38:49,747 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-08 06:38:49,935 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:38:49,935 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:38:49,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:38:49,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1586192473, now seen corresponding path program 1 times [2022-04-08 06:38:49,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:38:49,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1823091280] [2022-04-08 06:38:49,936 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:38:49,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1586192473, now seen corresponding path program 2 times [2022-04-08 06:38:49,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:38:49,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599787691] [2022-04-08 06:38:49,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:38:49,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:38:49,947 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:38:49,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1986955473] [2022-04-08 06:38:49,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:38:49,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:38:49,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:38:49,963 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-08 06:38:49,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process