/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/divbin2_valuebound1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 05:12:50,265 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 05:12:50,267 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 05:12:50,303 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 05:12:50,303 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 05:12:50,304 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 05:12:50,306 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 05:12:50,308 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 05:12:50,310 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 05:12:50,314 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 05:12:50,315 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 05:12:50,316 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 05:12:50,316 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 05:12:50,318 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 05:12:50,318 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 05:12:50,321 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 05:12:50,321 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 05:12:50,322 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 05:12:50,323 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 05:12:50,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 05:12:50,329 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 05:12:50,329 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 05:12:50,330 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 05:12:50,330 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 05:12:50,331 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 05:12:50,336 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 05:12:50,337 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 05:12:50,337 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 05:12:50,337 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 05:12:50,338 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 05:12:50,340 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 05:12:50,341 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 05:12:50,342 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 05:12:50,342 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 05:12:50,343 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 05:12:50,343 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 05:12:50,343 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 05:12:50,344 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 05:12:50,344 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 05:12:50,344 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 05:12:50,344 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 05:12:50,346 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 05:12:50,346 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 05:12:50,353 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 05:12:50,354 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 05:12:50,355 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 05:12:50,355 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 05:12:50,355 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 05:12:50,355 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 05:12:50,355 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 05:12:50,355 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 05:12:50,356 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 05:12:50,356 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 05:12:50,356 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 05:12:50,356 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 05:12:50,356 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 05:12:50,356 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 05:12:50,357 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 05:12:50,357 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 05:12:50,357 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 05:12:50,357 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 05:12:50,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 05:12:50,357 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 05:12:50,357 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 05:12:50,357 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 05:12:50,357 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 05:12:50,357 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 05:12:50,357 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 05:12:50,358 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 05:12:50,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 05:12:50,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 05:12:50,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 05:12:50,614 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 05:12:50,615 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 05:12:50,616 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound1.i [2022-04-08 05:12:50,702 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2144bf653/53dc60aa59db4976ae42d8b3ea2552ae/FLAGacf3ea749 [2022-04-08 05:12:51,228 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 05:12:51,228 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound1.i [2022-04-08 05:12:51,236 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2144bf653/53dc60aa59db4976ae42d8b3ea2552ae/FLAGacf3ea749 [2022-04-08 05:12:51,661 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2144bf653/53dc60aa59db4976ae42d8b3ea2552ae [2022-04-08 05:12:51,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 05:12:51,664 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 05:12:51,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 05:12:51,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 05:12:51,669 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 05:12:51,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 05:12:51" (1/1) ... [2022-04-08 05:12:51,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61822a64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:12:51, skipping insertion in model container [2022-04-08 05:12:51,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 05:12:51" (1/1) ... [2022-04-08 05:12:51,676 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 05:12:51,696 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 05:12:51,847 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/divbin2_valuebound1.i[951,964] [2022-04-08 05:12:51,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 05:12:51,891 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 05:12:51,904 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/divbin2_valuebound1.i[951,964] [2022-04-08 05:12:51,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 05:12:51,922 INFO L208 MainTranslator]: Completed translation [2022-04-08 05:12:51,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:12:51 WrapperNode [2022-04-08 05:12:51,922 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 05:12:51,924 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 05:12:51,924 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 05:12:51,925 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 05:12:51,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:12:51" (1/1) ... [2022-04-08 05:12:51,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:12:51" (1/1) ... [2022-04-08 05:12:51,939 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:12:51" (1/1) ... [2022-04-08 05:12:51,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:12:51" (1/1) ... [2022-04-08 05:12:51,944 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:12:51" (1/1) ... [2022-04-08 05:12:51,947 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:12:51" (1/1) ... [2022-04-08 05:12:51,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:12:51" (1/1) ... [2022-04-08 05:12:51,949 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 05:12:51,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 05:12:51,950 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 05:12:51,950 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 05:12:51,951 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:12:51" (1/1) ... [2022-04-08 05:12:51,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 05:12:51,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:12:51,974 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 05:12:51,999 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 05:12:52,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 05:12:52,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 05:12:52,036 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 05:12:52,036 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 05:12:52,036 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 05:12:52,036 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 05:12:52,036 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 05:12:52,036 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 05:12:52,037 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 05:12:52,037 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 05:12:52,037 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 05:12:52,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 05:12:52,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 05:12:52,038 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 05:12:52,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 05:12:52,038 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 05:12:52,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 05:12:52,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 05:12:52,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 05:12:52,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 05:12:52,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 05:12:52,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 05:12:52,093 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 05:12:52,094 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 05:12:52,287 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 05:12:52,304 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 05:12:52,304 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 05:12:52,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 05:12:52 BoogieIcfgContainer [2022-04-08 05:12:52,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 05:12:52,307 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 05:12:52,307 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 05:12:52,313 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 05:12:52,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 05:12:51" (1/3) ... [2022-04-08 05:12:52,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@216822ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 05:12:52, skipping insertion in model container [2022-04-08 05:12:52,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:12:51" (2/3) ... [2022-04-08 05:12:52,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@216822ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 05:12:52, skipping insertion in model container [2022-04-08 05:12:52,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 05:12:52" (3/3) ... [2022-04-08 05:12:52,322 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2_valuebound1.i [2022-04-08 05:12:52,325 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 05:12:52,326 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 05:12:52,408 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 05:12:52,422 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 05:12:52,423 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 05:12:52,461 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 05:12:52,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 05:12:52,466 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:12:52,466 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:12:52,466 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:12:52,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:12:52,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1171333446, now seen corresponding path program 1 times [2022-04-08 05:12:52,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:12:52,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1275553754] [2022-04-08 05:12:52,522 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:12:52,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1171333446, now seen corresponding path program 2 times [2022-04-08 05:12:52,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:12:52,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380939134] [2022-04-08 05:12:52,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:12:52,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:12:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:12:52,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 05:12:52,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:12:52,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#(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(10, 2); {33#true} is VALID [2022-04-08 05:12:52,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-08 05:12:52,882 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #84#return; {33#true} is VALID [2022-04-08 05:12:52,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 05:12:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:12:52,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-08 05:12:52,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-08 05:12:52,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-08 05:12:52,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} #78#return; {34#false} is VALID [2022-04-08 05:12:52,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 05:12:52,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(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(10, 2); {33#true} is VALID [2022-04-08 05:12:52,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-08 05:12:52,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #84#return; {33#true} is VALID [2022-04-08 05:12:52,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret2 := main(); {33#true} is VALID [2022-04-08 05:12:52,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {33#true} is VALID [2022-04-08 05:12:52,902 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {33#true} is VALID [2022-04-08 05:12:52,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-08 05:12:52,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-08 05:12:52,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-08 05:12:52,904 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #78#return; {34#false} is VALID [2022-04-08 05:12:52,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {34#false} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {34#false} is VALID [2022-04-08 05:12:52,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-08 05:12:52,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-08 05:12:52,906 INFO L272 TraceCheckUtils]: 14: Hoare triple {34#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {34#false} is VALID [2022-04-08 05:12:52,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-08 05:12:52,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-08 05:12:52,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-08 05:12:52,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 05:12:52,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:12:52,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380939134] [2022-04-08 05:12:52,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380939134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:12:52,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:12:52,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 05:12:52,915 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:12:52,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1275553754] [2022-04-08 05:12:52,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1275553754] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:12:52,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:12:52,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 05:12:52,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937928751] [2022-04-08 05:12:52,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:12:52,920 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-08 05:12:52,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:12:52,924 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 05:12:52,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:12:52,950 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 05:12:52,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:12:52,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 05:12:52,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 05:12:52,971 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 05:12:53,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:12:53,067 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-08 05:12:53,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 05:12:53,067 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-08 05:12:53,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:12:53,068 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 05:12:53,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-08 05:12:53,075 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 05:12:53,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-08 05:12:53,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-08 05:12:53,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:12:53,159 INFO L225 Difference]: With dead ends: 51 [2022-04-08 05:12:53,159 INFO L226 Difference]: Without dead ends: 25 [2022-04-08 05:12:53,161 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 05:12:53,165 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 05:12:53,166 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:12:53,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-08 05:12:53,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-08 05:12:53,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:12:53,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 05:12:53,193 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 05:12:53,193 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 05:12:53,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:12:53,196 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-08 05:12:53,196 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 05:12:53,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:12:53,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:12:53,197 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-08 05:12:53,197 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-08 05:12:53,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:12:53,201 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-08 05:12:53,201 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 05:12:53,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:12:53,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:12:53,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:12:53,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:12:53,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 05:12:53,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-08 05:12:53,204 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 18 [2022-04-08 05:12:53,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:12:53,204 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-08 05:12:53,205 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 05:12:53,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-08 05:12:53,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:12:53,236 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 05:12:53,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 05:12:53,238 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:12:53,238 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:12:53,239 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 05:12:53,239 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:12:53,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:12:53,240 INFO L85 PathProgramCache]: Analyzing trace with hash -73515422, now seen corresponding path program 1 times [2022-04-08 05:12:53,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:12:53,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1323045871] [2022-04-08 05:12:53,240 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:12:53,240 INFO L85 PathProgramCache]: Analyzing trace with hash -73515422, now seen corresponding path program 2 times [2022-04-08 05:12:53,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:12:53,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792811292] [2022-04-08 05:12:53,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:12:53,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:12:53,257 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:12:53,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [266313718] [2022-04-08 05:12:53,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:12:53,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:12:53,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:12:53,275 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 05:12:53,322 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 05:12:53,339 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 05:12:53,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:12:53,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 05:12:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:12:53,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:12:53,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {247#true} call ULTIMATE.init(); {247#true} is VALID [2022-04-08 05:12:53,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {247#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {247#true} is VALID [2022-04-08 05:12:53,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {247#true} assume true; {247#true} is VALID [2022-04-08 05:12:53,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {247#true} {247#true} #84#return; {247#true} is VALID [2022-04-08 05:12:53,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {247#true} call #t~ret2 := main(); {247#true} is VALID [2022-04-08 05:12:53,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {247#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {247#true} is VALID [2022-04-08 05:12:53,765 INFO L272 TraceCheckUtils]: 6: Hoare triple {247#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {247#true} is VALID [2022-04-08 05:12:53,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {247#true} ~cond := #in~cond; {273#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:12:53,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {273#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {277#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:12:53,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {277#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {277#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:12:53,768 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {277#(not (= |assume_abort_if_not_#in~cond| 0))} {247#true} #78#return; {284#(<= (mod main_~A~0 4294967296) 1)} is VALID [2022-04-08 05:12:53,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {284#(<= (mod main_~A~0 4294967296) 1)} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {288#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-08 05:12:53,769 INFO L290 TraceCheckUtils]: 12: Hoare triple {288#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} assume !false; {288#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-08 05:12:53,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {288#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {295#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-08 05:12:53,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {295#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (= main_~q~0 0))} assume !false; {295#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-08 05:12:53,771 INFO L272 TraceCheckUtils]: 15: Hoare triple {295#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {302#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:12:53,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {302#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {306#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:12:53,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {306#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {248#false} is VALID [2022-04-08 05:12:53,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {248#false} assume !false; {248#false} is VALID [2022-04-08 05:12:53,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 05:12:53,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:12:53,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:12:53,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792811292] [2022-04-08 05:12:53,774 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:12:53,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266313718] [2022-04-08 05:12:53,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266313718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:12:53,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:12:53,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 05:12:53,776 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:12:53,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1323045871] [2022-04-08 05:12:53,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1323045871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:12:53,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:12:53,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 05:12:53,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019934602] [2022-04-08 05:12:53,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:12:53,777 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-04-08 05:12:53,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:12:53,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 05:12:53,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:12:53,796 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 05:12:53,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:12:53,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 05:12:53,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-08 05:12:53,799 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 05:12:54,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:12:54,141 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-08 05:12:54,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 05:12:54,142 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-04-08 05:12:54,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:12:54,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 05:12:54,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2022-04-08 05:12:54,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 05:12:54,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2022-04-08 05:12:54,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 42 transitions. [2022-04-08 05:12:54,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:12:54,200 INFO L225 Difference]: With dead ends: 37 [2022-04-08 05:12:54,200 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 05:12:54,201 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-08 05:12:54,203 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 05:12:54,206 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 104 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 05:12:54,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 05:12:54,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-08 05:12:54,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:12:54,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 05:12:54,224 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 05:12:54,224 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 05:12:54,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:12:54,226 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-08 05:12:54,226 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-08 05:12:54,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:12:54,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:12:54,227 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-08 05:12:54,227 INFO L87 Difference]: Start difference. First operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-08 05:12:54,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:12:54,228 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-08 05:12:54,228 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-08 05:12:54,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:12:54,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:12:54,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:12:54,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:12:54,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 05:12:54,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-08 05:12:54,231 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 19 [2022-04-08 05:12:54,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:12:54,231 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-08 05:12:54,231 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 05:12:54,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 38 transitions. [2022-04-08 05:12:54,277 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 05:12:54,277 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-08 05:12:54,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 05:12:54,278 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:12:54,278 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:12:54,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 05:12:54,499 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:12:54,499 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:12:54,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:12:54,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1211706883, now seen corresponding path program 1 times [2022-04-08 05:12:54,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:12:54,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [142897760] [2022-04-08 05:12:54,517 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 05:12:54,517 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 05:12:54,517 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 05:12:54,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1211706883, now seen corresponding path program 2 times [2022-04-08 05:12:54,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:12:54,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582711222] [2022-04-08 05:12:54,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:12:54,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:12:54,531 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:12:54,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1950974317] [2022-04-08 05:12:54,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:12:54,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:12:54,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:12:54,533 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 05:12:54,534 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 05:12:54,574 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 05:12:54,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:12:54,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 05:12:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:12:54,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:12:54,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {526#true} call ULTIMATE.init(); {526#true} is VALID [2022-04-08 05:12:54,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {526#true} is VALID [2022-04-08 05:12:54,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {526#true} assume true; {526#true} is VALID [2022-04-08 05:12:54,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {526#true} {526#true} #84#return; {526#true} is VALID [2022-04-08 05:12:54,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {526#true} call #t~ret2 := main(); {526#true} is VALID [2022-04-08 05:12:54,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {526#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {526#true} is VALID [2022-04-08 05:12:54,856 INFO L272 TraceCheckUtils]: 6: Hoare triple {526#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {526#true} is VALID [2022-04-08 05:12:54,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {526#true} ~cond := #in~cond; {552#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:12:54,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {552#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {556#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:12:54,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {556#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {556#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:12:54,858 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {556#(not (= |assume_abort_if_not_#in~cond| 0))} {526#true} #78#return; {563#(<= (mod main_~A~0 4294967296) 1)} is VALID [2022-04-08 05:12:54,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {563#(<= (mod main_~A~0 4294967296) 1)} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {567#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-08 05:12:54,859 INFO L290 TraceCheckUtils]: 12: Hoare triple {567#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} assume !false; {567#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-08 05:12:54,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {567#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {567#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-08 05:12:54,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {567#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} assume !false; {567#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-08 05:12:54,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {567#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {567#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-08 05:12:54,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {567#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} assume !false; {567#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-08 05:12:54,862 INFO L272 TraceCheckUtils]: 17: Hoare triple {567#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {586#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:12:54,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {586#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {590#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:12:54,863 INFO L290 TraceCheckUtils]: 19: Hoare triple {590#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {527#false} is VALID [2022-04-08 05:12:54,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {527#false} assume !false; {527#false} is VALID [2022-04-08 05:12:54,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 05:12:54,863 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:12:54,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:12:54,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582711222] [2022-04-08 05:12:54,863 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:12:54,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950974317] [2022-04-08 05:12:54,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950974317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:12:54,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:12:54,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 05:12:54,864 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:12:54,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [142897760] [2022-04-08 05:12:54,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [142897760] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:12:54,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:12:54,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 05:12:54,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917756983] [2022-04-08 05:12:54,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:12:54,865 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-08 05:12:54,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:12:54,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 05:12:54,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:12:54,883 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 05:12:54,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:12:54,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 05:12:54,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-08 05:12:54,884 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 05:12:55,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:12:55,138 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-08 05:12:55,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 05:12:55,138 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-08 05:12:55,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:12:55,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 05:12:55,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-04-08 05:12:55,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 05:12:55,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-04-08 05:12:55,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 41 transitions. [2022-04-08 05:12:55,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:12:55,176 INFO L225 Difference]: With dead ends: 45 [2022-04-08 05:12:55,176 INFO L226 Difference]: Without dead ends: 42 [2022-04-08 05:12:55,176 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-08 05:12:55,177 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 19 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 05:12:55,177 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 98 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 05:12:55,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-08 05:12:55,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2022-04-08 05:12:55,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:12:55,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 05:12:55,194 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 05:12:55,194 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 05:12:55,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:12:55,195 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-08 05:12:55,196 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-08 05:12:55,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:12:55,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:12:55,196 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 42 states. [2022-04-08 05:12:55,197 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 42 states. [2022-04-08 05:12:55,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:12:55,198 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-04-08 05:12:55,198 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-08 05:12:55,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:12:55,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:12:55,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:12:55,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:12:55,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 05:12:55,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-04-08 05:12:55,200 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 21 [2022-04-08 05:12:55,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:12:55,201 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-04-08 05:12:55,201 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 05:12:55,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 37 transitions. [2022-04-08 05:12:55,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:12:55,238 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-08 05:12:55,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 05:12:55,239 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:12:55,239 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:12:55,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-08 05:12:55,453 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 05:12:55,454 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:12:55,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:12:55,454 INFO L85 PathProgramCache]: Analyzing trace with hash 947727214, now seen corresponding path program 1 times [2022-04-08 05:12:55,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:12:55,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [943975913] [2022-04-08 05:12:55,455 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 05:12:55,455 INFO L85 PathProgramCache]: Analyzing trace with hash 947727214, now seen corresponding path program 2 times [2022-04-08 05:12:55,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:12:55,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706304908] [2022-04-08 05:12:55,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:12:55,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:12:55,464 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:12:55,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [471623374] [2022-04-08 05:12:55,465 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:12:55,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:12:55,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:12:55,482 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 05:12:55,519 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 05:12:55,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:12:55,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:12:55,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 05:12:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:12:55,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:12:55,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {840#true} call ULTIMATE.init(); {840#true} is VALID [2022-04-08 05:12:55,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {840#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {840#true} is VALID [2022-04-08 05:12:55,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-08 05:12:55,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {840#true} {840#true} #84#return; {840#true} is VALID [2022-04-08 05:12:55,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {840#true} call #t~ret2 := main(); {840#true} is VALID [2022-04-08 05:12:55,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {840#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {840#true} is VALID [2022-04-08 05:12:55,591 INFO L272 TraceCheckUtils]: 6: Hoare triple {840#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {840#true} is VALID [2022-04-08 05:12:55,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {840#true} ~cond := #in~cond; {840#true} is VALID [2022-04-08 05:12:55,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {840#true} assume !(0 == ~cond); {840#true} is VALID [2022-04-08 05:12:55,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-08 05:12:55,592 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {840#true} {840#true} #78#return; {840#true} is VALID [2022-04-08 05:12:55,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {840#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {878#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 05:12:55,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {878#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !false; {878#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 05:12:55,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {878#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {878#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 05:12:55,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {878#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !false; {878#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 05:12:55,593 INFO L272 TraceCheckUtils]: 15: Hoare triple {878#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {840#true} is VALID [2022-04-08 05:12:55,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {840#true} ~cond := #in~cond; {840#true} is VALID [2022-04-08 05:12:55,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {840#true} assume !(0 == ~cond); {840#true} is VALID [2022-04-08 05:12:55,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {840#true} assume true; {840#true} is VALID [2022-04-08 05:12:55,594 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {840#true} {878#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #80#return; {878#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-08 05:12:55,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {878#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {841#false} is VALID [2022-04-08 05:12:55,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {841#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {841#false} is VALID [2022-04-08 05:12:55,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {841#false} assume !false; {841#false} is VALID [2022-04-08 05:12:55,595 INFO L272 TraceCheckUtils]: 23: Hoare triple {841#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {841#false} is VALID [2022-04-08 05:12:55,596 INFO L290 TraceCheckUtils]: 24: Hoare triple {841#false} ~cond := #in~cond; {841#false} is VALID [2022-04-08 05:12:55,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {841#false} assume 0 == ~cond; {841#false} is VALID [2022-04-08 05:12:55,596 INFO L290 TraceCheckUtils]: 26: Hoare triple {841#false} assume !false; {841#false} is VALID [2022-04-08 05:12:55,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 05:12:55,596 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:12:55,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:12:55,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706304908] [2022-04-08 05:12:55,597 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:12:55,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471623374] [2022-04-08 05:12:55,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471623374] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:12:55,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:12:55,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 05:12:55,597 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:12:55,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [943975913] [2022-04-08 05:12:55,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [943975913] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:12:55,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:12:55,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 05:12:55,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024370285] [2022-04-08 05:12:55,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:12:55,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-08 05:12:55,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:12:55,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 05:12:55,614 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 05:12:55,614 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 05:12:55,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:12:55,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 05:12:55,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 05:12:55,615 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 05:12:55,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:12:55,664 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-04-08 05:12:55,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 05:12:55,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-08 05:12:55,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:12:55,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 05:12:55,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-08 05:12:55,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 05:12:55,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-08 05:12:55,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 48 transitions. [2022-04-08 05:12:55,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:12:55,698 INFO L225 Difference]: With dead ends: 57 [2022-04-08 05:12:55,698 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 05:12:55,698 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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 05:12:55,699 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 05:12:55,699 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:12:55,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 05:12:55,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-08 05:12:55,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:12:55,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 05:12:55,714 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 05:12:55,714 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 05:12:55,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:12:55,716 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-08 05:12:55,716 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-08 05:12:55,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:12:55,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:12:55,717 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 35 states. [2022-04-08 05:12:55,717 INFO L87 Difference]: Start difference. First operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 35 states. [2022-04-08 05:12:55,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:12:55,718 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-08 05:12:55,718 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-08 05:12:55,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:12:55,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:12:55,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:12:55,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:12:55,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 05:12:55,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-04-08 05:12:55,720 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 27 [2022-04-08 05:12:55,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:12:55,720 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-04-08 05:12:55,720 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 05:12:55,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 39 transitions. [2022-04-08 05:12:55,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:12:55,757 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-08 05:12:55,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 05:12:55,757 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:12:55,757 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:12:55,784 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 05:12:55,964 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:12:55,965 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:12:55,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:12:55,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1574040585, now seen corresponding path program 1 times [2022-04-08 05:12:55,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:12:55,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2139160295] [2022-04-08 05:12:55,973 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 05:12:55,974 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 05:12:55,974 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 05:12:55,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1574040585, now seen corresponding path program 2 times [2022-04-08 05:12:55,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:12:55,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149795499] [2022-04-08 05:12:55,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:12:55,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:12:55,987 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:12:55,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1294146192] [2022-04-08 05:12:55,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:12:55,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:12:55,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:12:55,991 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 05:12:56,071 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 05:12:56,085 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:12:56,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:12:56,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 05:12:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:12:56,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:12:56,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {1177#true} call ULTIMATE.init(); {1177#true} is VALID [2022-04-08 05:12:56,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {1177#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1177#true} is VALID [2022-04-08 05:12:56,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {1177#true} assume true; {1177#true} is VALID [2022-04-08 05:12:56,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1177#true} {1177#true} #84#return; {1177#true} is VALID [2022-04-08 05:12:56,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {1177#true} call #t~ret2 := main(); {1177#true} is VALID [2022-04-08 05:12:56,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {1177#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {1177#true} is VALID [2022-04-08 05:12:56,762 INFO L272 TraceCheckUtils]: 6: Hoare triple {1177#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {1177#true} is VALID [2022-04-08 05:12:56,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {1177#true} ~cond := #in~cond; {1203#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:12:56,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {1203#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1207#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:12:56,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {1207#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1207#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:12:56,764 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1207#(not (= |assume_abort_if_not_#in~cond| 0))} {1177#true} #78#return; {1214#(<= (mod main_~A~0 4294967296) 1)} is VALID [2022-04-08 05:12:56,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {1214#(<= (mod main_~A~0 4294967296) 1)} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1218#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-08 05:12:56,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {1218#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} assume !false; {1218#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-08 05:12:56,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {1218#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1225#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-08 05:12:56,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {1225#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !false; {1225#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-08 05:12:56,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {1225#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1225#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-08 05:12:56,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {1225#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !false; {1225#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-08 05:12:56,766 INFO L272 TraceCheckUtils]: 17: Hoare triple {1225#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (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)); {1177#true} is VALID [2022-04-08 05:12:56,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {1177#true} ~cond := #in~cond; {1177#true} is VALID [2022-04-08 05:12:56,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {1177#true} assume !(0 == ~cond); {1177#true} is VALID [2022-04-08 05:12:56,767 INFO L290 TraceCheckUtils]: 20: Hoare triple {1177#true} assume true; {1177#true} is VALID [2022-04-08 05:12:56,767 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1177#true} {1225#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} #80#return; {1225#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-08 05:12:56,768 INFO L290 TraceCheckUtils]: 22: Hoare triple {1225#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1253#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-08 05:12:56,768 INFO L290 TraceCheckUtils]: 23: Hoare triple {1253#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1257#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (<= (mod main_~A~0 4294967296) 1) (= (+ (- 1) main_~q~0) 0) (<= 1 (mod main_~A~0 4294967296)))} is VALID [2022-04-08 05:12:56,769 INFO L290 TraceCheckUtils]: 24: Hoare triple {1257#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (<= (mod main_~A~0 4294967296) 1) (= (+ (- 1) main_~q~0) 0) (<= 1 (mod main_~A~0 4294967296)))} assume !false; {1257#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (<= (mod main_~A~0 4294967296) 1) (= (+ (- 1) main_~q~0) 0) (<= 1 (mod main_~A~0 4294967296)))} is VALID [2022-04-08 05:12:56,770 INFO L272 TraceCheckUtils]: 25: Hoare triple {1257#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (<= (mod main_~A~0 4294967296) 1) (= (+ (- 1) main_~q~0) 0) (<= 1 (mod main_~A~0 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1264#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:12:56,770 INFO L290 TraceCheckUtils]: 26: Hoare triple {1264#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1268#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:12:56,771 INFO L290 TraceCheckUtils]: 27: Hoare triple {1268#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1178#false} is VALID [2022-04-08 05:12:56,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {1178#false} assume !false; {1178#false} is VALID [2022-04-08 05:12:56,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 05:12:56,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:13:28,956 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (* c_main_~b~0 2) 4294967296)) (.cse0 (mod c_main_~r~0 4294967296))) (or (not (<= (mod c_main_~b~0 4294967296) .cse0)) (= (mod c_main_~A~0 4294967296) (mod (+ (* (div .cse1 2) (* c_main_~q~0 2)) c_main_~r~0) 4294967296)) (<= .cse1 .cse0))) is different from true [2022-04-08 05:13:40,028 INFO L290 TraceCheckUtils]: 28: Hoare triple {1178#false} assume !false; {1178#false} is VALID [2022-04-08 05:13:40,028 INFO L290 TraceCheckUtils]: 27: Hoare triple {1268#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1178#false} is VALID [2022-04-08 05:13:40,028 INFO L290 TraceCheckUtils]: 26: Hoare triple {1264#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1268#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:13:40,030 INFO L272 TraceCheckUtils]: 25: Hoare triple {1284#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1264#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:13:40,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {1284#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !false; {1284#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-08 05:13:42,040 WARN L290 TraceCheckUtils]: 23: Hoare triple {1284#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1284#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is UNKNOWN [2022-04-08 05:13:44,044 WARN L290 TraceCheckUtils]: 22: Hoare triple {1294#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1284#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is UNKNOWN [2022-04-08 05:13:44,045 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1177#true} {1294#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} #80#return; {1294#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} is VALID [2022-04-08 05:13:44,046 INFO L290 TraceCheckUtils]: 20: Hoare triple {1177#true} assume true; {1177#true} is VALID [2022-04-08 05:13:44,046 INFO L290 TraceCheckUtils]: 19: Hoare triple {1177#true} assume !(0 == ~cond); {1177#true} is VALID [2022-04-08 05:13:44,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {1177#true} ~cond := #in~cond; {1177#true} is VALID [2022-04-08 05:13:44,046 INFO L272 TraceCheckUtils]: 17: Hoare triple {1294#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1177#true} is VALID [2022-04-08 05:13:44,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {1294#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} assume !false; {1294#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} is VALID [2022-04-08 05:13:44,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {1316#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1294#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} is VALID [2022-04-08 05:13:44,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {1316#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !false; {1316#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-08 05:13:46,165 WARN L290 TraceCheckUtils]: 13: Hoare triple {1323#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1316#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is UNKNOWN [2022-04-08 05:13:46,168 INFO L290 TraceCheckUtils]: 12: Hoare triple {1323#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} assume !false; {1323#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-08 05:13:46,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {1177#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1323#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-08 05:13:46,169 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1177#true} {1177#true} #78#return; {1177#true} is VALID [2022-04-08 05:13:46,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {1177#true} assume true; {1177#true} is VALID [2022-04-08 05:13:46,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {1177#true} assume !(0 == ~cond); {1177#true} is VALID [2022-04-08 05:13:46,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {1177#true} ~cond := #in~cond; {1177#true} is VALID [2022-04-08 05:13:46,170 INFO L272 TraceCheckUtils]: 6: Hoare triple {1177#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {1177#true} is VALID [2022-04-08 05:13:46,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {1177#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {1177#true} is VALID [2022-04-08 05:13:46,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {1177#true} call #t~ret2 := main(); {1177#true} is VALID [2022-04-08 05:13:46,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1177#true} {1177#true} #84#return; {1177#true} is VALID [2022-04-08 05:13:46,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {1177#true} assume true; {1177#true} is VALID [2022-04-08 05:13:46,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {1177#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {1177#true} is VALID [2022-04-08 05:13:46,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {1177#true} call ULTIMATE.init(); {1177#true} is VALID [2022-04-08 05:13:46,170 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-04-08 05:13:46,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:13:46,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149795499] [2022-04-08 05:13:46,171 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:13:46,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294146192] [2022-04-08 05:13:46,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294146192] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:13:46,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:13:46,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2022-04-08 05:13:46,171 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:13:46,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2139160295] [2022-04-08 05:13:46,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2139160295] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:13:46,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:13:46,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 05:13:46,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737457816] [2022-04-08 05:13:46,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:13:46,172 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-08 05:13:46,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:13:46,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 05:13:46,230 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 05:13:46,231 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 05:13:46,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:13:46,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 05:13:46,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=141, Unknown=2, NotChecked=24, Total=210 [2022-04-08 05:13:46,232 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 05:13:49,019 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 05:13:51,170 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 05:13:52,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:13:52,376 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-04-08 05:13:52,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 05:13:52,376 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-08 05:13:52,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:13:52,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 05:13:52,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 62 transitions. [2022-04-08 05:13:52,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 05:13:52,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 62 transitions. [2022-04-08 05:13:52,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 62 transitions. [2022-04-08 05:13:52,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:13:52,598 INFO L225 Difference]: With dead ends: 64 [2022-04-08 05:13:52,598 INFO L226 Difference]: Without dead ends: 42 [2022-04-08 05:13:52,598 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=51, Invalid=191, Unknown=2, NotChecked=28, Total=272 [2022-04-08 05:13:52,599 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 19 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-08 05:13:52,599 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 129 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 140 Invalid, 2 Unknown, 0 Unchecked, 5.6s Time] [2022-04-08 05:13:52,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-08 05:13:52,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-08 05:13:52,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:13:52,624 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 05:13:52,625 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 05:13:52,625 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 05:13:52,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:13:52,628 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-04-08 05:13:52,628 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-04-08 05:13:52,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:13:52,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:13:52,628 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 42 states. [2022-04-08 05:13:52,628 INFO L87 Difference]: Start difference. First operand has 42 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 42 states. [2022-04-08 05:13:52,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:13:52,630 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-04-08 05:13:52,630 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-04-08 05:13:52,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:13:52,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:13:52,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:13:52,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:13:52,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 05:13:52,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2022-04-08 05:13:52,635 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 29 [2022-04-08 05:13:52,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:13:52,635 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2022-04-08 05:13:52,636 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 05:13:52,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 44 transitions. [2022-04-08 05:13:52,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:13:52,760 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-04-08 05:13:52,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 05:13:52,761 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:13:52,761 INFO L499 BasicCegarLoop]: trace histogram [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] [2022-04-08 05:13:52,780 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 05:13:52,962 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:13:52,962 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:13:52,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:13:52,962 INFO L85 PathProgramCache]: Analyzing trace with hash -758101483, now seen corresponding path program 3 times [2022-04-08 05:13:52,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:13:52,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [480452354] [2022-04-08 05:13:52,966 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 05:13:52,966 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-08 05:13:52,966 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 05:13:52,966 INFO L85 PathProgramCache]: Analyzing trace with hash -758101483, now seen corresponding path program 4 times [2022-04-08 05:13:52,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:13:52,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093761332] [2022-04-08 05:13:52,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:13:52,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:13:52,995 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:13:52,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1759566275] [2022-04-08 05:13:52,996 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 05:13:52,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:13:52,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:13:52,997 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 05:13:52,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process