/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/divbin_unwindbound20.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 05:12:31,337 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 05:12:31,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 05:12:31,371 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 05:12:31,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 05:12:31,373 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 05:12:31,374 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 05:12:31,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 05:12:31,377 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 05:12:31,378 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 05:12:31,379 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 05:12:31,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 05:12:31,380 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 05:12:31,381 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 05:12:31,382 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 05:12:31,382 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 05:12:31,383 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 05:12:31,384 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 05:12:31,385 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 05:12:31,386 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 05:12:31,388 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 05:12:31,393 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 05:12:31,394 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 05:12:31,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 05:12:31,396 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 05:12:31,398 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 05:12:31,399 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 05:12:31,399 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 05:12:31,400 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 05:12:31,400 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 05:12:31,401 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 05:12:31,401 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 05:12:31,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 05:12:31,402 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 05:12:31,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 05:12:31,403 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 05:12:31,404 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 05:12:31,404 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 05:12:31,404 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 05:12:31,405 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 05:12:31,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 05:12:31,413 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 05:12:31,414 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 05:12:31,426 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 05:12:31,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 05:12:31,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 05:12:31,428 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 05:12:31,428 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 05:12:31,428 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 05:12:31,428 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 05:12:31,428 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 05:12:31,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 05:12:31,429 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 05:12:31,429 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 05:12:31,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 05:12:31,430 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 05:12:31,430 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 05:12:31,430 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 05:12:31,430 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 05:12:31,430 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 05:12:31,430 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 05:12:31,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 05:12:31,431 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 05:12:31,431 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 05:12:31,431 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 05:12:31,431 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 05:12:31,431 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 05:12:31,431 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 05:12:31,431 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-28 05:12:31,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 05:12:31,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 05:12:31,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 05:12:31,709 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 05:12:31,710 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 05:12:31,712 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound20.i [2022-04-28 05:12:31,775 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab44a665f/748d479f4d0b494d9bd85fe740719054/FLAGdbc2c604b [2022-04-28 05:12:32,219 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 05:12:32,220 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound20.i [2022-04-28 05:12:32,242 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab44a665f/748d479f4d0b494d9bd85fe740719054/FLAGdbc2c604b [2022-04-28 05:12:32,604 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab44a665f/748d479f4d0b494d9bd85fe740719054 [2022-04-28 05:12:32,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 05:12:32,609 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 05:12:32,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 05:12:32,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 05:12:32,614 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 05:12:32,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 05:12:32" (1/1) ... [2022-04-28 05:12:32,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@645a799f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:12:32, skipping insertion in model container [2022-04-28 05:12:32,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 05:12:32" (1/1) ... [2022-04-28 05:12:32,623 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 05:12:32,638 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 05:12:32,805 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound20.i[950,963] [2022-04-28 05:12:32,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 05:12:32,844 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 05:12:32,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound20.i[950,963] [2022-04-28 05:12:32,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 05:12:32,901 INFO L208 MainTranslator]: Completed translation [2022-04-28 05:12:32,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:12:32 WrapperNode [2022-04-28 05:12:32,902 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 05:12:32,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 05:12:32,907 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 05:12:32,907 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 05:12:32,917 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:12:32" (1/1) ... [2022-04-28 05:12:32,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:12:32" (1/1) ... [2022-04-28 05:12:32,925 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:12:32" (1/1) ... [2022-04-28 05:12:32,926 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:12:32" (1/1) ... [2022-04-28 05:12:32,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:12:32" (1/1) ... [2022-04-28 05:12:32,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:12:32" (1/1) ... [2022-04-28 05:12:32,955 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:12:32" (1/1) ... [2022-04-28 05:12:32,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 05:12:32,962 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 05:12:32,962 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 05:12:32,962 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 05:12:32,963 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:12:32" (1/1) ... [2022-04-28 05:12:32,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 05:12:32,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:12:32,997 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-28 05:12:33,020 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-28 05:12:33,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 05:12:33,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 05:12:33,038 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 05:12:33,038 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 05:12:33,038 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 05:12:33,038 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 05:12:33,038 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 05:12:33,039 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 05:12:33,039 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 05:12:33,039 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 05:12:33,039 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 05:12:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 05:12:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 05:12:33,041 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 05:12:33,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 05:12:33,041 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 05:12:33,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 05:12:33,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 05:12:33,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 05:12:33,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 05:12:33,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 05:12:33,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 05:12:33,148 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 05:12:33,150 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 05:12:33,379 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 05:12:33,388 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 05:12:33,388 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 05:12:33,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 05:12:33 BoogieIcfgContainer [2022-04-28 05:12:33,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 05:12:33,392 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 05:12:33,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 05:12:33,398 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 05:12:33,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 05:12:32" (1/3) ... [2022-04-28 05:12:33,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e888ffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 05:12:33, skipping insertion in model container [2022-04-28 05:12:33,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:12:32" (2/3) ... [2022-04-28 05:12:33,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e888ffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 05:12:33, skipping insertion in model container [2022-04-28 05:12:33,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 05:12:33" (3/3) ... [2022-04-28 05:12:33,401 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound20.i [2022-04-28 05:12:33,415 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 05:12:33,415 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 05:12:33,479 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 05:12:33,489 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@44f78650, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3a62eba7 [2022-04-28 05:12:33,489 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 05:12:33,508 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 05:12:33,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 05:12:33,517 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:12:33,518 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:12:33,519 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:12:33,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:12:33,524 INFO L85 PathProgramCache]: Analyzing trace with hash 878397729, now seen corresponding path program 1 times [2022-04-28 05:12:33,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:12:33,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [98908131] [2022-04-28 05:12:33,546 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:12:33,546 INFO L85 PathProgramCache]: Analyzing trace with hash 878397729, now seen corresponding path program 2 times [2022-04-28 05:12:33,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:12:33,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321314532] [2022-04-28 05:12:33,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:12:33,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:12:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:12:33,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 05:12:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:12:33,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {36#true} is VALID [2022-04-28 05:12:33,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-28 05:12:33,781 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-28 05:12:33,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 05:12:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:12:33,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-28 05:12:33,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-28 05:12:33,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-28 05:12:33,808 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-28 05:12:33,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 05:12:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:12:33,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-28 05:12:33,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-28 05:12:33,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-28 05:12:33,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-28 05:12:33,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 05:12:33,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {36#true} is VALID [2022-04-28 05:12:33,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-28 05:12:33,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-28 05:12:33,822 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret5 := main(); {36#true} is VALID [2022-04-28 05:12:33,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {36#true} is VALID [2022-04-28 05:12:33,823 INFO L272 TraceCheckUtils]: 6: Hoare triple {36#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {36#true} is VALID [2022-04-28 05:12:33,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-28 05:12:33,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-28 05:12:33,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-28 05:12:33,824 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-28 05:12:33,826 INFO L272 TraceCheckUtils]: 11: Hoare triple {37#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {36#true} is VALID [2022-04-28 05:12:33,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-28 05:12:33,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-28 05:12:33,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-28 05:12:33,828 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-28 05:12:33,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {37#false} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {37#false} is VALID [2022-04-28 05:12:33,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-28 05:12:33,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-28 05:12:33,830 INFO L272 TraceCheckUtils]: 19: Hoare triple {37#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {37#false} is VALID [2022-04-28 05:12:33,830 INFO L290 TraceCheckUtils]: 20: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2022-04-28 05:12:33,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2022-04-28 05:12:33,830 INFO L290 TraceCheckUtils]: 22: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-04-28 05:12:33,831 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:12:33,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:12:33,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321314532] [2022-04-28 05:12:33,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321314532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:12:33,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:12:33,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 05:12:33,837 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:12:33,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [98908131] [2022-04-28 05:12:33,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [98908131] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:12:33,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:12:33,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 05:12:33,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773813437] [2022-04-28 05:12:33,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:12:33,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 05:12:33,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:12:33,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:12:33,892 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-28 05:12:33,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 05:12:33,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:12:33,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 05:12:33,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 05:12:33,915 INFO L87 Difference]: Start difference. First operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:12:34,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:12:34,119 INFO L93 Difference]: Finished difference Result 60 states and 84 transitions. [2022-04-28 05:12:34,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 05:12:34,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 05:12:34,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:12:34,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:12:34,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-28 05:12:34,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:12:34,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-28 05:12:34,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 84 transitions. [2022-04-28 05:12:34,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:12:34,284 INFO L225 Difference]: With dead ends: 60 [2022-04-28 05:12:34,285 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 05:12:34,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 05:12:34,291 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:12:34,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 40 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:12:34,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 05:12:34,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-04-28 05:12:34,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:12:34,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 05:12:34,321 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 05:12:34,321 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 05:12:34,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:12:34,325 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-28 05:12:34,325 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-28 05:12:34,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:12:34,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:12:34,327 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-28 05:12:34,327 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-28 05:12:34,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:12:34,331 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-28 05:12:34,331 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-28 05:12:34,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:12:34,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:12:34,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:12:34,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:12:34,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 05:12:34,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-04-28 05:12:34,336 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 23 [2022-04-28 05:12:34,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:12:34,336 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-04-28 05:12:34,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:12:34,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 34 transitions. [2022-04-28 05:12:34,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:12:34,412 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-28 05:12:34,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 05:12:34,413 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:12:34,413 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:12:34,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 05:12:34,414 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:12:34,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:12:34,414 INFO L85 PathProgramCache]: Analyzing trace with hash 994169231, now seen corresponding path program 1 times [2022-04-28 05:12:34,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:12:34,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1854662459] [2022-04-28 05:12:34,415 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:12:34,415 INFO L85 PathProgramCache]: Analyzing trace with hash 994169231, now seen corresponding path program 2 times [2022-04-28 05:12:34,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:12:34,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638925629] [2022-04-28 05:12:34,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:12:34,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:12:34,441 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:12:34,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [724710024] [2022-04-28 05:12:34,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:12:34,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:12:34,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:12:34,471 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-28 05:12:34,503 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-28 05:12:34,550 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 05:12:34,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:12:34,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 05:12:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:12:34,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:12:34,834 INFO L272 TraceCheckUtils]: 0: Hoare triple {286#true} call ULTIMATE.init(); {286#true} is VALID [2022-04-28 05:12:34,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {286#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {294#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:34,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:34,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {294#(<= ~counter~0 0)} {286#true} #89#return; {294#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:34,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {294#(<= ~counter~0 0)} call #t~ret5 := main(); {294#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:34,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {294#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {294#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:34,840 INFO L272 TraceCheckUtils]: 6: Hoare triple {294#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {294#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:34,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#(<= ~counter~0 0)} ~cond := #in~cond; {294#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:34,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {294#(<= ~counter~0 0)} assume !(0 == ~cond); {294#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:34,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:34,843 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {294#(<= ~counter~0 0)} {294#(<= ~counter~0 0)} #81#return; {294#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:34,844 INFO L272 TraceCheckUtils]: 11: Hoare triple {294#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {294#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:34,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {294#(<= ~counter~0 0)} ~cond := #in~cond; {294#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:34,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {294#(<= ~counter~0 0)} assume !(0 == ~cond); {294#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:34,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:34,852 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {294#(<= ~counter~0 0)} {294#(<= ~counter~0 0)} #83#return; {294#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:34,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {294#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {294#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:34,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {294#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {343#(<= |main_#t~post3| 0)} is VALID [2022-04-28 05:12:34,853 INFO L290 TraceCheckUtils]: 18: Hoare triple {343#(<= |main_#t~post3| 0)} assume !(#t~post3 < 20);havoc #t~post3; {287#false} is VALID [2022-04-28 05:12:34,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {287#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {287#false} is VALID [2022-04-28 05:12:34,854 INFO L290 TraceCheckUtils]: 20: Hoare triple {287#false} assume !(#t~post4 < 20);havoc #t~post4; {287#false} is VALID [2022-04-28 05:12:34,854 INFO L272 TraceCheckUtils]: 21: Hoare triple {287#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {287#false} is VALID [2022-04-28 05:12:34,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {287#false} ~cond := #in~cond; {287#false} is VALID [2022-04-28 05:12:34,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {287#false} assume 0 == ~cond; {287#false} is VALID [2022-04-28 05:12:34,857 INFO L290 TraceCheckUtils]: 24: Hoare triple {287#false} assume !false; {287#false} is VALID [2022-04-28 05:12:34,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:12:34,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:12:34,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:12:34,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638925629] [2022-04-28 05:12:34,858 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:12:34,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724710024] [2022-04-28 05:12:34,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724710024] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:12:34,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:12:34,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:12:34,861 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:12:34,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1854662459] [2022-04-28 05:12:34,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1854662459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:12:34,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:12:34,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 05:12:34,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974293780] [2022-04-28 05:12:34,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:12:34,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-28 05:12:34,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:12:34,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:12:34,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:12:34,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 05:12:34,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:12:34,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 05:12:34,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:12:34,891 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:12:34,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:12:34,994 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-04-28 05:12:34,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 05:12:34,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-28 05:12:34,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:12:34,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:12:34,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-28 05:12:34,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:12:35,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-28 05:12:35,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2022-04-28 05:12:35,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:12:35,045 INFO L225 Difference]: With dead ends: 42 [2022-04-28 05:12:35,046 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 05:12:35,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 05:12:35,048 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:12:35,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:12:35,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 05:12:35,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-28 05:12:35,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:12:35,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 05:12:35,062 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 05:12:35,062 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 05:12:35,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:12:35,065 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-28 05:12:35,065 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-28 05:12:35,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:12:35,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:12:35,066 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-04-28 05:12:35,066 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-04-28 05:12:35,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:12:35,069 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-28 05:12:35,069 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-28 05:12:35,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:12:35,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:12:35,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:12:35,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:12:35,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 05:12:35,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-04-28 05:12:35,072 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 25 [2022-04-28 05:12:35,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:12:35,073 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-04-28 05:12:35,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:12:35,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 36 transitions. [2022-04-28 05:12:35,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:12:35,108 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-28 05:12:35,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 05:12:35,109 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:12:35,109 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:12:35,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 05:12:35,323 WARN L477 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-28 05:12:35,324 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:12:35,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:12:35,324 INFO L85 PathProgramCache]: Analyzing trace with hash 422434646, now seen corresponding path program 1 times [2022-04-28 05:12:35,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:12:35,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1865000038] [2022-04-28 05:12:35,325 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:12:35,325 INFO L85 PathProgramCache]: Analyzing trace with hash 422434646, now seen corresponding path program 2 times [2022-04-28 05:12:35,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:12:35,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069396086] [2022-04-28 05:12:35,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:12:35,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:12:35,352 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:12:35,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1619484683] [2022-04-28 05:12:35,353 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:12:35,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:12:35,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:12:35,357 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-28 05:12:35,384 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-28 05:12:35,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 05:12:35,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:12:35,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 05:12:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:12:35,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:12:35,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {568#true} is VALID [2022-04-28 05:12:35,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {568#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {576#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:35,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:35,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {576#(<= ~counter~0 0)} {568#true} #89#return; {576#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:35,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {576#(<= ~counter~0 0)} call #t~ret5 := main(); {576#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:35,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {576#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {576#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:35,640 INFO L272 TraceCheckUtils]: 6: Hoare triple {576#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {576#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:35,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {576#(<= ~counter~0 0)} ~cond := #in~cond; {576#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:35,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {576#(<= ~counter~0 0)} assume !(0 == ~cond); {576#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:35,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:35,642 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {576#(<= ~counter~0 0)} {576#(<= ~counter~0 0)} #81#return; {576#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:35,643 INFO L272 TraceCheckUtils]: 11: Hoare triple {576#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {576#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:35,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {576#(<= ~counter~0 0)} ~cond := #in~cond; {576#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:35,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {576#(<= ~counter~0 0)} assume !(0 == ~cond); {576#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:35,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:35,644 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {576#(<= ~counter~0 0)} {576#(<= ~counter~0 0)} #83#return; {576#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:35,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {576#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {576#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:35,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {576#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {625#(<= ~counter~0 1)} is VALID [2022-04-28 05:12:35,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {625#(<= ~counter~0 1)} assume !!(#t~post3 < 20);havoc #t~post3; {625#(<= ~counter~0 1)} is VALID [2022-04-28 05:12:35,646 INFO L290 TraceCheckUtils]: 19: Hoare triple {625#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {625#(<= ~counter~0 1)} is VALID [2022-04-28 05:12:35,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {625#(<= ~counter~0 1)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {635#(<= |main_#t~post4| 1)} is VALID [2022-04-28 05:12:35,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {635#(<= |main_#t~post4| 1)} assume !(#t~post4 < 20);havoc #t~post4; {569#false} is VALID [2022-04-28 05:12:35,653 INFO L272 TraceCheckUtils]: 22: Hoare triple {569#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {569#false} is VALID [2022-04-28 05:12:35,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {569#false} ~cond := #in~cond; {569#false} is VALID [2022-04-28 05:12:35,653 INFO L290 TraceCheckUtils]: 24: Hoare triple {569#false} assume 0 == ~cond; {569#false} is VALID [2022-04-28 05:12:35,654 INFO L290 TraceCheckUtils]: 25: Hoare triple {569#false} assume !false; {569#false} is VALID [2022-04-28 05:12:35,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:12:35,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:12:35,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:12:35,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069396086] [2022-04-28 05:12:35,654 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:12:35,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619484683] [2022-04-28 05:12:35,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619484683] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:12:35,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:12:35,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:12:35,656 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:12:35,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1865000038] [2022-04-28 05:12:35,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1865000038] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:12:35,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:12:35,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:12:35,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617950228] [2022-04-28 05:12:35,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:12:35,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-28 05:12:35,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:12:35,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:12:35,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:12:35,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:12:35,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:12:35,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:12:35,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:12:35,686 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:12:35,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:12:35,803 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-28 05:12:35,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:12:35,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-28 05:12:35,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:12:35,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:12:35,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-28 05:12:35,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:12:35,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-28 05:12:35,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-04-28 05:12:35,855 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-28 05:12:35,858 INFO L225 Difference]: With dead ends: 41 [2022-04-28 05:12:35,858 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 05:12:35,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:12:35,860 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:12:35,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 82 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:12:35,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 05:12:35,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-28 05:12:35,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:12:35,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 05:12:35,874 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 05:12:35,875 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 05:12:35,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:12:35,877 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-28 05:12:35,877 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-28 05:12:35,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:12:35,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:12:35,878 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-28 05:12:35,878 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-28 05:12:35,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:12:35,881 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-28 05:12:35,881 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-28 05:12:35,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:12:35,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:12:35,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:12:35,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:12:35,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 05:12:35,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-04-28 05:12:35,884 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 26 [2022-04-28 05:12:35,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:12:35,884 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-04-28 05:12:35,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 05:12:35,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 40 transitions. [2022-04-28 05:12:35,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:12:35,923 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-04-28 05:12:35,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 05:12:35,924 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:12:35,924 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:12:35,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 05:12:36,147 WARN L477 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-28 05:12:36,148 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:12:36,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:12:36,148 INFO L85 PathProgramCache]: Analyzing trace with hash 424222106, now seen corresponding path program 1 times [2022-04-28 05:12:36,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:12:36,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1253196703] [2022-04-28 05:12:36,149 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:12:36,149 INFO L85 PathProgramCache]: Analyzing trace with hash 424222106, now seen corresponding path program 2 times [2022-04-28 05:12:36,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:12:36,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172410517] [2022-04-28 05:12:36,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:12:36,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:12:36,179 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:12:36,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [611202143] [2022-04-28 05:12:36,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:12:36,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:12:36,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:12:36,188 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-28 05:12:36,192 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-28 05:12:36,352 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 05:12:36,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:12:36,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 05:12:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:12:36,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:12:37,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {866#true} call ULTIMATE.init(); {866#true} is VALID [2022-04-28 05:12:37,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {866#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {866#true} is VALID [2022-04-28 05:12:37,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-28 05:12:37,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {866#true} {866#true} #89#return; {866#true} is VALID [2022-04-28 05:12:37,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {866#true} call #t~ret5 := main(); {866#true} is VALID [2022-04-28 05:12:37,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {866#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {866#true} is VALID [2022-04-28 05:12:37,272 INFO L272 TraceCheckUtils]: 6: Hoare triple {866#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {866#true} is VALID [2022-04-28 05:12:37,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {866#true} ~cond := #in~cond; {866#true} is VALID [2022-04-28 05:12:37,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {866#true} assume !(0 == ~cond); {866#true} is VALID [2022-04-28 05:12:37,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-28 05:12:37,273 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {866#true} {866#true} #81#return; {866#true} is VALID [2022-04-28 05:12:37,273 INFO L272 TraceCheckUtils]: 11: Hoare triple {866#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {866#true} is VALID [2022-04-28 05:12:37,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {866#true} ~cond := #in~cond; {866#true} is VALID [2022-04-28 05:12:37,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {866#true} assume !(0 == ~cond); {866#true} is VALID [2022-04-28 05:12:37,274 INFO L290 TraceCheckUtils]: 14: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-28 05:12:37,274 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {866#true} {866#true} #83#return; {866#true} is VALID [2022-04-28 05:12:37,275 INFO L290 TraceCheckUtils]: 16: Hoare triple {866#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 05:12:37,275 INFO L290 TraceCheckUtils]: 17: Hoare triple {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 05:12:37,276 INFO L290 TraceCheckUtils]: 18: Hoare triple {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post3 < 20);havoc #t~post3; {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 05:12:37,276 INFO L290 TraceCheckUtils]: 19: Hoare triple {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 05:12:37,277 INFO L290 TraceCheckUtils]: 20: Hoare triple {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 05:12:37,278 INFO L290 TraceCheckUtils]: 21: Hoare triple {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post4 < 20);havoc #t~post4; {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 05:12:37,278 INFO L272 TraceCheckUtils]: 22: Hoare triple {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {939#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:12:37,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {939#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {943#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:12:37,279 INFO L290 TraceCheckUtils]: 24: Hoare triple {943#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {867#false} is VALID [2022-04-28 05:12:37,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {867#false} assume !false; {867#false} is VALID [2022-04-28 05:12:37,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:12:37,280 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:12:37,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:12:37,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172410517] [2022-04-28 05:12:37,280 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:12:37,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611202143] [2022-04-28 05:12:37,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611202143] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:12:37,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:12:37,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:12:37,281 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:12:37,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1253196703] [2022-04-28 05:12:37,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1253196703] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:12:37,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:12:37,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:12:37,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589488554] [2022-04-28 05:12:37,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:12:37,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-28 05:12:37,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:12:37,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:12:37,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:12:37,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 05:12:37,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:12:37,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 05:12:37,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 05:12:37,304 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:12:39,511 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-28 05:12:39,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:12:39,658 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-04-28 05:12:39,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 05:12:39,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-28 05:12:39,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:12:39,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:12:39,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-28 05:12:39,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:12:39,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-28 05:12:39,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2022-04-28 05:12:39,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:12:39,730 INFO L225 Difference]: With dead ends: 50 [2022-04-28 05:12:39,731 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 05:12:39,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-28 05:12:39,732 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:12:39,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 104 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 05:12:39,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 05:12:39,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2022-04-28 05:12:39,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:12:39,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 05:12:39,757 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 05:12:39,757 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 05:12:39,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:12:39,760 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-04-28 05:12:39,760 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-04-28 05:12:39,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:12:39,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:12:39,761 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 46 states. [2022-04-28 05:12:39,761 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 46 states. [2022-04-28 05:12:39,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:12:39,763 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-04-28 05:12:39,763 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-04-28 05:12:39,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:12:39,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:12:39,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:12:39,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:12:39,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 05:12:39,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-28 05:12:39,766 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 26 [2022-04-28 05:12:39,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:12:39,766 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-28 05:12:39,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 05:12:39,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 46 transitions. [2022-04-28 05:12:39,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:12:39,841 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-28 05:12:39,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 05:12:39,842 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:12:39,842 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:12:39,871 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-28 05:12:40,067 WARN L477 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-28 05:12:40,068 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:12:40,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:12:40,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1733722638, now seen corresponding path program 1 times [2022-04-28 05:12:40,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:12:40,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [282528956] [2022-04-28 05:12:40,069 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:12:40,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1733722638, now seen corresponding path program 2 times [2022-04-28 05:12:40,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:12:40,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787181849] [2022-04-28 05:12:40,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:12:40,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:12:40,100 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:12:40,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [163832201] [2022-04-28 05:12:40,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:12:40,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:12:40,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:12:40,103 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-28 05:12:40,115 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-28 05:12:40,149 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:12:40,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:12:40,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 05:12:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:12:40,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:12:40,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {1221#true} call ULTIMATE.init(); {1221#true} is VALID [2022-04-28 05:12:40,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {1221#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {1229#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:40,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {1229#(<= ~counter~0 0)} assume true; {1229#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:40,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1229#(<= ~counter~0 0)} {1221#true} #89#return; {1229#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:40,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {1229#(<= ~counter~0 0)} call #t~ret5 := main(); {1229#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:40,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {1229#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1229#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:40,422 INFO L272 TraceCheckUtils]: 6: Hoare triple {1229#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1229#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:40,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {1229#(<= ~counter~0 0)} ~cond := #in~cond; {1229#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:40,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {1229#(<= ~counter~0 0)} assume !(0 == ~cond); {1229#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:40,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {1229#(<= ~counter~0 0)} assume true; {1229#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:40,427 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1229#(<= ~counter~0 0)} {1229#(<= ~counter~0 0)} #81#return; {1229#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:40,440 INFO L272 TraceCheckUtils]: 11: Hoare triple {1229#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1229#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:40,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {1229#(<= ~counter~0 0)} ~cond := #in~cond; {1229#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:40,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {1229#(<= ~counter~0 0)} assume !(0 == ~cond); {1229#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:40,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {1229#(<= ~counter~0 0)} assume true; {1229#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:40,443 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1229#(<= ~counter~0 0)} {1229#(<= ~counter~0 0)} #83#return; {1229#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:40,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {1229#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1229#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:40,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {1229#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1278#(<= ~counter~0 1)} is VALID [2022-04-28 05:12:40,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {1278#(<= ~counter~0 1)} assume !!(#t~post3 < 20);havoc #t~post3; {1278#(<= ~counter~0 1)} is VALID [2022-04-28 05:12:40,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {1278#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1278#(<= ~counter~0 1)} is VALID [2022-04-28 05:12:40,446 INFO L290 TraceCheckUtils]: 20: Hoare triple {1278#(<= ~counter~0 1)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1288#(<= ~counter~0 2)} is VALID [2022-04-28 05:12:40,447 INFO L290 TraceCheckUtils]: 21: Hoare triple {1288#(<= ~counter~0 2)} assume !!(#t~post4 < 20);havoc #t~post4; {1288#(<= ~counter~0 2)} is VALID [2022-04-28 05:12:40,447 INFO L272 TraceCheckUtils]: 22: Hoare triple {1288#(<= ~counter~0 2)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1288#(<= ~counter~0 2)} is VALID [2022-04-28 05:12:40,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {1288#(<= ~counter~0 2)} ~cond := #in~cond; {1288#(<= ~counter~0 2)} is VALID [2022-04-28 05:12:40,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {1288#(<= ~counter~0 2)} assume !(0 == ~cond); {1288#(<= ~counter~0 2)} is VALID [2022-04-28 05:12:40,449 INFO L290 TraceCheckUtils]: 25: Hoare triple {1288#(<= ~counter~0 2)} assume true; {1288#(<= ~counter~0 2)} is VALID [2022-04-28 05:12:40,449 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1288#(<= ~counter~0 2)} {1288#(<= ~counter~0 2)} #85#return; {1288#(<= ~counter~0 2)} is VALID [2022-04-28 05:12:40,450 INFO L290 TraceCheckUtils]: 27: Hoare triple {1288#(<= ~counter~0 2)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1288#(<= ~counter~0 2)} is VALID [2022-04-28 05:12:40,450 INFO L290 TraceCheckUtils]: 28: Hoare triple {1288#(<= ~counter~0 2)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1288#(<= ~counter~0 2)} is VALID [2022-04-28 05:12:40,451 INFO L290 TraceCheckUtils]: 29: Hoare triple {1288#(<= ~counter~0 2)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1316#(<= |main_#t~post4| 2)} is VALID [2022-04-28 05:12:40,451 INFO L290 TraceCheckUtils]: 30: Hoare triple {1316#(<= |main_#t~post4| 2)} assume !(#t~post4 < 20);havoc #t~post4; {1222#false} is VALID [2022-04-28 05:12:40,452 INFO L272 TraceCheckUtils]: 31: Hoare triple {1222#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1222#false} is VALID [2022-04-28 05:12:40,452 INFO L290 TraceCheckUtils]: 32: Hoare triple {1222#false} ~cond := #in~cond; {1222#false} is VALID [2022-04-28 05:12:40,453 INFO L290 TraceCheckUtils]: 33: Hoare triple {1222#false} assume 0 == ~cond; {1222#false} is VALID [2022-04-28 05:12:40,453 INFO L290 TraceCheckUtils]: 34: Hoare triple {1222#false} assume !false; {1222#false} is VALID [2022-04-28 05:12:40,453 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:12:40,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:12:40,738 INFO L290 TraceCheckUtils]: 34: Hoare triple {1222#false} assume !false; {1222#false} is VALID [2022-04-28 05:12:40,738 INFO L290 TraceCheckUtils]: 33: Hoare triple {1222#false} assume 0 == ~cond; {1222#false} is VALID [2022-04-28 05:12:40,738 INFO L290 TraceCheckUtils]: 32: Hoare triple {1222#false} ~cond := #in~cond; {1222#false} is VALID [2022-04-28 05:12:40,739 INFO L272 TraceCheckUtils]: 31: Hoare triple {1222#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1222#false} is VALID [2022-04-28 05:12:40,739 INFO L290 TraceCheckUtils]: 30: Hoare triple {1344#(< |main_#t~post4| 20)} assume !(#t~post4 < 20);havoc #t~post4; {1222#false} is VALID [2022-04-28 05:12:40,740 INFO L290 TraceCheckUtils]: 29: Hoare triple {1348#(< ~counter~0 20)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1344#(< |main_#t~post4| 20)} is VALID [2022-04-28 05:12:40,740 INFO L290 TraceCheckUtils]: 28: Hoare triple {1348#(< ~counter~0 20)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1348#(< ~counter~0 20)} is VALID [2022-04-28 05:12:40,740 INFO L290 TraceCheckUtils]: 27: Hoare triple {1348#(< ~counter~0 20)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1348#(< ~counter~0 20)} is VALID [2022-04-28 05:12:40,741 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1221#true} {1348#(< ~counter~0 20)} #85#return; {1348#(< ~counter~0 20)} is VALID [2022-04-28 05:12:40,741 INFO L290 TraceCheckUtils]: 25: Hoare triple {1221#true} assume true; {1221#true} is VALID [2022-04-28 05:12:40,741 INFO L290 TraceCheckUtils]: 24: Hoare triple {1221#true} assume !(0 == ~cond); {1221#true} is VALID [2022-04-28 05:12:40,742 INFO L290 TraceCheckUtils]: 23: Hoare triple {1221#true} ~cond := #in~cond; {1221#true} is VALID [2022-04-28 05:12:40,742 INFO L272 TraceCheckUtils]: 22: Hoare triple {1348#(< ~counter~0 20)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1221#true} is VALID [2022-04-28 05:12:40,742 INFO L290 TraceCheckUtils]: 21: Hoare triple {1348#(< ~counter~0 20)} assume !!(#t~post4 < 20);havoc #t~post4; {1348#(< ~counter~0 20)} is VALID [2022-04-28 05:12:40,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {1376#(< ~counter~0 19)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1348#(< ~counter~0 20)} is VALID [2022-04-28 05:12:40,743 INFO L290 TraceCheckUtils]: 19: Hoare triple {1376#(< ~counter~0 19)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1376#(< ~counter~0 19)} is VALID [2022-04-28 05:12:40,744 INFO L290 TraceCheckUtils]: 18: Hoare triple {1376#(< ~counter~0 19)} assume !!(#t~post3 < 20);havoc #t~post3; {1376#(< ~counter~0 19)} is VALID [2022-04-28 05:12:40,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {1386#(< ~counter~0 18)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1376#(< ~counter~0 19)} is VALID [2022-04-28 05:12:40,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {1386#(< ~counter~0 18)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1386#(< ~counter~0 18)} is VALID [2022-04-28 05:12:40,746 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1221#true} {1386#(< ~counter~0 18)} #83#return; {1386#(< ~counter~0 18)} is VALID [2022-04-28 05:12:40,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {1221#true} assume true; {1221#true} is VALID [2022-04-28 05:12:40,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {1221#true} assume !(0 == ~cond); {1221#true} is VALID [2022-04-28 05:12:40,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {1221#true} ~cond := #in~cond; {1221#true} is VALID [2022-04-28 05:12:40,746 INFO L272 TraceCheckUtils]: 11: Hoare triple {1386#(< ~counter~0 18)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1221#true} is VALID [2022-04-28 05:12:40,747 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1221#true} {1386#(< ~counter~0 18)} #81#return; {1386#(< ~counter~0 18)} is VALID [2022-04-28 05:12:40,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {1221#true} assume true; {1221#true} is VALID [2022-04-28 05:12:40,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {1221#true} assume !(0 == ~cond); {1221#true} is VALID [2022-04-28 05:12:40,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {1221#true} ~cond := #in~cond; {1221#true} is VALID [2022-04-28 05:12:40,747 INFO L272 TraceCheckUtils]: 6: Hoare triple {1386#(< ~counter~0 18)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1221#true} is VALID [2022-04-28 05:12:40,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {1386#(< ~counter~0 18)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1386#(< ~counter~0 18)} is VALID [2022-04-28 05:12:40,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {1386#(< ~counter~0 18)} call #t~ret5 := main(); {1386#(< ~counter~0 18)} is VALID [2022-04-28 05:12:40,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1386#(< ~counter~0 18)} {1221#true} #89#return; {1386#(< ~counter~0 18)} is VALID [2022-04-28 05:12:40,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {1386#(< ~counter~0 18)} assume true; {1386#(< ~counter~0 18)} is VALID [2022-04-28 05:12:40,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {1221#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {1386#(< ~counter~0 18)} is VALID [2022-04-28 05:12:40,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {1221#true} call ULTIMATE.init(); {1221#true} is VALID [2022-04-28 05:12:40,750 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:12:40,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:12:40,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787181849] [2022-04-28 05:12:40,751 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:12:40,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163832201] [2022-04-28 05:12:40,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163832201] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:12:40,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:12:40,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 05:12:40,751 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:12:40,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [282528956] [2022-04-28 05:12:40,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [282528956] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:12:40,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:12:40,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:12:40,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467079589] [2022-04-28 05:12:40,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:12:40,752 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-28 05:12:40,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:12:40,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 05:12:40,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:12:40,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 05:12:40,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:12:40,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 05:12:40,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 05:12:40,782 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 05:12:41,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:12:41,037 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-04-28 05:12:41,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 05:12:41,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-28 05:12:41,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:12:41,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 05:12:41,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-28 05:12:41,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 05:12:41,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-04-28 05:12:41,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2022-04-28 05:12:41,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:12:41,111 INFO L225 Difference]: With dead ends: 64 [2022-04-28 05:12:41,112 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 05:12:41,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-28 05:12:41,113 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 14 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:12:41,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 115 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:12:41,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 05:12:41,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2022-04-28 05:12:41,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:12:41,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 51 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 38 states have internal predecessors, (46), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 05:12:41,156 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 51 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 38 states have internal predecessors, (46), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 05:12:41,156 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 51 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 38 states have internal predecessors, (46), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 05:12:41,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:12:41,159 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2022-04-28 05:12:41,159 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2022-04-28 05:12:41,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:12:41,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:12:41,160 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 38 states have internal predecessors, (46), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 57 states. [2022-04-28 05:12:41,160 INFO L87 Difference]: Start difference. First operand has 51 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 38 states have internal predecessors, (46), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 57 states. [2022-04-28 05:12:41,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:12:41,162 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2022-04-28 05:12:41,162 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2022-04-28 05:12:41,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:12:41,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:12:41,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:12:41,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:12:41,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 38 states have internal predecessors, (46), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 05:12:41,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2022-04-28 05:12:41,166 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 35 [2022-04-28 05:12:41,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:12:41,166 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2022-04-28 05:12:41,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 05:12:41,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 60 transitions. [2022-04-28 05:12:41,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:12:41,242 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-04-28 05:12:41,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 05:12:41,243 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:12:41,243 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:12:41,274 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-28 05:12:41,443 WARN L477 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-28 05:12:41,444 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:12:41,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:12:41,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1731935178, now seen corresponding path program 1 times [2022-04-28 05:12:41,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:12:41,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [975923399] [2022-04-28 05:12:41,445 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:12:41,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1731935178, now seen corresponding path program 2 times [2022-04-28 05:12:41,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:12:41,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196531159] [2022-04-28 05:12:41,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:12:41,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:12:41,474 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:12:41,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [849092607] [2022-04-28 05:12:41,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:12:41,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:12:41,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:12:41,476 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-28 05:12:41,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 05:12:41,526 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:12:41,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:12:41,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-28 05:12:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:12:41,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:12:41,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {1786#true} call ULTIMATE.init(); {1786#true} is VALID [2022-04-28 05:12:41,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {1786#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {1786#true} is VALID [2022-04-28 05:12:41,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {1786#true} assume true; {1786#true} is VALID [2022-04-28 05:12:41,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1786#true} {1786#true} #89#return; {1786#true} is VALID [2022-04-28 05:12:41,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {1786#true} call #t~ret5 := main(); {1786#true} is VALID [2022-04-28 05:12:41,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {1786#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1786#true} is VALID [2022-04-28 05:12:41,630 INFO L272 TraceCheckUtils]: 6: Hoare triple {1786#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1786#true} is VALID [2022-04-28 05:12:41,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {1786#true} ~cond := #in~cond; {1786#true} is VALID [2022-04-28 05:12:41,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {1786#true} assume !(0 == ~cond); {1786#true} is VALID [2022-04-28 05:12:41,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {1786#true} assume true; {1786#true} is VALID [2022-04-28 05:12:41,630 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1786#true} {1786#true} #81#return; {1786#true} is VALID [2022-04-28 05:12:41,630 INFO L272 TraceCheckUtils]: 11: Hoare triple {1786#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1786#true} is VALID [2022-04-28 05:12:41,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {1786#true} ~cond := #in~cond; {1786#true} is VALID [2022-04-28 05:12:41,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {1786#true} assume !(0 == ~cond); {1786#true} is VALID [2022-04-28 05:12:41,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {1786#true} assume true; {1786#true} is VALID [2022-04-28 05:12:41,631 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1786#true} {1786#true} #83#return; {1786#true} is VALID [2022-04-28 05:12:41,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {1786#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1839#(= main_~B~0 main_~b~0)} is VALID [2022-04-28 05:12:41,634 INFO L290 TraceCheckUtils]: 17: Hoare triple {1839#(= main_~B~0 main_~b~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1839#(= main_~B~0 main_~b~0)} is VALID [2022-04-28 05:12:41,638 INFO L290 TraceCheckUtils]: 18: Hoare triple {1839#(= main_~B~0 main_~b~0)} assume !!(#t~post3 < 20);havoc #t~post3; {1839#(= main_~B~0 main_~b~0)} is VALID [2022-04-28 05:12:41,639 INFO L290 TraceCheckUtils]: 19: Hoare triple {1839#(= main_~B~0 main_~b~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1839#(= main_~B~0 main_~b~0)} is VALID [2022-04-28 05:12:41,640 INFO L290 TraceCheckUtils]: 20: Hoare triple {1839#(= main_~B~0 main_~b~0)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1839#(= main_~B~0 main_~b~0)} is VALID [2022-04-28 05:12:41,640 INFO L290 TraceCheckUtils]: 21: Hoare triple {1839#(= main_~B~0 main_~b~0)} assume !!(#t~post4 < 20);havoc #t~post4; {1839#(= main_~B~0 main_~b~0)} is VALID [2022-04-28 05:12:41,640 INFO L272 TraceCheckUtils]: 22: Hoare triple {1839#(= main_~B~0 main_~b~0)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1786#true} is VALID [2022-04-28 05:12:41,641 INFO L290 TraceCheckUtils]: 23: Hoare triple {1786#true} ~cond := #in~cond; {1786#true} is VALID [2022-04-28 05:12:41,641 INFO L290 TraceCheckUtils]: 24: Hoare triple {1786#true} assume !(0 == ~cond); {1786#true} is VALID [2022-04-28 05:12:41,641 INFO L290 TraceCheckUtils]: 25: Hoare triple {1786#true} assume true; {1786#true} is VALID [2022-04-28 05:12:41,642 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1786#true} {1839#(= main_~B~0 main_~b~0)} #85#return; {1839#(= main_~B~0 main_~b~0)} is VALID [2022-04-28 05:12:41,642 INFO L290 TraceCheckUtils]: 27: Hoare triple {1839#(= main_~B~0 main_~b~0)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1787#false} is VALID [2022-04-28 05:12:41,643 INFO L290 TraceCheckUtils]: 28: Hoare triple {1787#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1787#false} is VALID [2022-04-28 05:12:41,643 INFO L290 TraceCheckUtils]: 29: Hoare triple {1787#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1787#false} is VALID [2022-04-28 05:12:41,643 INFO L290 TraceCheckUtils]: 30: Hoare triple {1787#false} assume !!(#t~post4 < 20);havoc #t~post4; {1787#false} is VALID [2022-04-28 05:12:41,643 INFO L272 TraceCheckUtils]: 31: Hoare triple {1787#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1787#false} is VALID [2022-04-28 05:12:41,643 INFO L290 TraceCheckUtils]: 32: Hoare triple {1787#false} ~cond := #in~cond; {1787#false} is VALID [2022-04-28 05:12:41,643 INFO L290 TraceCheckUtils]: 33: Hoare triple {1787#false} assume 0 == ~cond; {1787#false} is VALID [2022-04-28 05:12:41,644 INFO L290 TraceCheckUtils]: 34: Hoare triple {1787#false} assume !false; {1787#false} is VALID [2022-04-28 05:12:41,644 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:12:41,644 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:12:41,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:12:41,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196531159] [2022-04-28 05:12:41,644 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:12:41,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849092607] [2022-04-28 05:12:41,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849092607] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:12:41,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:12:41,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 05:12:41,645 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:12:41,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [975923399] [2022-04-28 05:12:41,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [975923399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:12:41,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:12:41,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 05:12:41,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411103510] [2022-04-28 05:12:41,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:12:41,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-04-28 05:12:41,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:12:41,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 05:12:41,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:12:41,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 05:12:41,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:12:41,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 05:12:41,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 05:12:41,675 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 05:12:41,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:12:41,805 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2022-04-28 05:12:41,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 05:12:41,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2022-04-28 05:12:41,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:12:41,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 05:12:41,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-28 05:12:41,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 05:12:41,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-28 05:12:41,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2022-04-28 05:12:41,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:12:41,864 INFO L225 Difference]: With dead ends: 72 [2022-04-28 05:12:41,864 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 05:12:41,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 05:12:41,866 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:12:41,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:12:41,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 05:12:41,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-28 05:12:41,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:12:41,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 05:12:41,892 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 05:12:41,892 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 05:12:41,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:12:41,894 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-28 05:12:41,894 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-28 05:12:41,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:12:41,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:12:41,894 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-04-28 05:12:41,895 INFO L87 Difference]: Start difference. First operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-04-28 05:12:41,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:12:41,896 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-28 05:12:41,896 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-28 05:12:41,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:12:41,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:12:41,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:12:41,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:12:41,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 05:12:41,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-04-28 05:12:41,899 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 35 [2022-04-28 05:12:41,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:12:41,899 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-04-28 05:12:41,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 05:12:41,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 47 transitions. [2022-04-28 05:12:41,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:12:41,957 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-28 05:12:41,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 05:12:41,957 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:12:41,958 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:12:41,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 05:12:42,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:12:42,158 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:12:42,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:12:42,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1874551443, now seen corresponding path program 1 times [2022-04-28 05:12:42,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:12:42,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1800356650] [2022-04-28 05:12:42,160 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:12:42,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1874551443, now seen corresponding path program 2 times [2022-04-28 05:12:42,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:12:42,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271019834] [2022-04-28 05:12:42,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:12:42,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:12:42,182 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:12:42,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [113057748] [2022-04-28 05:12:42,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:12:42,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:12:42,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:12:42,185 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:12:42,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 05:12:42,241 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:12:42,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:12:42,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 05:12:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:12:42,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:12:42,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {2197#true} call ULTIMATE.init(); {2197#true} is VALID [2022-04-28 05:12:42,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {2197#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {2205#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:42,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {2205#(<= ~counter~0 0)} assume true; {2205#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:42,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2205#(<= ~counter~0 0)} {2197#true} #89#return; {2205#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:42,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {2205#(<= ~counter~0 0)} call #t~ret5 := main(); {2205#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:42,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {2205#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2205#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:42,457 INFO L272 TraceCheckUtils]: 6: Hoare triple {2205#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2205#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:42,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {2205#(<= ~counter~0 0)} ~cond := #in~cond; {2205#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:42,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {2205#(<= ~counter~0 0)} assume !(0 == ~cond); {2205#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:42,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {2205#(<= ~counter~0 0)} assume true; {2205#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:42,459 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2205#(<= ~counter~0 0)} {2205#(<= ~counter~0 0)} #81#return; {2205#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:42,459 INFO L272 TraceCheckUtils]: 11: Hoare triple {2205#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2205#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:42,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {2205#(<= ~counter~0 0)} ~cond := #in~cond; {2205#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:42,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {2205#(<= ~counter~0 0)} assume !(0 == ~cond); {2205#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:42,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {2205#(<= ~counter~0 0)} assume true; {2205#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:42,461 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2205#(<= ~counter~0 0)} {2205#(<= ~counter~0 0)} #83#return; {2205#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:42,461 INFO L290 TraceCheckUtils]: 16: Hoare triple {2205#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2205#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:42,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {2205#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2254#(<= ~counter~0 1)} is VALID [2022-04-28 05:12:42,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {2254#(<= ~counter~0 1)} assume !!(#t~post3 < 20);havoc #t~post3; {2254#(<= ~counter~0 1)} is VALID [2022-04-28 05:12:42,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {2254#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2254#(<= ~counter~0 1)} is VALID [2022-04-28 05:12:42,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {2254#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2264#(<= |main_#t~post3| 1)} is VALID [2022-04-28 05:12:42,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {2264#(<= |main_#t~post3| 1)} assume !(#t~post3 < 20);havoc #t~post3; {2198#false} is VALID [2022-04-28 05:12:42,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {2198#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2198#false} is VALID [2022-04-28 05:12:42,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {2198#false} assume !!(#t~post4 < 20);havoc #t~post4; {2198#false} is VALID [2022-04-28 05:12:42,465 INFO L272 TraceCheckUtils]: 24: Hoare triple {2198#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2198#false} is VALID [2022-04-28 05:12:42,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {2198#false} ~cond := #in~cond; {2198#false} is VALID [2022-04-28 05:12:42,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {2198#false} assume !(0 == ~cond); {2198#false} is VALID [2022-04-28 05:12:42,465 INFO L290 TraceCheckUtils]: 27: Hoare triple {2198#false} assume true; {2198#false} is VALID [2022-04-28 05:12:42,465 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2198#false} {2198#false} #85#return; {2198#false} is VALID [2022-04-28 05:12:42,465 INFO L290 TraceCheckUtils]: 29: Hoare triple {2198#false} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {2198#false} is VALID [2022-04-28 05:12:42,466 INFO L290 TraceCheckUtils]: 30: Hoare triple {2198#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2198#false} is VALID [2022-04-28 05:12:42,466 INFO L290 TraceCheckUtils]: 31: Hoare triple {2198#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2198#false} is VALID [2022-04-28 05:12:42,466 INFO L290 TraceCheckUtils]: 32: Hoare triple {2198#false} assume !(#t~post4 < 20);havoc #t~post4; {2198#false} is VALID [2022-04-28 05:12:42,466 INFO L272 TraceCheckUtils]: 33: Hoare triple {2198#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2198#false} is VALID [2022-04-28 05:12:42,466 INFO L290 TraceCheckUtils]: 34: Hoare triple {2198#false} ~cond := #in~cond; {2198#false} is VALID [2022-04-28 05:12:42,466 INFO L290 TraceCheckUtils]: 35: Hoare triple {2198#false} assume 0 == ~cond; {2198#false} is VALID [2022-04-28 05:12:42,466 INFO L290 TraceCheckUtils]: 36: Hoare triple {2198#false} assume !false; {2198#false} is VALID [2022-04-28 05:12:42,467 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 05:12:42,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:12:42,680 INFO L290 TraceCheckUtils]: 36: Hoare triple {2198#false} assume !false; {2198#false} is VALID [2022-04-28 05:12:42,681 INFO L290 TraceCheckUtils]: 35: Hoare triple {2198#false} assume 0 == ~cond; {2198#false} is VALID [2022-04-28 05:12:42,681 INFO L290 TraceCheckUtils]: 34: Hoare triple {2198#false} ~cond := #in~cond; {2198#false} is VALID [2022-04-28 05:12:42,681 INFO L272 TraceCheckUtils]: 33: Hoare triple {2198#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2198#false} is VALID [2022-04-28 05:12:42,681 INFO L290 TraceCheckUtils]: 32: Hoare triple {2198#false} assume !(#t~post4 < 20);havoc #t~post4; {2198#false} is VALID [2022-04-28 05:12:42,681 INFO L290 TraceCheckUtils]: 31: Hoare triple {2198#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2198#false} is VALID [2022-04-28 05:12:42,682 INFO L290 TraceCheckUtils]: 30: Hoare triple {2198#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2198#false} is VALID [2022-04-28 05:12:42,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {2198#false} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {2198#false} is VALID [2022-04-28 05:12:42,682 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2197#true} {2198#false} #85#return; {2198#false} is VALID [2022-04-28 05:12:42,682 INFO L290 TraceCheckUtils]: 27: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-28 05:12:42,682 INFO L290 TraceCheckUtils]: 26: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-28 05:12:42,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-28 05:12:42,682 INFO L272 TraceCheckUtils]: 24: Hoare triple {2198#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2197#true} is VALID [2022-04-28 05:12:42,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {2198#false} assume !!(#t~post4 < 20);havoc #t~post4; {2198#false} is VALID [2022-04-28 05:12:42,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {2198#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2198#false} is VALID [2022-04-28 05:12:42,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {2358#(< |main_#t~post3| 20)} assume !(#t~post3 < 20);havoc #t~post3; {2198#false} is VALID [2022-04-28 05:12:42,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {2362#(< ~counter~0 20)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2358#(< |main_#t~post3| 20)} is VALID [2022-04-28 05:12:42,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {2362#(< ~counter~0 20)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2362#(< ~counter~0 20)} is VALID [2022-04-28 05:12:42,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {2362#(< ~counter~0 20)} assume !!(#t~post3 < 20);havoc #t~post3; {2362#(< ~counter~0 20)} is VALID [2022-04-28 05:12:42,687 INFO L290 TraceCheckUtils]: 17: Hoare triple {2372#(< ~counter~0 19)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2362#(< ~counter~0 20)} is VALID [2022-04-28 05:12:42,687 INFO L290 TraceCheckUtils]: 16: Hoare triple {2372#(< ~counter~0 19)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2372#(< ~counter~0 19)} is VALID [2022-04-28 05:12:42,688 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2197#true} {2372#(< ~counter~0 19)} #83#return; {2372#(< ~counter~0 19)} is VALID [2022-04-28 05:12:42,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-28 05:12:42,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-28 05:12:42,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-28 05:12:42,688 INFO L272 TraceCheckUtils]: 11: Hoare triple {2372#(< ~counter~0 19)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2197#true} is VALID [2022-04-28 05:12:42,689 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2197#true} {2372#(< ~counter~0 19)} #81#return; {2372#(< ~counter~0 19)} is VALID [2022-04-28 05:12:42,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-28 05:12:42,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-28 05:12:42,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-28 05:12:42,689 INFO L272 TraceCheckUtils]: 6: Hoare triple {2372#(< ~counter~0 19)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2197#true} is VALID [2022-04-28 05:12:42,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {2372#(< ~counter~0 19)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2372#(< ~counter~0 19)} is VALID [2022-04-28 05:12:42,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {2372#(< ~counter~0 19)} call #t~ret5 := main(); {2372#(< ~counter~0 19)} is VALID [2022-04-28 05:12:42,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2372#(< ~counter~0 19)} {2197#true} #89#return; {2372#(< ~counter~0 19)} is VALID [2022-04-28 05:12:42,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {2372#(< ~counter~0 19)} assume true; {2372#(< ~counter~0 19)} is VALID [2022-04-28 05:12:42,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {2197#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {2372#(< ~counter~0 19)} is VALID [2022-04-28 05:12:42,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {2197#true} call ULTIMATE.init(); {2197#true} is VALID [2022-04-28 05:12:42,692 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 05:12:42,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:12:42,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271019834] [2022-04-28 05:12:42,692 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:12:42,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113057748] [2022-04-28 05:12:42,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113057748] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:12:42,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:12:42,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 05:12:42,693 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:12:42,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1800356650] [2022-04-28 05:12:42,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1800356650] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:12:42,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:12:42,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:12:42,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582586837] [2022-04-28 05:12:42,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:12:42,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2022-04-28 05:12:42,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:12:42,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 05:12:42,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:12:42,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:12:42,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:12:42,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:12:42,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 05:12:42,727 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 05:12:42,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:12:42,887 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-28 05:12:42,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 05:12:42,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2022-04-28 05:12:42,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:12:42,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 05:12:42,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-28 05:12:42,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 05:12:42,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-28 05:12:42,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2022-04-28 05:12:42,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:12:42,944 INFO L225 Difference]: With dead ends: 63 [2022-04-28 05:12:42,944 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 05:12:42,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:12:42,946 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:12:42,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 82 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:12:42,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 05:12:42,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-28 05:12:42,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:12:42,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 05:12:42,986 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 05:12:42,986 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 05:12:42,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:12:42,988 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-28 05:12:42,988 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-28 05:12:42,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:12:42,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:12:42,988 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 42 states. [2022-04-28 05:12:42,989 INFO L87 Difference]: Start difference. First operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 42 states. [2022-04-28 05:12:42,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:12:42,991 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-28 05:12:42,991 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-28 05:12:42,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:12:42,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:12:42,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:12:42,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:12:42,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 05:12:42,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2022-04-28 05:12:42,994 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 37 [2022-04-28 05:12:42,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:12:42,994 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2022-04-28 05:12:42,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 05:12:42,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 49 transitions. [2022-04-28 05:12:43,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:12:43,048 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-28 05:12:43,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 05:12:43,049 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:12:43,049 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:12:43,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 05:12:43,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:12:43,250 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:12:43,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:12:43,250 INFO L85 PathProgramCache]: Analyzing trace with hash 815990494, now seen corresponding path program 1 times [2022-04-28 05:12:43,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:12:43,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [575296382] [2022-04-28 05:12:43,251 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:12:43,251 INFO L85 PathProgramCache]: Analyzing trace with hash 815990494, now seen corresponding path program 2 times [2022-04-28 05:12:43,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:12:43,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499695313] [2022-04-28 05:12:43,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:12:43,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:12:43,270 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:12:43,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [964941107] [2022-04-28 05:12:43,271 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:12:43,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:12:43,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:12:43,272 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:12:43,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 05:12:43,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:12:43,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:12:43,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 05:12:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:12:43,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:12:43,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {2722#true} call ULTIMATE.init(); {2722#true} is VALID [2022-04-28 05:12:43,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {2722#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {2730#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:43,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {2730#(<= ~counter~0 0)} assume true; {2730#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:43,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2730#(<= ~counter~0 0)} {2722#true} #89#return; {2730#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:43,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {2730#(<= ~counter~0 0)} call #t~ret5 := main(); {2730#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:43,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {2730#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2730#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:43,669 INFO L272 TraceCheckUtils]: 6: Hoare triple {2730#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2730#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:43,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {2730#(<= ~counter~0 0)} ~cond := #in~cond; {2730#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:43,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {2730#(<= ~counter~0 0)} assume !(0 == ~cond); {2730#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:43,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {2730#(<= ~counter~0 0)} assume true; {2730#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:43,671 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2730#(<= ~counter~0 0)} {2730#(<= ~counter~0 0)} #81#return; {2730#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:43,672 INFO L272 TraceCheckUtils]: 11: Hoare triple {2730#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2730#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:43,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {2730#(<= ~counter~0 0)} ~cond := #in~cond; {2730#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:43,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {2730#(<= ~counter~0 0)} assume !(0 == ~cond); {2730#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:43,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {2730#(<= ~counter~0 0)} assume true; {2730#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:43,676 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2730#(<= ~counter~0 0)} {2730#(<= ~counter~0 0)} #83#return; {2730#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:43,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {2730#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2730#(<= ~counter~0 0)} is VALID [2022-04-28 05:12:43,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {2730#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2779#(<= ~counter~0 1)} is VALID [2022-04-28 05:12:43,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {2779#(<= ~counter~0 1)} assume !!(#t~post3 < 20);havoc #t~post3; {2779#(<= ~counter~0 1)} is VALID [2022-04-28 05:12:43,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {2779#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2779#(<= ~counter~0 1)} is VALID [2022-04-28 05:12:43,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {2779#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2789#(<= ~counter~0 2)} is VALID [2022-04-28 05:12:43,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {2789#(<= ~counter~0 2)} assume !!(#t~post3 < 20);havoc #t~post3; {2789#(<= ~counter~0 2)} is VALID [2022-04-28 05:12:43,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {2789#(<= ~counter~0 2)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2789#(<= ~counter~0 2)} is VALID [2022-04-28 05:12:43,680 INFO L290 TraceCheckUtils]: 23: Hoare triple {2789#(<= ~counter~0 2)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2799#(<= ~counter~0 3)} is VALID [2022-04-28 05:12:43,680 INFO L290 TraceCheckUtils]: 24: Hoare triple {2799#(<= ~counter~0 3)} assume !!(#t~post4 < 20);havoc #t~post4; {2799#(<= ~counter~0 3)} is VALID [2022-04-28 05:12:43,681 INFO L272 TraceCheckUtils]: 25: Hoare triple {2799#(<= ~counter~0 3)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2799#(<= ~counter~0 3)} is VALID [2022-04-28 05:12:43,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {2799#(<= ~counter~0 3)} ~cond := #in~cond; {2799#(<= ~counter~0 3)} is VALID [2022-04-28 05:12:43,682 INFO L290 TraceCheckUtils]: 27: Hoare triple {2799#(<= ~counter~0 3)} assume !(0 == ~cond); {2799#(<= ~counter~0 3)} is VALID [2022-04-28 05:12:43,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {2799#(<= ~counter~0 3)} assume true; {2799#(<= ~counter~0 3)} is VALID [2022-04-28 05:12:43,683 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2799#(<= ~counter~0 3)} {2799#(<= ~counter~0 3)} #85#return; {2799#(<= ~counter~0 3)} is VALID [2022-04-28 05:12:43,683 INFO L290 TraceCheckUtils]: 30: Hoare triple {2799#(<= ~counter~0 3)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {2799#(<= ~counter~0 3)} is VALID [2022-04-28 05:12:43,683 INFO L290 TraceCheckUtils]: 31: Hoare triple {2799#(<= ~counter~0 3)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2799#(<= ~counter~0 3)} is VALID [2022-04-28 05:12:43,684 INFO L290 TraceCheckUtils]: 32: Hoare triple {2799#(<= ~counter~0 3)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2827#(<= |main_#t~post4| 3)} is VALID [2022-04-28 05:12:43,684 INFO L290 TraceCheckUtils]: 33: Hoare triple {2827#(<= |main_#t~post4| 3)} assume !(#t~post4 < 20);havoc #t~post4; {2723#false} is VALID [2022-04-28 05:12:43,684 INFO L272 TraceCheckUtils]: 34: Hoare triple {2723#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2723#false} is VALID [2022-04-28 05:12:43,684 INFO L290 TraceCheckUtils]: 35: Hoare triple {2723#false} ~cond := #in~cond; {2723#false} is VALID [2022-04-28 05:12:43,685 INFO L290 TraceCheckUtils]: 36: Hoare triple {2723#false} assume 0 == ~cond; {2723#false} is VALID [2022-04-28 05:12:43,685 INFO L290 TraceCheckUtils]: 37: Hoare triple {2723#false} assume !false; {2723#false} is VALID [2022-04-28 05:12:43,685 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:12:43,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:12:43,971 INFO L290 TraceCheckUtils]: 37: Hoare triple {2723#false} assume !false; {2723#false} is VALID [2022-04-28 05:12:43,972 INFO L290 TraceCheckUtils]: 36: Hoare triple {2723#false} assume 0 == ~cond; {2723#false} is VALID [2022-04-28 05:12:43,972 INFO L290 TraceCheckUtils]: 35: Hoare triple {2723#false} ~cond := #in~cond; {2723#false} is VALID [2022-04-28 05:12:43,972 INFO L272 TraceCheckUtils]: 34: Hoare triple {2723#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2723#false} is VALID [2022-04-28 05:12:43,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {2855#(< |main_#t~post4| 20)} assume !(#t~post4 < 20);havoc #t~post4; {2723#false} is VALID [2022-04-28 05:12:43,973 INFO L290 TraceCheckUtils]: 32: Hoare triple {2859#(< ~counter~0 20)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2855#(< |main_#t~post4| 20)} is VALID [2022-04-28 05:12:43,973 INFO L290 TraceCheckUtils]: 31: Hoare triple {2859#(< ~counter~0 20)} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2859#(< ~counter~0 20)} is VALID [2022-04-28 05:12:43,974 INFO L290 TraceCheckUtils]: 30: Hoare triple {2859#(< ~counter~0 20)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {2859#(< ~counter~0 20)} is VALID [2022-04-28 05:12:43,974 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2722#true} {2859#(< ~counter~0 20)} #85#return; {2859#(< ~counter~0 20)} is VALID [2022-04-28 05:12:43,974 INFO L290 TraceCheckUtils]: 28: Hoare triple {2722#true} assume true; {2722#true} is VALID [2022-04-28 05:12:43,974 INFO L290 TraceCheckUtils]: 27: Hoare triple {2722#true} assume !(0 == ~cond); {2722#true} is VALID [2022-04-28 05:12:43,975 INFO L290 TraceCheckUtils]: 26: Hoare triple {2722#true} ~cond := #in~cond; {2722#true} is VALID [2022-04-28 05:12:43,975 INFO L272 TraceCheckUtils]: 25: Hoare triple {2859#(< ~counter~0 20)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2722#true} is VALID [2022-04-28 05:12:43,975 INFO L290 TraceCheckUtils]: 24: Hoare triple {2859#(< ~counter~0 20)} assume !!(#t~post4 < 20);havoc #t~post4; {2859#(< ~counter~0 20)} is VALID [2022-04-28 05:12:43,976 INFO L290 TraceCheckUtils]: 23: Hoare triple {2887#(< ~counter~0 19)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2859#(< ~counter~0 20)} is VALID [2022-04-28 05:12:43,976 INFO L290 TraceCheckUtils]: 22: Hoare triple {2887#(< ~counter~0 19)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2887#(< ~counter~0 19)} is VALID [2022-04-28 05:12:43,977 INFO L290 TraceCheckUtils]: 21: Hoare triple {2887#(< ~counter~0 19)} assume !!(#t~post3 < 20);havoc #t~post3; {2887#(< ~counter~0 19)} is VALID [2022-04-28 05:12:43,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {2897#(< ~counter~0 18)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2887#(< ~counter~0 19)} is VALID [2022-04-28 05:12:43,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {2897#(< ~counter~0 18)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2897#(< ~counter~0 18)} is VALID [2022-04-28 05:12:43,978 INFO L290 TraceCheckUtils]: 18: Hoare triple {2897#(< ~counter~0 18)} assume !!(#t~post3 < 20);havoc #t~post3; {2897#(< ~counter~0 18)} is VALID [2022-04-28 05:12:43,978 INFO L290 TraceCheckUtils]: 17: Hoare triple {2907#(< ~counter~0 17)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2897#(< ~counter~0 18)} is VALID [2022-04-28 05:12:43,979 INFO L290 TraceCheckUtils]: 16: Hoare triple {2907#(< ~counter~0 17)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2907#(< ~counter~0 17)} is VALID [2022-04-28 05:12:43,979 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2722#true} {2907#(< ~counter~0 17)} #83#return; {2907#(< ~counter~0 17)} is VALID [2022-04-28 05:12:43,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {2722#true} assume true; {2722#true} is VALID [2022-04-28 05:12:43,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {2722#true} assume !(0 == ~cond); {2722#true} is VALID [2022-04-28 05:12:43,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {2722#true} ~cond := #in~cond; {2722#true} is VALID [2022-04-28 05:12:43,980 INFO L272 TraceCheckUtils]: 11: Hoare triple {2907#(< ~counter~0 17)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2722#true} is VALID [2022-04-28 05:12:43,980 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2722#true} {2907#(< ~counter~0 17)} #81#return; {2907#(< ~counter~0 17)} is VALID [2022-04-28 05:12:43,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {2722#true} assume true; {2722#true} is VALID [2022-04-28 05:12:43,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {2722#true} assume !(0 == ~cond); {2722#true} is VALID [2022-04-28 05:12:43,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {2722#true} ~cond := #in~cond; {2722#true} is VALID [2022-04-28 05:12:43,981 INFO L272 TraceCheckUtils]: 6: Hoare triple {2907#(< ~counter~0 17)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2722#true} is VALID [2022-04-28 05:12:43,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {2907#(< ~counter~0 17)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2907#(< ~counter~0 17)} is VALID [2022-04-28 05:12:43,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {2907#(< ~counter~0 17)} call #t~ret5 := main(); {2907#(< ~counter~0 17)} is VALID [2022-04-28 05:12:43,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2907#(< ~counter~0 17)} {2722#true} #89#return; {2907#(< ~counter~0 17)} is VALID [2022-04-28 05:12:43,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {2907#(< ~counter~0 17)} assume true; {2907#(< ~counter~0 17)} is VALID [2022-04-28 05:12:43,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {2722#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);~counter~0 := 0; {2907#(< ~counter~0 17)} is VALID [2022-04-28 05:12:43,985 INFO L272 TraceCheckUtils]: 0: Hoare triple {2722#true} call ULTIMATE.init(); {2722#true} is VALID [2022-04-28 05:12:43,985 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 05:12:43,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:12:43,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499695313] [2022-04-28 05:12:43,985 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:12:43,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964941107] [2022-04-28 05:12:43,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964941107] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:12:43,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:12:43,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 05:12:43,986 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:12:43,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [575296382] [2022-04-28 05:12:43,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [575296382] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:12:43,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:12:43,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 05:12:43,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385014782] [2022-04-28 05:12:43,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:12:43,987 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-04-28 05:12:43,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:12:43,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 05:12:44,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:12:44,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 05:12:44,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:12:44,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 05:12:44,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 05:12:44,033 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 05:12:44,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:12:44,286 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-04-28 05:12:44,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 05:12:44,287 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-04-28 05:12:44,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:12:44,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 05:12:44,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2022-04-28 05:12:44,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 05:12:44,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2022-04-28 05:12:44,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 66 transitions. [2022-04-28 05:12:44,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:12:44,344 INFO L225 Difference]: With dead ends: 67 [2022-04-28 05:12:44,344 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 05:12:44,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-04-28 05:12:44,345 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 30 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:12:44,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 96 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:12:44,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 05:12:44,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2022-04-28 05:12:44,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:12:44,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 54 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 05:12:44,402 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 54 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 05:12:44,406 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 54 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 05:12:44,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:12:44,409 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-28 05:12:44,409 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-28 05:12:44,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:12:44,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:12:44,409 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 60 states. [2022-04-28 05:12:44,410 INFO L87 Difference]: Start difference. First operand has 54 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 60 states. [2022-04-28 05:12:44,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:12:44,412 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-28 05:12:44,412 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-04-28 05:12:44,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:12:44,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:12:44,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:12:44,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:12:44,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 05:12:44,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-04-28 05:12:44,414 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 38 [2022-04-28 05:12:44,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:12:44,415 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-04-28 05:12:44,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 05:12:44,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 63 transitions. [2022-04-28 05:12:44,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:12:44,492 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-04-28 05:12:44,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 05:12:44,493 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:12:44,493 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:12:44,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 05:12:44,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:12:44,694 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:12:44,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:12:44,694 INFO L85 PathProgramCache]: Analyzing trace with hash 817777954, now seen corresponding path program 1 times [2022-04-28 05:12:44,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:12:44,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [590615565] [2022-04-28 05:12:44,695 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:12:44,695 INFO L85 PathProgramCache]: Analyzing trace with hash 817777954, now seen corresponding path program 2 times [2022-04-28 05:12:44,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:12:44,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327807134] [2022-04-28 05:12:44,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:12:44,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:12:44,714 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:12:44,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1026363547] [2022-04-28 05:12:44,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:12:44,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:12:44,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:12:44,716 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 05:12:44,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process